Pursue robust indefinite scalability

  • Authors:
  • David H. Ackley;Daniel C. Cannon

  • Affiliations:
  • Dept. of Computer Science, The University of New Mexico, Albuquerque, NM;Dept. of Computer Science, The University of New Mexico, Albuquerque, NM

  • Venue:
  • HotOS'13 Proceedings of the 13th USENIX conference on Hot topics in operating systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.