All of us are smarter than any of us: Nondeterministic wait-free hierarchies are not robust

SIAM Journal on Computing

Volumn 30, Issue 3, 2000, Pages 689-728

  Lo, Wai Kau ^a   Hadzilacos, Vassos ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Consensus number; Robustness; Wait free

Indexed keywords

ALGORITHMS; CONCURRENT ENGINEERING; DISTRIBUTED COMPUTER SYSTEMS;

WAIT-FREE HIERARCHIES;

HIERARCHICAL SYSTEMS;

EID: 0034934544     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798335766     Document Type: Article

References (20)

1. E. BOROWSKY, E. GAFNI, AND Y. AFEK, Consensus power makes (some) sense!, in Proceedings of the 13th ACM Symposium on Principles of Distributed Computing, Los Angeles, CA, 1994, pp. 363-372.
2. T. CHANDRA, V. HADZILACOS, P. JAYANTI, AND S. TOUEG, Wait-freedom versus t-resiliency and the robustness of wait-free hierarchies, in Proceedings of the 13th ACM Symposium on Principles of Distributed Computing, Los Angeles, CA, 1994, pp. 334-343.
3. B. CHOR, A. ISRAELI, AND M. LI, On processor coordination using asynchronous hardware, in Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, 1987, pp. 86-97.
4. E. DIJKSTRA, Solution of a problem in concurrent programming control, Comm. ACM, 8 (1965), p. 569.
5. M. J. FISCHER, N. A. LYNCH, AND M. S. PATERSON, Impossibility of distributed consensus with one faulty process, J. ACM, 32 (1985), pp. 374-382.
6. M. HERLIHY. Wait-free synchronization, ACM Transactions on Programming Languages and Systems, 11 (1991), pp. 124-149.
7. M. P. HERLIHY AND J. M. WING, Linearizability: A correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, 12 (1990), pp. 463-492.
8. P. JAYANTI, On the robustness of Herlihy's hierarchy, in Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, Ithaca, NY, 1993, pp. 145-158.
9. P. JAYANTI AND S. TOUEG, Some results on the impossibility, universality, and decidability of consensus, in Proceedings of the 6th International Workshop on Distributed Algorithms, Haifa, Israel, Springer-Verlag, Berlin, 1992, pp. 69-84.
10. J. KLEINBERG AND S. MULLAINATHAN, Resource bounds and combinations of consensus objects, in Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, Ithaca, NY, 1993, pp. 133-144.
11. B. LISKOV AND J. GUTTAG, Abstraction and Specification in Program Development, MIT Press, Cambridge, MA, 1986.
12. W.-K. LO, More on t-resilence vs. wait-freedom, in Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada, 1995, pp. 110-119.
13. M. LOUI AND H. ABU-AMARA, Memory requirements for agreement among unreliable asynchronous processes, in Advances in Computer Research 4, JAI Press, Greenwich, CT, 1987, pp. 163-183.
14. r, in Proceedings of the 10th International Workshop on Distributed Algorithms, Bologna, Italy, Springer-Verlag, Berlin, 1996.
15. G. PETERSON, R. BAZZI, AND G. NEIGER, A gap theorem for consensus types, in Proceedings of the 13th ACM Symposium on Principles of Distributed Computing, Los Angeles, CA, 1994, pp. 344-353.
16. S. PLOTKIN, Sticky bits and the universality of consensus, in Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, Canada, 1989, pp. 159-175.
17. O. RACHMAN, Anomalies in the wait-free hierarchy, in Proceedings of the 8th International Workshop on Distributed Algorithms, Terschelling, The Netherlands, Springer-Verlag, Berlin, 1994, pp. 156-163.
18. E. RUPPERT, Determining Consensus Numbers, Technical Report 303/96, Department of Computer Science, University of Toronto, Canada, 1996.
19. E. SCHENK, Computability and Complexity Results for Agreement Problems in Shared Memory Distributed Systems, Ph.D. thesis, University of Toronto, Canada, 1996.
20. E. SCHENK, The consensus hierarchy is not robust (brief announcement), in Proceedings of the 16th ACM Symposium on Principles of Distributed Computing, Santa Barbara, CA, 1997, p. 279.