On the use of registers in achieving wait-free consensus

Distributed Computing

Volumn 10, Issue 3, 1997, Pages 117-127

  Bazzi, Rida A ^a   Neiger, Gil ^b   Peterson, Gary L ^c  

^a Arizona State University   (United States)

^b INTEL CORPORATION   (United States)

^c SPELMAN COLLEGE   (United States)

Author keywords

Consensus; Registers; Robustness; Wait free computation; Wait free hierarchies

Indexed keywords

COMPUTATION THEORY; DATA STRUCTURES; HIERARCHICAL SYSTEMS;

READ/WRITE REGISTERS; WAIT FREE CONSENSUS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0031122722     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050029     Document Type: Article

References (27)

1. Afek Y, Greenberg DS, Merritt M, Taubenfeld G: Computing with faulty shared memory. ACM 42(6): 1231-1274 (1995)
2. Afek Y, Weisberger E, Weisman H: A completeness theorem for a class of synchronization objects. In: Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, pp 159-170. ACM Press, August 1993
3. Borowsky E, Gafni E, Afek Y: Consensus power makes (some) sense! In: Proceedings of the 13th ACM Symposium on Principles of Distributed Computing, pp 363-372. ACM Press, August 1994
4. Burns JE, Peterson GL: Constructing multi-reader atomic values from non-atomic values. In: Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, pp 222-231. ACM Press, August 1987
5. Chandra T, Hadzilacos V, Jayanti P, Toueg S: Wait-freedom versus t-resiliency and the robustness of wait-free hierarchies. In: Proceedings of the 13th ACM Symposium on Principles of Distributed Computing, pp 334-343. ACM Press, August 1994
6. Chor B, Israeli A, Li M: Wait-free consensus using asynchronous hardware. SIAM J Comput 23(4): 701-712 (1994)
7. Cori R, Moran S: Exotic behaviour of consensus numbers. In: Tel G, Vitányi P (eds) Proceedings of the 8th International Workshop on Distributed Algorithms, Lect Notes Comput Sci, vol 857, pp 101-115. Springer, Berlin Heidelberg New York 1994
8. Dolev D, Dwork C, Stockmeyer L: On the minimal synchronism needed for distributed consensus. J ACM 34(1): 77-97 (1987)
9. Even S: Graph algorithms. Computer Science Press, 1979
10. Fischer MJ, Lynch NA, Paterson MS: Impossibility of distributed consensus with one faulty process. J ACM 32(2): 374-382 (1985)
11. Herlihy M: Wait-free synchronization. ACM Trans Program Lang Syst 13(1): 124-149 (1991)
12. Herlihy MP, Wing JM: Linearizability: a correctness condition for concurrent objects. ACM Trans Program Lang Syst 12(3): 463-492 (1990)
13. Hopcroft JE, Ullman JD: Introduction to automata theory, languages, and computation. Addison-Wcsley, 1979
14. Jayanti P: On the robustness of Herlihy's hierarchy. In: Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, pp 145-158. ACM Press, August 1993
15. Jayanti P, Chandra TD, Toueg S: Fault-tolerant wait-free shared objects. In: Proceedings of the 33rd Symposium on Foundations of Computer Science, pp 157-166. IEEE, Computer Society Press, October 1992 (A revised and expanded version exists [16])
16. Jayanti P, Chandra TD, Toueg S: Fault-tolerant wait-free shared objects. Technical Report 96-1565, Department of Computer Science, Cornell University, January 1996
17. Jayanti P, Toueg S: Some results on the impossibility, universality, and decidability of consensus. In: Segall A, Zaks S (eds) Proceedings of the 6th International Workshop on Distributed Algorithms. Lect Notes Comput Sci, vol 647, pp 69 84. Springer, Berlin Heidelberg New York 1992
18. Kleinberg J, Mullainathan S: Resource bounds and combinations of consensus objects. In: Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, pp 133-144. ACM Press, August 1993
19. Lamport L: On interprocess communication. Part II: Algorithms. Distrib Comput 1(2): 86-101 (1986)
20. Loui MC, Abu-Amara HH: Memory requirements for agreement among unreliable asynchronous processors. In: Preparata FP (ed) Advances in Computing Research, vol 4, pp 163-183. JAI Press, 1987
21. r. To appear in: Babaoglu Ö. Marzullo K (eds) Proceedings of the 10th International Workshop on Distributed Algorithms. Lect Notes Comput Sci. Springer. Berlin Heidelberg New York 1996
22. Newman-Wolfe R: A protocol for wait-free, atomic, multi-reader shared variables. In: Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, pp 232-248. ACM Press, August 1987
23. Peterson GL.: Concurrent reading while writing. ACM Trans Program Lang Syst 5(1): 46-55 (1983)
24. Peterson GL, Bazzi RA, Neiger G: A gap theorem for consensus types. In: Proceedings of the 13th ACM Symposium on Principles of Distributed Computing, pp 344-353. ACM Press, August 1994.
25. Peterson GL, Burns JE: Concurrent reading while writing II: the multi-writer case. In: Proceedings of the 28th Symposium on Foundations of Computer Science, pp 383-392. IEEE Computer Society Press, October 1987
26. Plotkin S: Sticky bits and the universality of consensus. In: Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, pp 159-175. ACM Press, August 1989
27. Singh AK, Anderson JH, Gouda MG: The elusive atomic register. J ACM 41(2): 311-339 (1994)