On k-set consensus problems in asynchronous systems

IEEE Transactions on Parallel and Distributed Systems

Volumn 12, Issue 1, 2001, Pages 7-21

  De Prisco, Roberto ^a,b   Malkhi, Dahlia ^c   Reiter, Michael ^d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF SALERNO   (Italy)

^c AT AND T LABS RESEARCH   (United States)

^d LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DECISION THEORY; FAILURE ANALYSIS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBLEM SOLVING; SET THEORY;

AGREEMENT PROBLEMS; ASYNCHRONOUS DISTRIBUTED SYSTEMS; BYZANTINE FAILURES; CRASH FAILURES; VALIDITY CONDITIONS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0035114958     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.899936     Document Type: Article

References (30)

1. H. Attiya, "A Direct Proof of the Asynchronous Lower Bound for k-Set Consensus," Proc. 17th ACM Symp. Principles of Distributed Computing, pp. 314, July 1998.
2. H. Attiya, A. Bar-Noy, D. Doev, D. Koller, D. Peleg, and R. Reischuk, "Achievable Cases in an Asynchronous Environment," IEEE Symp. Foundations of Computer Science, 1987.
3. H. Attiya, D. Dolev, and J. Gil, "Asynchronous Byzantine Consensus," Proc. Symp. Principles of Distributed Computing, 1984.
4. H. Attiya, A. Bar-Noy, and D. Dolev, "Sharing Memory Robustly in Message-Passing Systems," J. ACM, vol. 42, no. 1, pp. 124-142, Jan. 1995.
5. H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, and R. Reischuk, "Renaming in an Asynchronous Environment," J. ACM, vol. 37, no. 3, pp. 524-548, July 1990.
6. H. Attiya and S. Rajsbaum, "A Combinatorial Framework for Wait-Free Computability," Proc. 10th Int'l Workshop Distributed Algorithms, Oct. 1996.
7. H. Attiya and J. Welch, Distributed Computing. McGraw Hill, 1998.
8. M. Ben-Or, "Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols," Proc. Symp. Principles of Distributed Computing, 1983.
9. E. Borowsky and E. Gafni, "Generalized FLP Impossibility Result for t-Resilient Asynchronous Computations," Proc. 25th ACM Symp. Theory of Computing, pp. 91-100, 1993.
10. G. Bracha, "An o(n log n) Expected Rounds Randomized Byzantine Generals Algorithm," Proc. Fourth ACM Symp. Principles of Distributed Computing (PODC), 1985.
11. G. Bracha and S. Toueg, "Resilient Consensus Protocols," Proc. Second ACM Symp. Principles of Distributed Computing, pp. 12-26, 1983.
12. T.D. Chandra, V. Hadzilacos, and S. Toueg, "The Weakest Failure Detector for Solving Consensus," J. ACM, vol. 43, no. 4, pp. 685-722, July 1996.
13. S. Chaudhuri, "More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems," Information and Computation, vol. 105, no. 1, pp. 132-158, July 1993.
14. R. De Prisco, D. Malkhi, and M. Reiter, "On k-Set Consensus Problems in Asynchronous Systems," Proc. 18th ACM Symp. Principles of Distributed Computing, pp. 257-265, May 1999.
15. D. Dolev, C. Dwork, and L. Stockmeyer, "On the Minimal Syncrhony Needed for Distributed Consensus," J. ACM, vol. 34, no. 1, pp. 77-97, Jan. 1987.
16. C. Dwork, N. Lynch, and L. Stockmeyer, "Consensus in the Presence of Partial Synchrony," J. ACM, vol. 35, no. 2, pp. 288-323, Apr. 1988.
17. M. Fischer, N. Lynch, and M. Paterson, "Impossibility of Distributed Consensus with One Faulty Process," J. ACM, vol. 32, no. 2, pp. 374-382, Apr. 1985.
18. M. Herlihy and S. Rajsbaum, "Algebraic Spans," Proc. 14th ACM Symp. Principles of Distributed Computing, pp. 90-99, 1995.
19. M. Herlihy, S. Rajsbaum, and M. Tuttle, "Unifying Synchronous and Asynchronous Message-Passing Models," Proc. 17th ACM Symp. Principles of Distributed Computing, pp. 233-142, 1998.
20. M. Herlihy and N. Shavit, "The Asynchronous Computability Theorem for t-Resilient Tasks," Proc. 25th ACM Symp. Theory of Computing, pp. 111-120, 1993.
21. L. Lamport, "The Weak Byzantine Generals Problem," J. ACM, vol. 30, no. 3, pp. 254-280, 1983.
22. L. Lamport, "On Interprocess Communication, Part II: Algorithms," Distributed Computing, vol. 1, pp. 86-101, 1986.
23. L. Lamport, R. Shostak, and M. Pease, "The Byzantine Generals Problem," ACM Trans. Programming Languages and Systems, vol. 4, no. 3, pp. 382-401, July 1982.
24. M. Loui and H. Abu-Amara, "Memory Requirements for Agreement among Unreliable Asynchronous Processes," Parallel and Distributed Computing, pp. 163-183. Greenwich, Conn.: JAI Press, 1987.
25. N. Lynch, Distributed Algorithms. San Francisco: Morgan Kaufmann, 1996.
26. N. Lynch and S. Rajsbaum, "On the Borowsky-Gafni Simulation Algorithm," Proc. Fourth Israeli Symp. Theory of Computing and Systems, pp. 4-15, June 1996.
27. G. Neiger, "Distributed Consensus Revisited," Information Processing Letters, vol. 49, no. 4, pp. 195-201, 1994.
28. M. Pease, R. Shostak, and L. Lamport, "Reaching Agreement in the Presence of Faults," J. ACM, vol. 27, no. 2, pp. 228-234, Apr. 1980.
29. M. Rabin, "Randomized Byzantine Generals," Proc. 15th ACM Symp. Theory of Computing (STOC), pp. 403-409, 1983.
30. M. Saks and F. Zaharoglou, "Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge," Proc. 25th ACM Symp. Theory of Computing, pp. 101-110, 1993.