Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Flits: Pervasive Computing for Processor and Memory Constrained Systems

Published

Author(s)

William J. Majurski, Alden A. Dima, Mary T. Laamanen

Abstract

Many pervasive computing software technologies are targeted for 32-bit desktop platforms. However, there are innumerable 8, 16, and 32-bit microcontroller and microprocessor-based embedded systems that do not support the resource requirements of these technologies. We describe ongoing research whose goal is to explore the feasibility of creating a portable runtime-environment capable of executing across a wide variety of 8, 16, and 32-bit processors and offering mobile code and high level language support. Our solution adapts a version of the language Forth called FCode and its environment to fit these needs. We go on to define the concept of a flit -- a software construct similar to an applet but tailored to the needs of lower resource solutions to pervasive computing. We then describe our laboratory prototype and some early performance measurements.
Proceedings Title
International Workshop on Pervasive Computing in Conjunction with the 29th International Conference on Parallel Processing
Conference Dates
August 21-24, 2000
Conference Location
Toronto, CA
Conference Title
International Workshop on Pervasive Computing

Keywords

fCode, Forth, memory constrained systems, mobile code, pervasive computing

Citation

Majurski, W. , Dima, A. and Laamanen, M. (2000), Flits: Pervasive Computing for Processor and Memory Constrained Systems, International Workshop on Pervasive Computing in Conjunction with the 29th International Conference on Parallel Processing, Toronto, CA, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=151681 (Accessed April 25, 2024)
Created January 1, 2000, Updated February 17, 2017