Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Fast computation by population protocols with a leader

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model, in which finite-state agents interact in pairs under the control of an adversary scheduler, where all pairs are equally likely to be chosen for each interaction. It is shown that when a unique leader agent is provided in the initial population, the population can simulate a virtual register machine with high probability in which standard arithmetic operations like comparison, addition, subtraction, and multiplication and division by constants can be simulated in O(n log5 n) interactions using a simple register representation or in O(n log2 n) interactions using a more sophisticated representation that requires an extra O(n logO(1) n)-interaction initialization step. The central method is the extensive use of epidemics to propagate information from and to the leader, combined with an epidemic-based phase clock used to detect when these epidemics are likely to be complete. Applications include a reduction of the cost of computing a semilinear predicate to O(n log5 n) interactions from the previously best-known bound of O(n 2 log n) interactions and simulation of a LOGSPACE Turing machine using O(n log2 n) interactions per step after an initial O(n logO(1) n)-interaction startup phase. These bounds on interactions translate into polylogarithmic time per step in a natural parallel model in which each agent participates in an expected Θ(1) interactions per time unit. Open problems are discussed, together with simulation results that suggest the possibility of removing the initial-leader assumption.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Prasanna, V.K., Iyengar, S., Spirakis, P., Welsh, M. (eds.) Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June/July, 2005, Proceedings, vol. 3560 of Lecture Notes in Computer Science, pp. 63–74. Springer-Verlag, June 2005

  2. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn automata. Technical Report YALEU/DCS/TR-1280, Yale University Department of Computer Science, November (2003)

  3. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC ’04: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pp. 290–299. ACM Press (2004)

  4. Angluin D., Aspnes J., Diamadi Z., Fischer M.J., Peralta R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235–253 (2006)

    Article  Google Scholar 

  5. Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. In: Distributed Computing: 20th International Symposium, DISC 2006: Stockholm, Sweden, September 2006: Proceedings, pp. 61–75 (2006)

  6. Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing, pp. 292–299, July (2006)

  7. Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. In: Pelc, A. (ed.) Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, vol. 4731 of Lecture Notes in Computer Science, pp. 20–32. Springer (2007)

  8. Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distrib. Comput. (2008, submitted)

  9. Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: On the power of anonymous one-way communication. In: Ninth International Conference on Principles of Distributed Systems, pp. 307–318, December 2005

  10. Angluin D., Aspnes J., Eisenstat D., Ruppert E.: The computational power of population protocols. Distrib. Comput. 20(4), 279–304 (2007)

    Article  Google Scholar 

  11. Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: Ninth International Conference on Principles of Distributed Systems, pp. 79–90, December 2005

  12. Angluin, D., Fischer, M.J., Jiang, H.: Stabilizing consensus in mobile networks. In: Proceedings of the Second IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS ’06), pp. 37–50 (2006)

  13. Arora, A., Dolev, S., Gouda, M.G.: Maintaining digital clocks in step. In: Toueg, S., Spirakis, P.G., Kirousis, L.M. (eds.) Distributed Algorithms, 5th International Workshop, vol. 579 of Lecture Notes in Computer Science, pp. 71–79, Delphi, Greece. Springer-Verlag (1991)

  14. Bailey N.T.J.: The Mathematical Theory of Infectious Diseases, 2nd edn. Charles Griffin & Co., London (1975)

    MATH  Google Scholar 

  15. Birman K.P., Hayden M., Ozkasap O., Xiao Z., Budiu M., Minsky Y.: Bimodal multicast. ACM Trans. Comput. Syst. 17(2), 41–88 (1999)

    Article  Google Scholar 

  16. Daley D.J., Kendall D.G.: Stochastic rumours. J. Inst. Math. Appl. 1, 42–55 (1965)

    Article  MathSciNet  Google Scholar 

  17. Daliot, A., Dolev, D., Parnas, H.: Self-stabilizing pulse synchronization inspired by biological pacemaker networks. In: Huang, S.-T., Herman, T. (eds.) Self-Stabilizing Systems, vol. 2704 of Lecture Notes in Computer Science, pp. 32–48. Springer (2003)

  18. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Ruppert, E.: When birds die: Making population protocols fault-tolerant. In: Proceedings of the Second IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS ’06), pp. 51–66 (2006)

  19. Diamadi, Z., Fischer, M.J.: A simple game for the study of trust in distributed systems. Wuhan University J. Nat. Sci. 6(1–2): 72–82, March 2001. Also appears as Yale Technical Report TR–1207, January 2001

  20. Dolev S., Welch J.L.: Self-stabilizing clock synchronization in the presence of Byzantine faults. J. ACM 51(5), 780–799 (2004)

    Article  MathSciNet  Google Scholar 

  21. Gibson M.A., Bruck J.: Efficient exact stochastic simulation of chemical systems with many species and many channels. J. Phys. Chem. A 104, 1876–1880 (2000)

    Article  Google Scholar 

  22. Gillespie D.T.: Exact stochastic simulation of coupled chemical reactions. J. Phys. Chem. 81(25), 2340–2361 (1977)

    Article  Google Scholar 

  23. Gillespie D.T.: A rigorous derivation of the chemical master equation. Phys. A 188, 404–425 (1992)

    Article  Google Scholar 

  24. Guerraoui, R., Ruppert, E.: Even small birds are unique: Population protocols with identifiers. Technical Report CSE-2007-04, Department of Computer Science and Engineering, York University, (2007)

  25. Herman T.: Phase clocks for transient fault repair. IEEE Trans. Parallel Distrib. Syst. 11(10), 1048–1057 (2000)

    Article  Google Scholar 

  26. Kamath A.P., Motwani R., Palem K., Spirakis P.: Tail bounds for occupancy and the satisfiability threshold conjecture. Random Struct. Algorithms 7, 59–80 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  27. Minsky M.L.: Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Inc., Englewood Cliffs, NJ (1967)

    Google Scholar 

  28. Presburger, M.: Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Comptes-Rendus du I Congrès de Mathématiciens des Pays Slaves, pp. 92–101, Warszawa (1929)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yale University, New Haven, CT, USA

    Dana Angluin & James Aspnes

  2. New Haven, CT, USA

    David Eisenstat

Authors
  1. Dana Angluin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. James Aspnes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Eisenstat
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to James Aspnes.

Additional information

An extended abstract of this paper previously appeared in DISC 2006 [6]. Some additional material previously appeared in DISC 2007 [7]. The second author was supported in part by NSF grants CNS-0305258 and CNS-0435201.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Angluin, D., Aspnes, J. & Eisenstat, D. Fast computation by population protocols with a leader. Distrib. Comput. 21, 183–199 (2008). https://doi.org/10.1007/s00446-008-0067-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-008-0067-z

Keywords

Search

Navigation