Stabilizing consensus with the power of two choices

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2011, Pages 149-158

  Doerr, Benjamin ^a   Goldberg, Leslie Ann ^b   Minder, Lorenz ^c   Sauerwald, Thomas ^a   Scheideler, Christian ^d  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d UNIVERSITY OF PADERBORN   (Germany)

Author keywords

distributed consensus; randomized algorithms; self stabilization

Indexed keywords

CONSENSUS PROBLEMS; DISTRIBUTED ALGORITHM; DISTRIBUTED CONSENSUS; HIGH PROBABILITY; INPUT VALUES; POWER-OF-TWO; RANDOMIZED ALGORITHMS; SELF-STABILIZATION; SLIGHT VARIANT;

ALGORITHMS;

EID: 79959660547     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989493.1989516     Document Type: Conference Paper

References (35)

1. D. Angluin, J. Aspnes, and D. Eisenstat. A simple population protocol for fast robust approximate majority. In Proc. of the 21st Int. Symposium on Distributed Computing (DISC), pages 20-32, 2007.
2. D. Angluin, M. Fischer, and H. Jiang. Stabilizing consensus in mobile networks. In Proc. of the Intl. Conference on Distributed Computing in Sensor Networks (DCOSS), pages 37-50, 2006.
3. J. Aspnes. Randomized protocols for aynchronous consensus. Distributed Computing, 16(2-3):165-176, 2003.
4. J. Aspnes, H. Attiya, and K. Censor. Randomized consensus in expected o(n log n) individual work. In Proc. of the 27th ACM Symp. on Principles of Distributed Computing (PODC), pages 325-333, 2008.
5. J. Aspnes and K. Censor. Approximate shared-memory counting despite a strong adversary. In Proc. of the 20th ACM Symp. on Discrete Algorithms (SODA), pages 441-450, 2009.
6. H. Attiya and K. Censor. Lower bounds for randomized consensus under a weak adversary. In Proc. of the 27th ACM Symp. on Principles of Distributed Computing (PODC), pages 315-324, 2008.
7. H. Attiya and K. Censor. Tight bounds for asynchronous randomized consensus. Journal of the ACM, 55(5):1-26, 2008.
8. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations, and Advanced Topics (2nd Edition). John Wiley and Sons, 2004.
9. Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced allocations. SIAM Journal on Computing, 29(1):180-200, 1999. (Pubitemid 30588356) (Pubitemid 30588356)
10. Z. Bar Joseph and M. Ben-Or. A tight lower bound for randomized synchronous consensus. In Proc. of the 17th ACM Symp. on Principles of Distributed Computing (PODC), pages 193-199, 1998.
11. M. Ben-Or, E. Pavlov, and V. Vaikuntanathan. Byzantine agreement in the full-information model in O(log n) rounds. In Proc. of the 38th ACM Symp. on Theory of Computing (STOC), pages 179-186, 2006.
12. R. Canetti and T. Rabin. Fast asynchronous Byzantine agreement with optimal resilience. In Proc. of the 25th ACM Symp. on Theory of Computing (STOC), pages 42-51, 1993.
13. R. Cole, A. Frieze, B.M. Maggs, M. Mitzenmacher, A.W. Richa, R.K. Sitaraman, and E. Upfal. On balls and bins with deletions. In Proc. of the 2nd Intl. Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), 1998.
14. R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa, K. Schröder, R.K. Sitaraman, and B. Vöcking. Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In Proc. of the 29th ACM Symp. on Theory of Computing (STOC), pages 378-388, 1998.
15. M. Dietzfelbinger and F. Meyer auf der Heide. Simple, efficient shared memory simulations. In Proc. of the 10th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 110-119, 1993.
16. D. Dolev, N. Lynch, S. Pinter, E. Stark, and W. Weihl. Reaching approximate agreement in the presence of faults. Journal of the ACM, 33(3):499-516, 1986.
17. S. Dolev, R. Kat, and E. Schiller. When consensus meets self-stabilization. In Proc. of the 10th International Conference on Principle of Distributed Systems (OPODIS), pages 45-63, 2006.
18. R. Elsässer and T. Sauerwald. The power of memory in randomized broadcasting. In Proc. of the 19th ACM Symp. on Discrete Algorithms (SODA), pages 773-781, 2008.
19. P. Feldman and S. Micali. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM Journal on Computing, 26(4):873-933, 1997. (Pubitemid 127599130) (Pubitemid 127599130)
20. M. Fischer, N. Lynch, and M. Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1(1):26-39, 1986.
21. M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, 1985.
22. S. Gilbert and D. Kowalski. Distributed agreement with optimal communication complexity. In Proc. of the 21st ACM Symp. on Discrete Algorithms (SODA), pages 965-977, 2010.
23. K. Ito and H.P. McKean. Diffusion Processes and their Sample Paths. Springer Verlag, Heidelberg, 1974.
24. N.L. Johnson and S. Kotz. Encyclopedia of Statistical Sciences. John Wiley, New York, 1982.
25. B. Kapron, D. Kempe, V. King, J. Saia, and V. Sanwalani. Fast asynchronous Byzantine agreement and leader election with full information. In Proc. of the 19th ACM Symp. on Discrete Algorithms (SODA), pages 1038-1047, 2008.
26. R. Karp, M. Luby, and F. Meyer auf der Heide. Efficient PRAM simulation on a distributed memory machine. In Proc. of the 24th ACM Symp. on Theory of Computing (STOC), pages 318-326, 1992.
27. J. Katz and C.-Y. Koo. On expected constant-round protocols for Byzantine agreement. Journal of Computer and System Sciences, 75(2):91-112, 2009.
28. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. of the 44 IEEE Symp. on Foundations of Computer Science (FOCS), pages 482-491, 2003.
29. 2) bit barrier: Scalable Byzantine agreement with an adaptive adversary. In Proc. of the 29th ACM Symp. on Principles of Distributed Computing (PODC), pages 420-429, 2010.
30. V. King, J. Saia, V. Sanwalani, and E. Vee. Towards secure and scalable computation in peer-to-peer networks. In Proc. of the 47th IEEE Symp. on Foundations of Computer Science (FOCS), pages 87-98, 2006.
31. F. Kuhn, T. Locher, and R. Wattenhofer. Tight bounds for distributed selection. In Proc. of the 19th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 145-153, 2007.
32. N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
33. B. Patt-Shamir. A note on efficient aggregate queries in sensor networks. Theoretical Computer Science, 370(1-3):254-264, 2007. (Pubitemid 46107755) (Pubitemid 46107755)
34. M. Rabin. Randomized Byzantine generals. In Proc. of the 24th IEEE Symp. on Foundations of Computer Science (FOCS), pages 403-409, 1983.
35. N. Shrivastava, C. Buragohain, D. Agrawal, and S. Suri. Medians and beyond: new aggregation techniques for sensor networks. In Proc. of the 2nd Intl. Conference on Embedded Networked Sensor Systems (SenSys), pages 239-249, 2004.