A new synchronous lower bound for set agreement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2180, Issue , 2001, Pages 136-150

  Herlihy, Maurice ^a   Rajsbaum, Sergio ^b   Tuttle, Mark ^b  

^a Brown Univerity   (United States)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CRASH FAILURES; HIGH CONNECTIVITY; ITERATIVE CONSTRUCTION; ITERATIVE FASHION; LOWER BOUNDS; MESSAGE PASSING MODELS; SET-AGREEMENT;

MESSAGE PASSING;

EID: 84956994752     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45414-4_10     Document Type: Conference Paper

References (21)

1. Marcos Kawazoe Aguilera and Sam Toueg. A simple bivalency proof that t-resilient consensus requires t + 1 rounds. Information Processing Letters, 71(3-4):155–158, August 1999.
2. Hagit Attiya and Sergio Rajsbaum. The combinatorial structure of wait-free solvable tasks. In Proceedings of the 10th International Workshop on Distributed Algorithms, volume 1151 of Lecture Notes in Computer Science, pages 322–343. Springer-Verlag, Berlin, October 1996.
3. Hagit Attiya and Jennifer Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw–Hill, 1998.
4. Elizabeth Borowsky and Eli Gafni. Generalized FLP impossibility result for tresilient asynchronous computations. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 91–100, May 1993.
5. Elizabeth Borowsky and Eli Gafni. A simple algorithmically reasoned characterization of wait-free computations. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 189–198, August 1997.
6. Soma Chaudhuri. Agreement is harder than consensus: set consensus problems in totally asynchronous systems. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, pages 311–234, August 1990.
7. Soma Chaudhuri, Maurice Herlihy, Nancy Lynch, and Mark R. Tuttle. Tight bounds for k-set agreement. Journal of the ACM, 47(5):912–943, September 2000.
8. Danny Dolev and Ray Strong. Polynomial algorithms for multiple processor agreement. In Proceedings of the 14th ACM Symposium on Theory of Computing, pages 401–407, 1982.
9. Cynthia Dwork and Yoram Moses. Knowledge and common knowledge in a Byzantine environment: Crash failures. Information and Computation, 88(2):156–186, October 1990.
10. Michael J. Fischer and Nancy A. Lynch. A lower bound for the time to assure interactive consistency. Information Processing Letters, 14(4):183–186, June 1982.
11. Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty processor. Journal of the ACM, 32(2):374–382, April 1985.
12. Eli Gafni. A round-by-round failure detector — unifying synchrony and asynchrony. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing. ACM, June 1998.
13. Maurice Herlihy and Sergio Rajsbaum. Set consensus using arbitrary objects. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 324–333, August 1994.
14. Maurice Herlihy and Sergio Rajsbaum. Algebraic spans. Mathematical Structures in Computer Science, 10(4):549–573, August 2000. Special Issue: Geometry and Concurrency.
15. Maurice Herlihy, Sergio Rajsbaum, and Mark R. Tuttle. Unifying synchronous and asynchronous message-passing models. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 133–142. ACM, June 1998.
16. Maurice Herlihy and Nir Shavit. The topological structure of asynchronous computability. Journal of the ACM, 46(6):858–923, November 1999.
17. Nancy Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
18. Yoram Moses and Sergio Rajsbaum. The unified structure of consensus: a layered analysis approach. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 123–132. ACM, June 1998. To apper in SIAM Journal of Computing.
19. James R. Munkres. Elements Of Algebraic Topology. Addison Wesley, Reading MA, 1984.
20. Marshall Pease, Robert Shostak, and Leslie Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228–234, 1980.
21. Michael Saks and Fotios Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM Journal on Computing, 29(5):1449–1483, 2000.