Tight bounds for k-Set agreement

Journal of the ACM

Volumn 47, Issue 5, 2000, Pages 912-943

  Chaudhuri, Soma ^a,b,c,d,e,f   Herlihy, Maurice ^a   Lynch, Nancy A ^a   Tuttle, Mark R ^a  

^a IOWA STATE UNIVERSITY   (United States)

^b BROWN UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d HEWLETT PACKARD COMPANY   (United States)

^e Iowa State University   (United States)

^f MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

A>set agreement; Crash failure model; Message passing systems; Sperner's lemma; Synchronous systems; Topology

Indexed keywords

CRASH FAILURE MODELS; K-SET AGREEMENTS; MESSAGE-PASSING SYSTEMS; SPERNER'S LEMMA; SYNCHRONUS SYSTEMS;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; PROGRAM PROCESSORS; SOFTWARE ENGINEERING; TOPOLOGY;

COMPUTATIONAL GEOMETRY;

EID: 0010366268     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/355483.355489     Document Type: Article

References (25)

1. ATTIYA, H., AND RAJSBAUM, S. 1996. The combinatorial structure of wait-free solvable tasks. In Proceedings of the 10th International Workshop on Distributed Algorithms. Lecture Notes in Computer Science, vol. 1151. Springer-Verlag, New York, pp. 322-343.
2. BERNSTEIN, P. A., HADZILACOS, V., AND GOODMAN, N. 1987. Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, Mass.
3. BOROWSKY, E., AND GARNI, E. 1993. Generalized FLP impossibility result for /-resilient asynchronous computations. In Proceedings of the 25th ACM Symposium on Theory of Computing, (San Diego, Calif., May 16-18). ACM, New York, pp. 91-100.
4. CHAUDHURI, S. 1991. Towards a complexity hierarchy of wait-free concurrent objects. In Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing (Dec.). IEEE Computer Society Press, Los Alamitos, Calif.
5. CHAUDHURI, S. 1993. More choices allow more faults: Set consensus problems in totally asynchronous systems. Inf. Comput. 105, 1 (July) 132-158.
6. CHAUDHURI, S., HERLIHY, M., LYNCH, N., AND TUTTLE, M. R. 1993. A tight lower bound for fc-set agreement. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science (Nov.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 206-215.
7. DOLEV, D. 1982. The Byzantine generals strike again. J. Algorithms 3, 1 (Mar.). 14-30.
8. DOLEV, D., AND STRONG, H. R. 1983. Authenticated algorithms for Byzantine agreement. SLAM J. Comput. 12, 3 (Nov.), 656-666.
9. DWORK, C., AND MOSES, Y. 1990. Knowledge and common knowledge in a Byzantine environment: Crash failures. Inf. Comput. 88, 2 (Oct.), 156-186.
10. FISCHER, M. J. 1983. The consensus problem in unreliable distributed systems (a brief survey). In Proceedings of the 10th International Colloquium on Automata, Languages, and Programming, Marek Karpinsky, Ed. Springer-Verlag, New York, pp. 127-140.
11. FISCHER, M. J., AND LYNCH, N. A. 1982. A lower bound for the time to assure interactive consistency. Inf. Proc. Lett. 14, 4 (June), 183-186.
12. FISCHER, M. J., LYNCH, N. A., AND PATERSON, M. S. 1985. Impossibility of distributed consensus with one faulty processor. J. ACM 32, 2 (Apr.), 374-382.
13. GAFNI, E., AND KOUTSOUPIAS, E. 1999. Three-processor tasks are undecidable. SIAM J. Comput. 28, 3, 970-983.
14. HADZILACOS, V. 1983. A lower bound for Byzantine agreement with fail-stop processors. Tech. Rep. TR-21-83. Harvard Univ.
15. HERLIHY, M. P. 1991. Wait-free synchronization. ACM Trans. Prag. Lang. Syst. 13, 1 (Jan.), 124-149.
16. HERLIHY, M., AND RAJSBAUM, S. 1994. Set consensus using arbitrary objects. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (Los Angeles, Calif., Aug. 14-17). ACM, New York, pp. 324-333.
17. HERLIHY, M., AND RAJSBAUM, S. 2000. Algebraic spans. Math. Struct. Comput. Sei. 10, 4 (Aug.), 549-573.
18. HERLIHY, M. P., AND SHAVIT, N. 1999. The topological structure of asynchronous computability. J. ACM 46, 6 (Nov.), 858-923.
19. LAMPORT, L., SHOSTAK, R., AND PEASE, M. 1982. The Byzantine generals problem. ACM Trans. Prog. Lang. Syst. 4, 3, (July), 382-401.
20. MERRITT, M. 1985. Notes on the Dolev-Strong lower bound for byzantine agreement. Unpublished manuscript.
21. MOSES, Y., AND TUTTLE, M. R. 1988. Programming simultaneous actions using common knowledge. Algorithmica 3, 1, 121-169.
22. PEASE, M., SHOSTAK, R., AND LAMPORT, L. 1980. Reaching agreement in the presence of faults. J. ACM 27, 2, 228-234.
23. SAKS, M., AND ZAHAROGLOU, F. 2000. Wait-free fc-set agreement is impossible: The topology of public knowledge. SIAM J. Comput. 29, 5, 1449-1483.
24. SPANIER, E. H. 1966. Algebraic Topology. Springer-Verlag, New York.
25. WENSLEY, J. H., GOLDBERG, J., GREEN, M. W., LEVITT, K. N., MELLIAR-SMITH, P. M., SHOSTAK, R. E., AND WEINSTOCK, C. B. 1978. SIFT: Design and analysis of a fault-tolerant computer for aircraft control. Proc. IEEE 66, 10, (Oct.), 1240-1255.