On the power of shared object types to implement one-resilient consensus

Distributed Computing

Volumn 13, Issue 4, 2000, Pages 219-238

  Lo, Wai Kau ^a   Hadzilacos, Vassos ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; OBJECT ORIENTED PROGRAMMING; THEOREM PROVING;

CONSENSUS; DISTRIBUTED ALGORITHMS; SHARED OBJECTS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0034314503     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008920     Document Type: Article

References (14)

1. E. Borowsky, E. Gafni: Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proceedings of the Twenty-Fifth ACM Symposium on Theory of Computing, pp 91-100. May 1993
2. E. Borowsky, E. Gafni, N.A. Lynch, S. Rajsbaum: The BG distributed simulation algorithm. Technical Report MIT/LCS/TM-573. Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, December 1997
3. J. Burns, N. Lynch: Mutual exclusion using indivisible reads and writes. In: Proceedings of Eighteenth Annual Allerton Conference on Communications, Control and Computing, pp 833-842, 1980
4. T. Chandra, V. Hadzilacos, P. Jayanti, S. Toueg: Wait-freedom versus t-resiliency and the robustness of wait-free hierarchies. In: D. Peleg (ed) Proceedings of the Thirteenth ACM Symposium on Principles of Distributed Computing, pp 334-343, August 1994
5. M.J. Fischer, N.A. Lynch, M.S. Paterson: Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2): 374-382 (1985)
6. M. Herlihy: Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 11(1): 124-149 (1991)
7. P. Jayanti: On the robustness of Herlihy's hierarchy. In: S. Toueg (ed) Proceedings of the Twelfth ACM Symposium on Principles of Distributed Computing, pp 145-158, August 1993
8. P. Jayanti: Wait-free computing. In: Proceedings of the Ninth International Workshop on Distributed Algorithms, pp 19-50, September 1995
9. L. Lamport: The mutual exclusion problem: Parts I & II. Journal of the ACM, 33(2): 313-348 (1986)
10. W.-K. Lo: More on t-resilence vs. wait-freedom. In: V. Hadzilacos (ed) Proceedings of the Fourteenth ACM Symposium on Principles of Distributed Computing, pp 110-119, August 1995
11. W.-K. Lo: On the relative power of shared objects in fault-tolerant distributed systems. PhD thesis, University of Toronto, January 1997
12. M. Loui, H. Abu-Amara: Memory requirements for agreement among unreliable asynchronous processes. In: Advances in Computer Research, Vol 4, pp 163-183. JAI Press Inc., 1987
13. N. Lynch, S. Rajsbaum: On the Borowsky-Gafni simulation algorithm (extended abstract). In Proceedings of the Fourth Israeli Symposium on Theory of Computing and Systems, pp 4-15, June 1996
14. M. Stumm, S. Zhou: Fault tolerant distributed shared memory. In Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, pp 719-724, December 1990