Homeostatic Architectures for Robust Spatial Computing

For open-ended computational growth, we argue that: (1) Instead of hardwiring and hiding the spatial relationships of computing components, computer architecture should expose and soften them, and (2) Instead of minimizing reliability as just a hardware problem, robustness should climb the computational stack toward the end users. We suggest that eventually all truly large-scale computers will be robust spatial computers -- even if intended neither for overtly spatialized tasks, nor harsh environment deployments. This paper is an introduction for the spatial computing community to the Movable Feast Machine (MFM), a computing model in the spirit of an object-oriented asynchronous cellular automata, with which we are exploring robust, indefinitely scalable computations. We briefly motivate the approach and present the model, then illustrate some robustness mechanisms such as redundancy, sloppiness, and homeostasis, showing how a basic task like sorting can be reconceived for robustness within a homeostatic architecture.

[1]  David H. Ackley,et al.  Physical Evolutionary Computation , 2011 .

[2]  Jacob Beal,et al.  Composable continuous-space programs for robotic swarms , 2010, Neural Computing and Applications.

[3]  J. Neumann The General and Logical Theory of Au-tomata , 1963 .

[4]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[5]  Frédéric Gruau,et al.  Programming self developing blob machines for spatial computing , 2007, Computing Media and Languages for Space-Oriented Computation.

[6]  David G. Green,et al.  Ordered asynchronous processes in multi-agent systems , 2005 .

[7]  Daniel Marcos Chapiro,et al.  Globally-asynchronous locally-synchronous systems , 1985 .

[8]  D. Krakauer Robustness in Biological Systems: A Provisional Taxonomy , 2006 .

[9]  Evaggelia Pitoura,et al.  Locating Objects in Mobile Computing , 2001, IEEE Trans. Knowl. Data Eng..

[10]  S. Wolfram Statistical mechanics of cellular automata , 1983 .

[11]  Nazim Fatès,et al.  Robustness of Cellular Automata in the Light of Asynchronous Information Transmission , 2011, UC.

[12]  Lance R. Williams Artificial cells as reified quines , 2011, ECAL.

[13]  Chrystopher L. Nehaniv Asynchronous Automata Networks Can Emulate any Synchronous Automata Network , 2004, Int. J. Algebra Comput..

[14]  Ferdinand Peper,et al.  Embedding Universal Delay-Insensitive Circuits in Asynchronous Cellular Spaces , 2003, Fundam. Informaticae.

[15]  David H. Ackley,et al.  Pursue Robust Indefinite Scalability , 2011, HotOS.

[16]  Jacob Beal,et al.  Spatial Computing: Distributed Systems That Take Advantage of Our Geometric World , 2011, TAAS.