ABSTRACT
Esparza and Reiter have recently conducted a systematic comparative study of models of distributed computing consisting of a network of identical finite-state automata that cooperate to decide if the underlying graph of the network satisfies a given property. The study classifies models according to four criteria, and shows that twenty-four initially possible combinations collapse into seven equivalence classes with respect to their decision power, i.e. the properties that the automata of each class can decide. However, Esparza and Reiter only show (proper) inclusions between the classes, and so do not characterise their decision power. In this paper we do so for labelling properties, i.e. properties that depend only on the labels of the nodes, but not on the structure of the graph. In particular, majority (whether more nodes carry label a than b) is a labelling property. Our results show that only one of the seven equivalence classes identified by Esparza and Reiter can decide majority for arbitrary networks. We then study the expressive power of the classes on bounded-degree networks, and show that three classes can. In particular, we present an algorithm for majority that works for all bounded-degree networks under adversarial schedulers, i.e. even if the scheduler must only satisfy that every node makes a move infinitely often, and prove that no such algorithm can work for arbitrary networks.
Supplemental Material
- Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, and Fabian Kuhn. 2013. Beeping a maximal independent set. Distributed Comput., Vol. 26, 4 (2013), 195--208.Google ScholarDigital Library
- Dana Angluin. 1980. Local and Global Properties in Networks of Processors (Extended Abstract). In STOC. ACM, 82--93.Google Scholar
- Dana Angluin, James Aspnes, Melody Chan, Michael J Fischer, Hong Jiang, and René Peralta. 2005. Stably computable properties of network graphs. In International Conference on Distributed Computing in Sensor Systems. Springer, 63--74.Google ScholarDigital Library
- Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, and René Peralta. 2006. Computation in networks of passively mobile finite-state sensors. Distributed Computing, Vol. 18, 4 (2006), 235--253.Google ScholarCross Ref
- Dana Angluin, James Aspnes, and David Eisenstat. 2008. Fast computation by population protocols with a leader. Distributed Comput., Vol. 21, 3 (2008), 183--199.Google ScholarCross Ref
- Dana Angluin, James Aspnes, David Eisenstat, and Eric Ruppert. 2007. The computational power of population protocols. Distributed Comput., Vol. 20, 4 (2007), 279--304.Google ScholarCross Ref
- James Aspnes. 2017. Clocked Population Protocols. In Proc. ACM Symposium on Principles of Distributed Computing (PODC). 431--440.Google ScholarDigital Library
- Baruch Awerbuch. 1985. Complexity of Network Synchronization. J. ACM, Vol. 32, 4 (1985), 804--823. https://doi.org/10.1145/4221.4227Google ScholarDigital Library
- Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, and Tomasz Radzik. 2018. A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. In DISC (LIPIcs, Vol. 121). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 10:1--10:18.Google Scholar
- Andreas Bilke, Colin Cooper, Robert Elsässer, and Tomasz Radzik. 2017. Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log(^mbox2 ) n) States and O(log(2) n) Convergence Time. In PODC. ACM, 451--453.Google ScholarDigital Library
- Michael Blondin, Javier Esparza, and Stefan Jaax. 2019. Expressive Power of Broadcast Consensus Protocols. In CONCUR (LIPIcs, Vol. 140). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 31:1--31:16.Google Scholar
- Olivier Bournez and Jonas Lefèvre. 2013. Population Protocols on Graphs: A Hierarchy. In UCNC (Lecture Notes in Computer Science, Vol. 7956). Springer, 31--42.Google ScholarCross Ref
- Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, and Paul G. Spirakis. 2013. The computational power of simple protocols for self-awareness on graphs. Theor. Comput. Sci., Vol. 512 (2013), 98--118.Google ScholarDigital Library
- Alejandro Cornejo and Fabian Kuhn. 2010. Deploying Wireless Networks with Beeps. In DISC (Lecture Notes in Computer Science, Vol. 6343). Springer, 148--162.Google ScholarCross Ref
- Philipp Czerner, Roland Guttenberg, Martin Helfrich, and Javier Esparza. 2021. Decision Power of Weak Asynchronous Models of Distributed Computing. CoRR, Vol. abs/2102.11630 (2021). arxiv: 2102.11630 https://arxiv.org/abs/2102.11630Google Scholar
- Yuval Emek and Roger Wattenhofer. 2013. Stone age distributed computing. In PODC. ACM, 137--146.Google Scholar
- Javier Esparza and Fabian Reiter. 2020. A Classification of Weak Asynchronous Models of Distributed Computing. In CONCUR (LIPIcs, Vol. 171). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 10:1--10:16.Google Scholar
- Ofer Feinerman and Amos Korman. 2013. Theoretical Distributed Computing Meets Biology: A Review. In ICDCIT (Lecture Notes in Computer Science, Vol. 7753). Springer, 1--18.Google ScholarCross Ref
- Nissim Francez. 1986. Fairness. Springer.Google Scholar
- Rachid Guerraoui and Eric Ruppert. 2009. Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. In ICALP (2) (Lecture Notes in Computer Science, Vol. 5556). Springer, 484--495.Google Scholar
- Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, and Jonni Virtema. 2015. Weak models of distributed computing, with connections to modal logic. Distributed Computing, Vol. 28, 1 (2015), 31--53.Google ScholarDigital Library
- Adrian Kosowski and Przemyslaw Uznanski. 2018. Brief Announcement: Population Protocols Are Fast. In PODC. ACM, 475--477.Google ScholarDigital Library
- Fabian Kuhn, Nancy A. Lynch, and Rotem Oshman. 2010. Distributed computation in dynamic networks. In STOC. ACM, 513--522.Google Scholar
- Daniel Lehmann, Amir Pnueli, and Jonathan Stavi. 1981. Impartiality, Justice and Fairness: The Ethics of Concurrent Termination. In ICALP (Lecture Notes in Computer Science, Vol. 115). Springer, 264--277.Google Scholar
- Nancy A. Lynch. 1996. Distributed Algorithms .Morgan Kaufmann.Google Scholar
- Othon Michail, Ioannis Chatzigiannakis, and Paul G. Spirakis. 2011. Mediated population protocols. Theor. Comput. Sci., Vol. 412, 22 (2011), 2434--2450.Google ScholarDigital Library
- Othon Michail and Paul G. Spirakis. 2015. Terminating population protocols via some minimal global knowledge assumptions. J. Parallel Distributed Comput., Vol. 81--82 (2015), 1--10.Google ScholarDigital Library
- Saket Navlakha and Ziv Bar-Joseph. 2015. Distributed information processing in biological and computational systems. Commun. ACM, Vol. 58, 1 (2015), 94--102.Google ScholarDigital Library
- Fabian Reiter. 2017. Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment. In ICALP (LIPIcs, Vol. 80). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 100:1--100:14.Google Scholar
- David Soloveichik, Matthew Cook, Erik Winfree, and Jehoshua Bruck. 2008. Computation with finite stochastic chemical reaction networks. Natural Computing, Vol. 7, 4 (2008), 615--633.Google ScholarDigital Library
Index Terms
- Decision Power of Weak Asynchronous Models of Distributed Computing
Recommendations
Effective Simulations on Hyperbolic Networks
Cellular AutomataWe state a definition of the simulation of graph automata, which are machines built by putting copies of the same finite-state automaton at the vertices of a regular graph, reading the states of the neighbors. We first present the notion of simulation ...
Effective simulations on hyperbolic networks
Special issue on cellular automataWe state a definition of the simulation of graph automata, which are machines built by putting copies of the same finite-state automaton at the vertices of a regular graph, reading the states of the neighbors. We first present the notion of simulation ...
Leader election in plane cellular automata, only with left-right global convention
Combinatorics of the discrete plane and tilingsWe give a linear time algorithm to elect a leader. This problem originated in networking and distributed computing research. Given a graph, its vertices represent processors (here finite state machines), and its edges communication lines (here ...
Comments