Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
Abstract
A spatial computer is a collection of devices filling spacewhose ability to interact is strongly dependent on theirproximity. Previously, we have showed that programmingsuch a computer as a continuous space can allow self-scalingacross computers with different device distributionsand can increase robustness against device failure. Wehave extended these ideas to time, allowing self-scalingacross computers with different communication and executionrates. We have used a network of 24 Mica2 Motes todemonstrate that a program exploiting these ideas showsminimal difference in behavior as the time between programsteps ranges from 100 ms to 300 ms and on a configurationwith mixed rates.
