Wait-freedom vs. T-resiliency and the robustness of wait-free hierarchies

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn Part F129432, Issue , 1994, Pages 334-343

  Chandra, Tushar ^a   Hadzilacos, Vassos ^b   Jayanti, Prasad ^c   Toueg, Sam ^d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c DARTMOUTH COLLEGE   (United States)

^d Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001179422     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/197917.198121     Document Type: Conference Paper

References (7)

1. Y. Afek, D. Greenberg, M. Merritt, and G. Taubenfeld. Computing with faulty shared memory. In Proceedings of the 11th Annual Symposium on Principles of Distributed Computing, pages 47-58, August 1992.
2. E. Borowsky and E. Gafni. Generalized FLP result for t-resilient asynchronous computations. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 91-100, 1993.
3. D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77-97, January 1987.
4. M. P. Herlihy. Impossibility and universality results for wait-free synchronization. In Proceedings of the 1th ACM Symposium on Principles of Distributed Computing, 1988.
5. M. P. Herlihy. Wait-free synchronization. ACM TOPLAS, 13(1):124-149, 1991.
6. P. Jayanti. On the robustness of herlihy's hierarchy. In Proceedings of the 12th Annual Symposium on Principles of Distributed Computing, August 1993.
7. M. C. Loui and Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in computing research, 4:163-183, 1987.