Stone age distributed computing

A new model that depicts a network of randomized finite state machines operating in an asynchronous environment is introduced. This model, that can be viewed as a hybrid of the message passing model and cellular automata is suitable for applying the distributed computing lens to the study of networks of sub-microprocessor devices, e.g., biological cellular networks and man-made nano-networks. Although the computation and communication capabilities of each individual device in the new model are, by design, much weaker than those of an abstract computer, we show that some of the most important and extensively studied distributed computing problems can still be solved efficiently.

[1]  P. Gordon.  Numerical Cognition Without Words: Evidence from Amazonia , 2004, Science.

[2]  Boaz Patt-Shamir,et al.  Adapting to asynchronous dynamic networks (extended abstract) , 1992, STOC '92.

[3]  Ian M. Mitchell,et al.  Parallel Computation , 1999, Algorithms and Theory of Computation Handbook.

[4]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[5]  Yves Métivier,et al.  An optimal bit complexity randomized distributed MIS algorithm , 2011, Distributed Computing.

[6]  A. E. Fincham,et al.  Parallel Computation , 1999, Algorithms and Theory of Computation Handbook.

[7]  Christoph Lenzen,et al.  MIS on trees , 2011, PODC '11.

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

[9]  Leonid Barenboim,et al.  Distributed (δ+1)-coloring in linear (in δ) time , 2009, STOC '09.

[10]  E. Shapiro,et al.  Programmable and autonomous computing machine made of biomolecules , 2001, Nature.

[11]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[12]  Master Gardener,et al.  Mathematical games: the fantastic combinations of john conway's new solitaire game "life , 1970 .

[13]  Sundar Vishwanathan,et al.  Locality based graph coloring , 1993, STOC.

[14]  Baruch Awerbuch,et al.  Network synchronization with polylogarithmic overhead , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[15]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[16]  Serge A. Plotkin.  Graph-theoretic techniques for parallel, distributed, and sequential computation , 1988 .

[17]  Yves Métivier,et al.  About randomised distributed graph colouring and graph partition algorithms , 2010, Inf. Comput..

[18]  Ian F. Akyildiz.  Nanonetworks: A new frontier in communications , 2010, 2010 International Conference on e-Business (ICE-B).

[19]  Roger Wattenhofer,et al.  Slotted programming for sensor networks , 2010, IPSN '10.

[20]  Noga Alon,et al.  A Biological Solution to a Fundamental Distributed Computing Problem , 2011, Science.

[21]  Michael J. Fischer,et al.  Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.

[22]  Christian Scheideler,et al.  Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[23]  Chris Hanson,et al.  Amorphous computing , 2000, Commun. ACM.

[24]  Alon Itai,et al.  A Fast and Simple Randomized Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..

[25]  James Aspnes,et al.  An Introduction to Population Protocols , 2007, Bull. EATCS.

[26]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[27]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[28]  S.-Y. Kuroda,et al.  Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[29]  Leonid Barenboim,et al.  Combinatorial Algorithms for Distributed Graph Coloring , 2011, DISC.

[30]  David Eisenstat,et al.  Fast computation by population protocols with a leader , 2006, Distributed Computing.

[31]  C. Scheideler,et al.  Distributed coloring in O~(⎷(log n)) bit rounds , 2006, IPDPS.

[32]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[33]  Leonid Barenboim,et al.  The Locality of Distributed Symmetry Breaking , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[34]  Paul G. Spirakis,et al.  The Dynamics of Probabilistic Population Protocols , 2008, DISC.

[35]  Stephen Wolfram,et al.  A New Kind of Science , 2003, Artificial Life.

[36]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[37]  Imrich Chlamtac,et al.  On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.

[38]  Leonid Barenboim,et al.  Distributed (Delta+1)-Coloring in Linear (in Delta) Time , 2014, SIAM J. Comput..

[39]  Noam Chomsky,et al.  Three models for the description of language , 1956, IRE Trans. Inf. Theory.

[40]  Roger Wattenhofer,et al.  Distributed Coloring Depending on the Chromatic Number or the Neighborhood Growth , 2011, SIROCCO.

[41]  Roger Wattenhofer,et al.  What cannot be computed locally! , 2004, PODC '04.

[42]  Parag A. Pathak,et al.  Massachusetts Institute of Technology , 1964, Nature.

[43]  Paul G. Spirakis,et al.  New Models for Population Protocols , 2011, Synthesis Lectures on Distributed Computing Theory.

[44]  Michael J. Fischer,et al.  Stably Computable Properties of Network Graphs , 2005, DCOSS.

[45]  Richard Cole,et al.  Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

[46]  W. K. Purves.  Life: The Science of Biology , 1985 .

[47]  Leonid Barenboim,et al.  Combinatorial algorithms for distributed graph coloring , 2011, Distributed Computing.

[48]  Leonid Barenboim,et al.  Deterministic Distributed Vertex Coloring in Polylogarithmic Time , 2010, JACM.

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

[50]  Andrew V. Goldberg,et al.  Parallel Symmetry-Breaking in Sparse Graphs , 1988, SIAM J. Discret. Math..

[51]  Roger Wattenhofer,et al.  An optimal maximal independent set algorithm for bounded-independence graphs , 2010, Distributed Computing.

[52]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[53]  Fabian Kuhn,et al.  Deploying Wireless Networks with Beeps , 2010, DISC.

[54]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[55]  Fabian Kuhn.  Weak graph colorings: distributed algorithms and applications , 2009, SPAA '09.

[56]  Y. Benenson.  Biomolecular computing systems: principles, progress and potential , 2012, Nature Reviews Genetics.

[57]  Jukka Suomela,et al.  Survey of local algorithms , 2013, CSUR.

[58]  Noga Alon,et al.  Beeping a maximal independent set , 2011, Distributed Computing.