A Movable Architecture for Robust Spatial Computing

Foropen-endedcomputationalgrowth,wearguethat:(i)insteadofhardwiringandhidingcomponent spatial relationships, computer architecture should soften and expose them; and (2) instead of relegating reliability to hardware, robustness must climb the computational stack toward the end users.Wesuggestthateventuallyalltrulylarge-scalecomputerswillberobustspatialcomputers—even if intended neither for spatial tasks nor harsh environments. This paper is an extended 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. We motivate the approach and then present the model, touching on robustness mechanisms such as redundancy, compartmentalization and homeostasis. We provide simulation data from prototype movable elements such as self-healing wire for data transport and movable ‘membrane’ rings for spatial segregation, and illustrate how some larger computations like sorting or evaluating a lambda expression can be reconceived for robustness and movability within a spatial computing architecture.

[1]  Marco Tomassini,et al.  Evolving Robust Asynchronous Cellular Automata for the Density Task , 2002, Complex Syst..

[2]  Robert E. Lyons,et al.  The Use of Triple-Modular Redundancy to Improve Computer Reliability , 1962, IBM J. Res. Dev..

[3]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[4]  Carl Hewitt,et al.  A Universal Modular ACTOR Formalism for Artificial Intelligence , 1973, IJCAI.

[5]  Joe Abley,et al.  Operation of Anycast Services , 2006, RFC.

[6]  Digital Visual Interface (DVI) , 2012 .

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

[8]  Erik D. Demaine,et al.  Reconfigurable asynchronous logic automata: (RALA) , 2010, POPL '10.

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

[10]  D. Ackley A connectionist machine for genetic hillclimbing , 1987 .

[11]  Neil Gershenfeld,et al.  Aligning the representation and reality of computation with asynchronous logic automata , 2011, Computing.

[12]  de Ng Dick Bruijn Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .

[13]  Marco Tomassini,et al.  Evolving Asynchronous and Scalable Non-uniform Cellular Automata , 1997, ICANNGA.

[14]  Radhika Nagpal,et al.  Automated global-to-local programming in 1-D spatial multi-agent systems , 2008, AAMAS.

[15]  Daniel P. Siewiorek,et al.  High-availability computer systems , 1991, Computer.

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

[17]  Jacob Beal,et al.  Organizing the Aggregate: Languages for Spatial Computing , 2012, ArXiv.

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

[19]  F. Lemmermeyer Error-correcting Codes , 2005 .

[20]  J. Schwartz,et al.  Theory of Self-Reproducing Automata , 1967 .

[21]  W. W. Peterson,et al.  Error-Correcting Codes. , 1962 .

[22]  Franco Zambonelli,et al.  Programming pervasive and mobile computing applications: The TOTA approach , 2009, TSEM.

[23]  Darko Stefanovic,et al.  Behavior of polycatalytic assemblies in a substrate-displaying matrix. , 2006, Journal of the American Chemical Society.

[24]  Franck Cappello,et al.  Toward Exascale Resilience , 2009, Int. J. High Perform. Comput. Appl..

[25]  Laurent Lefèvre,et al.  Fault tolerance for highly available internet services: concepts, approaches, and issues , 2008, IEEE Communications Surveys & Tutorials.

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

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

[28]  Tommaso Toffoli Integration of the Phase-Difference Relations in Asynchronous Sequential Networks , 1978, ICALP.

[29]  Jean-Louis Giavitto,et al.  06361 Executive Report -- Computing Media Languages for Space-Oriented Computation , 2007, Computing Media and Languages for Space-Oriented Computation.

[30]  Luidnel Maignan,et al.  The Foundation of Self-developing Blob Machines for Spatial Computing , 2008 .

[31]  Naixue Xiong,et al.  A Survey on Fault-Tolerance in Distributed Network Systems , 2009, 2009 International Conference on Computational Science and Engineering.

[32]  Dejan S. Milojicic,et al.  Process migration , 1999, ACM Comput. Surv..

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

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

[35]  John M. Emmert,et al.  A survey of fault tolerant methodologies for FPGAs , 2006, TODE.

[36]  Andrew P. Black,et al.  The development of the Emerald programming language , 2007, HOPL.

[37]  R. Kent Dybvig,et al.  Revised5 Report on the Algorithmic Language Scheme , 1986, SIGP.

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

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

[40]  P. J. Landin The Mechanical Evaluation of Expressions , 1964, Comput. J..

[41]  Philipp Slusallek,et al.  Introduction to real-time ray tracing , 2005, SIGGRAPH Courses.

[42]  Robert Hieb,et al.  Revised 5 Report on the Algorithmic Language , 1999 .

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

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

[45]  Gul A. Agha,et al.  ACTORS - a model of concurrent computation in distributed systems , 1985, MIT Press series in artificial intelligence.

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

[47]  Carl Hewitt,et al.  Actor semantics of PLANNER-73 , 1975, POPL '75.

[48]  William D. Clinger,et al.  Foundations of Actor Semantics , 1981 .

[49]  D. Rumelhart Parallel Distributed Processing Volume 1: Foundations , 1987 .

[50]  R. Murray,et al.  Timing molecular motion and production with a synthetic transcriptional clock , 2011, Proceedings of the National Academy of Sciences.

[51]  H. G. Baker,et al.  ACTOR SYSTEMS FOR REAL-TIME COMPUTATION , 1978 .

[52]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[53]  R. K. Dybvig Three implementation models for scheme , 1987 .

[54]  Dharmendra S. Modha,et al.  The cat is out of the bag: cortical simulations with 109 neurons, 1013 synapses , 2009, Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis.

[55]  Liviu Iftode,et al.  Spatial programming using smart messages: design and implementation , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[56]  Jacob Beal,et al.  Programming Manifolds , 2007, Computing Media and Languages for Space-Oriented Computation.

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

[58]  Yellu Sreenivasulu,et al.  FAST TRANSPARENT MIGRATION FOR VIRTUAL MACHINES , 2014 .

[59]  Rimon Barr,et al.  Design and implementation of a single system image operating system for ad hoc networks , 2005, MobiSys '05.

[60]  Algirdas Avizienis,et al.  The N-Version Approach to Fault-Tolerant Software , 1985, IEEE Transactions on Software Engineering.

[61]  Craig Partridge,et al.  Host Anycasting Service , 1993, RFC.

[62]  Franco Zambonelli,et al.  Spatial Computing: An Emerging Paradigm for Autonomic Computing and Communication , 2004, WAC.

[63]  Michael Treaster,et al.  A Survey of Fault-Tolerance and Fault-Recovery Techniques in Parallel Systems , 2004, ArXiv.

[64]  David H. Ackley,et al.  Homeostatic Architectures for Robust Spatial Computing , 2011, 2011 Fifth IEEE Conference on Self-Adaptive and Self-Organizing Systems Workshops.