Pursue Robust Indefinite Scalability

For research insights and development potential, we should explore computer architectures designed to scale indefinitely. Given physical limits, we argue an indefinitely scalable computer should or must (1) reveal to programmers its component spatial relationships, (2) forego unique addresses, and (3) operate asynchronously. Further, such a machine and its programming must be inherently robust against local failures and outages, and be operable during its own construction. We propose the indefinitely scalable Movable Feast Machine, which defers many architectural decisions to an execution model that associates processing, memory, and communications functions with movable bit patterns rather than fixed locations. We illustrate basic and novel computational elements such as self-healing wire, simple cell membranes for modularity, and robust stochastic sorting by movable self-replicating programs.

[1]  David H. Ackley,et al.  Building diverse computer systems , 1997, Proceedings. The Sixth Workshop on Hot Topics in Operating Systems (Cat. No.97TB100133).

[2]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[3]  Tommaso Toffoli,et al.  Programmable matter methods , 1999, Future Gener. Comput. Syst..

[4]  P. P. Chaudhuri,et al.  A Survey on Cellular Automata ∗ , 2003 .

[5]  Nobuyuki Matsui,et al.  Self-Timed Cellular Automata and their computational ability , 2002, Future Gener. Comput. Syst..

[6]  Amar Phanishayee,et al.  FAWNdamentally Power-efficient Clusters , 2009, HotOS.

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

[8]  Tommaso Toffoli,et al.  Cellular automata machines - a new environment for modeling , 1987, MIT Press series in scientific computation.