Determining consensus numbers

SIAM Journal on Computing

Volumn 30, Issue 4, 2000, Pages 1156-1168

  Ruppert, Eric ^a  

^a Brown Univerity   (United States)

Author keywords

Asynchronous; Consensus; Consensus hierarchy; Distributed computing; Read modify write; Readable; Robust; Shared memory; Wait free

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; PROBLEM SOLVING; THEOREM PROVING;

ASYNCHRONOUS SYSTEMS; CONSENSUS HIERARCHY; READ MODIFY WRITE OBJECTS; READABLE OBJECTS; SHARED MEMORY SYSTEMS; WAIT FREE MODEL;

FAILURE ANALYSIS;

EID: 0034848819     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797329439     Document Type: Article

References (24)

1. Y. AFEK, H. ATTIYA, D. DOLEV, E. GAFNI, M. MERRITT, AND N. SHAVIT, Atomic snapshots of shared memory, J. ACM, 40 (1993), pp. 873-890.
2. J. H. ANDERSON, Composite registers, Distributed Computing, 6 (1993), pp. 141-154.
3. J. ASPNES AND M. HERLIHY, Wait-free data structures in the asynchronous PRAM model, in Proceedings of the 2nd ACM Symposium on Parallel Algorithms and Architectures, Crete, Greece, 1990, pp. 340-349.
4. O. BIRAN, S. MORAN, AND S. ZAKS, A combinatorial characterization of the distributed 1-solvable tasks, J. Algorithms, 11 (1990), pp. 420-440.
5. 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.
6. T. CHANDRA, V. HADZILACOS, P. JAYANTI, AND S. TOUEG, Wait-freedom vs. 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.
7. B. CHOR AND L. MOSCOVICI, Solvability in asynchronous environments, in Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1989, pp. 422-433.
8. 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.
9. E. GAFNI AND E. KOUTSOUPIAS, Three-processor tasks are undecidable, SIAM J. Comput., 28 (1999), pp. 970-983.
10. M. HERLIHY, Wait-free synchronization, ACM Trans. Prog. Lang. Syst., 11 (1991), pp. 124-149.
11. M. HERLIHY AND S. RAJSBAUM, The decidability of distributed decision tasks, in Proceedings of the 29th ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 589-598.
12. M. P. HERLIHY AND J. M. WING, Linearizability: A correctness condition for concurrent objects, ACM Trans. Prog. Lang. Syst., 12 (1990), pp. 463-492.
13. P. JAYANTI, Wait-free computing, in Distributed Algorithms, Lecture Notes in Comput. Sci. 972, Springer-Verlag, Berlin 1995, pp. 19-50.
14. P. JAYANTI, Robust wait-free hierarchies, J. ACM, 44 (1997), pp. 592-614.
15. P. JAYANTI AND S. TOUEG, Some results on the impossibility, universality and decidability of consensus, in Distributed Algorithms, Lecture Notes in Comput. Sci. 647, Springer-Verlag, Berlin, 1992, pp. 69-84.
16. C. P. KRUSKAL, L. RUDOLPH, AND M. SNIR, Efficient synchronization on multiprocessors with shared memory, ACM Trans. Prog. Lang. Syst., 10 (1988), pp. 579-601.
17. W.-K. LO AND V. HADZILACOS, All of us are smarter than any of us: Wait-free hierarchies are not robust, in Proceedings of the 29th ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 579-588.
18. N. A. LYNCH, Distributed Algorithms, Morgan Kaufmann, San Francisco, CA, 1996, chapter 8.
19. r, in Distributed Algorithms, Lecture Notes in Comput. Sci. 1151, Springer-Verlag, Berlin, 1996, pp. 344-361.
20. S. PLOTKIN, Sticky bits and universality of consensus, in Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, Edmonton, AB, Canada, 1989, pp. 159-175.
21. E. RUPPERT, Consensus numbers of multi-objects, in Proceedings of the 17th ACM Symposium on Principles of Distributed Computing, Puerto Vallarta, Mexico, 1998, pp. 211-217.
22. E. RUPPERT, Consensus numbers of transactional objects, in Distributed Computing, Lecture Notes in Comput. Sci. 1693, Springer-Verlag, Berlin, 1999, pp. 312-326.
23. E. RUPPERT, The Consensus Power of Shared-Memory Distributed Systems, Ph.D. thesis, Department of Computer Science, University of Toronto, Canada, 2000. Available from www.cs.yorku.ca/∼ruppert.
24. E. SCHENK, The consensus hierarchy is not robust, in Proceedings of the 16th ACM Symposium on Principles of Distributed Computing, Santa Barbara, CA, 1997, p. 279.