skip to main content
research-article

Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election

Published: 17 November 2020 Publication History

Abstract

The model of population protocols refers to the growing in popularity theoretical framework suitable for studying pairwise interactions within a large collection of simple indistinguishable entities, frequently called agents. In this article, the emphasis is on the space complexity of fast leader election in population protocols governed by the random scheduler, which uniformly at random selects pairwise interactions between n agents.
One of the main results of this article is the first fast space optimal leader election protocol, which works with high probability. The new protocol operates in parallel time O(log2 n) equivalent to O(nlog2 n) sequential pairwise interactions with each agent’s memory space limited to O(log log n) states. This double logarithmic space utilisation matches asymptotically the lower bound ½log log n on the number of states utilised by agents in any leader election algorithm with the running time o(n\polylog n); see Reference [7].
Our new solution expands also on the classical concept of phase clocks used to synchronise and to coordinate computations in distributed algorithms. In particular, we formalise the concept and provide a rigorous analysis of phase clocks operating in nested modes. Our arguments are also valid for phase clocks propelled by multiple leaders. The combination of the two results in the first time-space efficient leader election algorithm. We also provide a complete formal argumentation, indicating that our solution is always correct, fast, and it works with high probability.

References

[1]
A. Andoni and I. P. Razenshteyn. 2016. Tight lower bounds for data-dependent locality-sensitive hashing. In Proceedings of the Symposium on Computational Geometry. 9:1--9:11.
[2]
D. Angluin. 1980. Local and global properties in networks of processors. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC’80). 82--93.
[3]
D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta. 2004. Computation in networks of passively mobile finite-state sensors. In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC’04). 290--299.
[4]
D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta. 2006. Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18, 4 (2006), 235--253.
[5]
D. Angluin, J. Aspnes, and D. Eisenstat. 2008. Fast computation by population protocols with a leader. Distrib. Comput. 21, 3 (2008), 183--199.
[6]
D. Angluin, J. Aspnes, and D. Eisenstat. 2008. A simple population protocol for fast robust approximate majority. Distrib. Comput. 21, 2 (2008), 87--102.
[7]
D. Alistarh, J. Aspnes, D. Eisenstat, R. Gelashvili, and R. L. Rivest. 2017. Time-space trade-offs in population protocols. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’17). 2560--2579.
[8]
D. Alistarh, J. Aspnes, and R. Gelashvili. 2018. Space-optimal majority in population protocols. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’18). 2221--2239.
[9]
D. Alistarh and R. Gelashvili. 2015. Polylogarithmic-time leader election in population protocols. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP’15). 479--491.
[10]
D. Alistarh and R. Gelashvili. 2018. Recent algorithmic advances in population protocols. ACM SIGACT News 49, 3 (2018), 63--73.
[11]
A. Arora, S. Dolev, and M. G. Gouda. 1991. Maintaining digital clocks in step. In Proceedings of the 5th International Workshop on Distributed Algorithms. LNCS 579, 71--79.
[12]
H. Attiya and M. Snir. 1991. Better computing on the anonymous ring. J. Algor. 12 (1991), 204--238.
[13]
H. Attiya, M. Snir, and M. Warmuth. 1988. Computing on an anonymous ring. J. ACM 35 (1988), 845--875.
[14]
H. Attiya and J. Welch. 2004. Distributed Computing: Fundamentals, Simulations, and Advanced Topics. 2nd ed., Wiley.
[15]
L. Becchetti, A. E. F. Clementi, E. Natale, F. Pasquale, and R. Silvestri. 2015. Plurality consensus in the gossip model. In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’15). 371--390.
[16]
S. Ben Nun, T. Kopelowitz, M. Kraus, and E. Porat. 2020. An O(log3/2 n) parallel time population protocol for majority with O(log n) states. In Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC’20). 191--199.
[17]
P. Berenbrink, R. Elsässer, T. Friedetzky, D. Kaaser, P. Kling, and T. Radzik. 2018. A population protocol for exact majority with O(log5/3 n) stabilization time and Ɵ((log n) states. In Proceedings of the 32nd International Symposium on Distributed Computing. DISC 2018, 10:1--10:18.
[18]
P. Berenbrink, T. Friedetzky, G. Giakkoupis, and P. Kling. 2016. Efficient plurality consensus, or: The benefits of cleaning up from time to time. In Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP’16). 1--14.
[19]
P. Berenbrink, D. Kaaser, P. Kling, and L. Otterbach. 2018. Simple and efficient leader election. In Proceedings of the Symposium on Simplicity in Algorithms (SOSA’18). 9:1--9:11.
[20]
P. Berenbrink, G. Giakkoupis, and P. Kling. 2020. Optimal time and space leader election in population protocols. In Proceedings of the 52nd Annual ACM Symposium on Theory of Computing (STOC’20). 119--129.
[21]
A. Bilke, C. Cooper, R. Elsässer, and T. Radzik. 2017. Brief announcement: Population protocols for leader election and exact majority with O(log2 n) states and O(log2 n) convergence time. In Proceedings of the 36th ACM Symp. on Principles of Distributed Computing (PODC’17). 451--453.
[22]
P. Boldi, S. Shammah, S. Vigna, B. Codenotti, P. Gemmell, and J. Simon. 1996. Symmetry breaking in anonymous networks: Characterizations. In Proceedings of the 4th Israel Symposium on Theory of Computing and Systems (ISTCS’96). 16--26.
[23]
P. Boldi and S. Vigna. 1999. Computing anonymously with arbitrary knowledge. In Proceedings of the 18th ACM Symposium on Principles of Distributed Computing (PODC’99). 181--188.
[24]
J. E. Burns. 1980. A Formal Model for Message Passing Systems. Technical Report TR-91, Computer Science Department, Indiana University, Bloomington, IN.
[25]
L. Cardelli, M. Kwiatkowska, and L. Laurenti. 2016. Programming discrete distributions with chemical reaction networks. In Proceedings of the 22nd International Conference DNA Computing and Molecular Programming (DNA’16). 35--51.
[26]
I. Chatzigiannakis, O. Michail, S. Nikolaou, A. Pavlogiannis, and P. G. Spirakis. 2011. Passively mobile communicating machines that use restricted space. In Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing. 6--15.
[27]
H.-L. Chen, R. Cummings, D. Doty, and D. Soloveichik. 2014. Speed faults in computation by chemical reaction networks. In Distributed Computing. Springer, 16--30.
[28]
D. Dereniowski and A. Pelc. 2014. Leader election for anonymous asynchronous agents in arbitrary networks. Distrib. Comput. 27 (2014), 21--38.
[29]
S. Dobrev and A. Pelc. 2004. Leader election in rings with nonunique labels. Fundamenta Informaticae 59 (2004), 333--347.
[30]
S. Dolev and J. L. Welch. 2004. Self-stabilizing clock synchronization in the presence of Byzantine faults. J. ACM 51, 5 (2004), 780--799.
[31]
D. Doty. 2014. Timing in chemical reaction networks. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’14). SIAM, 772--784.
[32]
A. Daliot, D. Dolev, and H. Parnas. 2003 Self-stabilizing pulse synchronization inspired by biological pacemaker networks. In Proceedings of the Conference on Self-Stabilizing Systems (SSS’03). 32--48.
[33]
D. Doty and D. Soloveichik. 2015. Stable leader election in population protocols requires linear time. In Proceedings of the 29th International Symposium on Distributed Computing. DISC 2015, 602--616.
[34]
R. Elsässer and T. Radzik. 2018. Recent results in population protocols for exact majority and leader election. EATCS Bull. 126 (2018).
[35]
P. Flocchini, E. Kranakis, D. Krizanc, F. L. Luccio, and N. Santoro. 2004. Sorting and election in anonymous asynchronous rings. J. Parallel Distrib. Comput. 64 (2004), 254--265.
[36]
G. N. Fredrickson and N. A. Lynch. 1987. Electing a leader in a synchronous ring. J. ACM 34 (1987), 98--115.
[37]
E. Fusco and A. Pelc. 2012. Knowledge, level of symmetry, and time of leader election. In Proceedings of the 20th Annual European Symposium on Algorithms (ESA’12). 479--490.
[38]
E. Fusco and A. Pelc. 2011. Trade-offs between the size of advice and broadcasting time in trees. Algorithmica 60 (2011), 719--734.
[39]
L. Gąsieniec, D. D. Hamilton, R. Martin, and P. G. Spirakis. 2015. The match-maker: Constant space distributed majority via random walks. In Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems. SSS 2015, 67--80.
[40]
L. Gąsieniec, D. Hamilton, R. Martin1, P. G. Spirakis, and G. Stachowiak. 2016. Deterministic population protocols for exact majority and plurality. In Proceedings of the International Conference on Principles of Distributed Systems (OPODIS’16). 14:1--14:14.
[41]
L. Gąsieniec, G. Stachowiak, and Przemysław Uznański. [n.d.]. Almost logarithmic-time space optimal leader election in population protocols. Retrieved from https:\\arXiv:1802.06867.
[42]
M. Ghaffari and M. Parter. 2016. A polylogarithmic gossip algorithm for plurality consensus. In Proceedings of the 34th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC’16). 117--126.
[43]
Ch. Glacet, A. Miller, and A. Pelc. 2016. Time vs. information tradeoffs for leader election in anonymous trees. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’16). 600--609
[44]
M. A. Haddar, A. H. Kacem, Y. Métivier, M. Mosbah, and M. Jmaiel. 2008. Electing a leader in the local computation model using mobile agents. In Proceedings of the 6th ACS/IEEE International Conference on Computer Systems and Applications (AICCSA’08). 473--480.
[45]
T. Herman. 2000. Phase clocks for transient fault repairs. IEEE Trans. Parallel Distrib. Syst. 11, 10 (2000), 1048--1057.
[46]
D. S. Hirschberg and J. B. Sinclair. 1980. Decentralized extrema-finding in circular configurations of processes. Commun. ACM 23 (1980), 627--628.
[47]
G. Le Lann. 1977. Distributed systems—Towards a formal approach. In Proceedings of the IFIP Congress. 155--160.
[48]
Y. Mocquard, E. Anceaume, J. Aspnes, Y. Busnel, and B. Sericola. 2015. Counting with population protocols. Proceedings of the IEEE 14th International Symposium on Network Computing and Applications (NCA’15). 35--42.
[49]
G. B. Mertzios, S. E. Nikoletseas, C. Raptopoulos, and P. G. Spirakis. 2014. Determining majority in networks with local interactions and very small local memory. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP’14). 871--882.
[50]
O. Michail and P. G. Spirakis. 2014. Simple and efficient local codes for distributed stable network construction. In Proceedings of the 32nd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC’14). 76--85.
[51]
G. L. Peterson. 1982. An O(nlogn) unidirectional distributed algorithm for the circular extrema problem. ACM Trans. Program. Lang. Syst. 4 (1982), 758--762.
[52]
M. Yamashita and T. Kameda. 1989. Electing a leader when procesor identity numbers are not distinct. In Proceedings of the 3rd Workshop on Distributed Algorithms (WDAG’89). 303--314.
[53]
M. Yamashita and T. Kameda. 1996. Computing on anonymous networks: Part I—Characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7 (1996), 69--89.

Cited By

View all
  • (2025)Efficient Assignment of Identities in Anonymous PopulationsInformation and Computation10.1016/j.ic.2025.105265(105265)Online publication date: Jan-2025
  • (2024)Dynamic Size Counting in the Population Protocol ModelProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662825(50-60)Online publication date: 17-Jun-2024
  • (2024)Selective Population ProtocolsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-74498-3_16(225-239)Online publication date: 20-Oct-2024
  • Show More Cited By

Index Terms

  1. Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image Journal of the ACM
      Journal of the ACM  Volume 68, Issue 1
      February 2021
      215 pages
      ISSN:0004-5411
      EISSN:1557-735X
      DOI:10.1145/3437069
      Issue’s Table of Contents
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 17 November 2020
      Accepted: 01 September 2020
      Revised: 01 September 2020
      Received: 01 December 2018
      Published in JACM Volume 68, Issue 1

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. Population protocols
      2. distributed algorithm
      3. leader election
      4. randomised algorithm

      Qualifiers

      • Research-article
      • Research
      • Refereed

      Funding Sources

      • Polish National Science Centre

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)32
      • Downloads (Last 6 weeks)1
      Reflects downloads up to 16 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2025)Efficient Assignment of Identities in Anonymous PopulationsInformation and Computation10.1016/j.ic.2025.105265(105265)Online publication date: Jan-2025
      • (2024)Dynamic Size Counting in the Population Protocol ModelProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662825(50-60)Online publication date: 17-Jun-2024
      • (2024)Selective Population ProtocolsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-74498-3_16(225-239)Online publication date: 20-Oct-2024
      • (2023)On parallel time in population protocolsInformation Processing Letters10.1016/j.ipl.2022.106314179(106314)Online publication date: Jan-2023
      • (2023)Lower bounds on the state complexity of population protocolsDistributed Computing10.1007/s00446-023-00450-436:3(209-218)Online publication date: 1-Sep-2023
      • (2022)Population Protocols for Exact Plurality ConsensusProceedings of the 2022 ACM Symposium on Principles of Distributed Computing10.1145/3519270.3538447(224-234)Online publication date: 20-Jul-2022
      • (2022)Near-Optimal Leader Election in Population Protocols on GraphsProceedings of the 2022 ACM Symposium on Principles of Distributed Computing10.1145/3519270.3538435(246-256)Online publication date: 20-Jul-2022
      • (2021)Population Protocols: Beyond Runtime AnalysisReachability Problems10.1007/978-3-030-89716-1_3(28-51)Online publication date: 22-Oct-2021
      • (undefined)Efficient Assignment of Identities in Anonymous PopulationsSSRN Electronic Journal10.2139/ssrn.4066999

      View Options

      Login options

      Full Access

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format.

      HTML Format

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media