Dynamically Defined Processes for Spatial Computers

  • Authors:
  • Jacob Beal

  • Affiliations:
  • -

  • Venue:
  • SASOW '10 Proceedings of the 2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshop
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A program executing on a spatial computer must be able to react to changes in its environment. For example, a sensor network tracking flocks of birds needs to be able to create a spatially-extended tracking process for each flock that it detects, and these processes should not interfere with one another. When dynamically defined processes are identified using fixed equivalence classes (e.g. UIDs), however, the independent creation dilemma means that no algorithm can safely create processes in less than O(diameter/c) time, where c is the speed of information propagating through the network. This dilemma can be evaded by defining the extent of a process with a comparator that does not form an equivalence class. I an example of the dilemma and its resolution using the example of a sensor network tracking flocks of birds, as well as proposing an extension of the Proto spatial computing language[1] to handle dynamically defined processes.