From a static impossibility to an adaptive lower bound: The complexity of early deciding set agreement

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 714-722

  Gafni, Eli ^a   Guerraoui, Rachid ^b   Pochon, Bastian ^b  

^a University of California   (United States)

^b EPFL   (Switzerland)

Author keywords

Early decision; Reduction; Set agreement; Simulation

Indexed keywords

DISTRIBUTED ALGORITHMS; EARLY DECISION; SET AGREEMENT; TOPOLOGICAL REASONING;

ALGORITHMS; COMPUTER SIMULATION; REDUCTION; SET THEORY; TOPOLOGY;

COMPUTATIONAL COMPLEXITY;

EID: 34848893338     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060696     Document Type: Conference Paper

References (18)

1. th ACM Symposium on Principles of Distributed Computing, pages 1-14, 1990.
2. th ACM Symposium on Principles of Distributed Computing, pages 71-80, 2000.
3. th ACM Symposium on the Theory of Computing, pages 91-100. ACM Press, 1993.
4. E. Borowsky, E. Gafni, N. Lynch, and S. Rajsbaum. The BG distributed simulation algorithm. Distributed Computing, 14:127-146, 2001,
5. B. Charron-Bost and A. Schiper. Uniform consensus harder than consensus. Journal of Algorithms, 51(1):15-37, 2004.
6. S. Chaudhuri. More choices allow more faults: set consensus problems In totally asynchronous systems. Information and Computation, 105(1):132-158, July 1993.
7. S. Chaudhuri, M. Herlihy, N. A. Lynch, and M. R. Tuttle. Tight bounds for fc-set agreement. Journal of the ACM, 47(5):912-943, 2000.
8. rd ACM Symposium on the Theory of Computing, pages 151-158, 1971.
9. D. Dolev, R. Reischuk, and H.R. Strong. Early stopping in Byzantine agreement. Journal of the ACM, 37(4):720-741, 1990.
10. M. J. Fischer and N. A. Lynch. A lower bound for the time to assure interactive consistency. Information Processing Letters, 14(4):183-186, June 1982.
11. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, 1985.
12. th ACM Symposium on Principles of Distributed Computing, 1998.
13. M. Herlihy, S. Rajsbaum, and M. Tuttle. Unifying synchronous and asynchronous message-passing models. In Proceedings of the 17 ACM Symposium on Principles of Distributed Computing, pages 133-142, 1998.
14. M. Herlihy and N. Shavit. The topological structure of asynchronous computability. Journal of the ACM, 46(6):858-923, 1999.
15. I. Keidar and S. Rajsbaurn. On the cost of fault-tolerant consensus when there are no faults - a tutorial. Technical Report MIT-LCS-TR-821, 2001.
16. (Preliminary version in SIGACT News, Distributed Computing Column, 32(2):45-63, 2001).
17. N. A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.
18. th ACM Symposium on the Theory of Computing, pages 101-110, 1993.