Robust wait-free hierarchies

Journal of the ACM

Volumn 44, Issue 4, 1997, Pages 592-614

  Jayanti, Prasad ^a  

^a DARTMOUTH COLLEGE   (United States)

Author keywords

Algorithms; Asynchronous computing; Hierarchy; Implementation; MIMD; Reliability; Robustness; Shared memory; Shared objects; Synchronization; Theory; Wait freedom

Indexed keywords

DATA STORAGE EQUIPMENT; HIERARCHICAL SYSTEMS; ROBUSTNESS (CONTROL SYSTEMS); SYNCHRONIZATION;

WAIT FREE HIERARCHY;

MULTIPROCESSING SYSTEMS;

EID: 0031176479     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/263867.263888     Document Type: Article

References (24)

1. BAZZI, R. A., NEIGER, G., AND PETERSON, G. L. 1994. On the use of registers in achieving wait-free consensus. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (Los Angeles, Calif., Aug. 14-17). ACM, New York, pp. 354-363.
2. BOROWSKY, E., AND GAFNI, E. 1993. The implication of the Borowski-Gafni simulation on the set consensus hierarchy. Tech. Rep. 930021. Computer Science Dept., Univ. California at Los Angeles, Los Angeles, Calif.
3. BOROWSKY, E., GAFNI, E., AND AFEK, Y. 1994. Consensus power makes (some) sense! In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (Los Angeles, Calif., Aug. 14-17). ACM, New York, pp. 363-372.
4. CHANDRA, T., HADZILACOS, V., JAYANI, P., AND TOUEG, S. 1994. Wait-freedom vs. t-resilency and the robustness of wait-free hierarchies. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (Los Angeles, Calif., Aug. 14-17). ACM, New York, pp. 334-343.
5. CHAUDHURI, S. 1990. Agreement is harder than consensus: Set consensus problems in totally asynchronous systems. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (Quebec City, Que., Canada, Aug. 22-24). ACM, New York, pp. 311-324.
6. CHOR, B., ISRAELI, A., AND LI, M. 1987. On processor coordination using asynchronous hardware. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (Vancouver, B.C., Canada, Aug. 10-12). ACM, New York, pp. 86-97.
7. DOLEV, D., DWORK, C., AND STOCKMEYER, L. 1987. On the minimal synchronism needed for distributed consensus. J. ACM 34, 1 (Jan.), 77-97.
8. HERLIHY, M. P. 1991. Wait-free synchronization. ACM Trans. Prog. Lang. Syst. 13, 1 (Jan.), 124-149.
9. HERLIHY, M., AND RAJSBAUM, S. 1994. Set consensus using arbitrary objects. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (Los Angeles, Calif., Aug. 14-17). ACM, New York, pp. 324-333.
10. HERLIHY, M., AND SHAVIT, N. 1993. The asynchronous computability theorem for t-resilient tasks. In Proceedings of the 25th ACM Symposium on the Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 111-120.
11. HERLIHY, M. P., AND WING, J. M. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Prog. Lang. Syst. 12, 3 (July), 463-492.
12. JAYANTI, P. 1993. On the robustness of Herlihy's hierarchy. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (Ithaca, N.Y., Aug. 15-18). ACM, New York, pp. 145-158.
13. JAYANTI, P. 1995. Wait-free computing. In Proceedings of the 9th International Workshop on Distributed Algorithms (Le Mont-Saint-Michel, France, Sept.). Lecture Notes in Computer Science, vol. 972. Springer-Verlag, New York, pp. 19-50.
14. JAYANTI, P., AND TOUEG, S. 1992. Some results on the impossibility, universality, and decidability of consensus. In Proceedings of the 6th Workshop on Distributed Algorithms (Haifa, Israel, Nov.). Lecture Notes in Computer Science, vol. 647. Springer-Verlag, New York.
15. KLEINBERG, J. M., AND MULLAINATHAN, S. 1993. Resource bounds and combinations of consensus objects. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (Ithaca, N.Y., Aug. 15-18). ACM, New York, pp. 133-144.
16. LO, W. K., AND HADZILACOS, V. 1997. All of us are smarter than any of us: Wait-free hierarchies are not robust. In Proceedings of the 29th ACM SIGACT Symposium on Theory of Computing (El Paso, Tex., May).
17. LOUI, M. C., AND ABU-AMARA, H. H. 1987. Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163-183.
18. LYNCH, N., AND TUTTLE, M. 1988. An introduction to input/output automata. Tech. Rep. MIT/ LCS/TM-373. Lab. Comput. Sci., Mass. Inst. Tech., Cambridge, Mass.
19. R. In Proceedings of the 10th Workshop on Distributed Algorithms (Bologna, Italy, Oct.). Lecture Note in Computer Science, Vol. 1151. Springer-Verlag, New York, pp. 344-361.
20. PETERSON, G. L., BAZZI, R. A., AND NEIGER, G. 1994. A gap theorem for consensus types. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (Los Angeles, Calif., Aug. 14-17). ACM, New York, pp. 344-353.
21. PLOTKIN, S. A. 1989. Sticky bits and universality of consensus. In Proceedings of the 8th Annual ACM 'Symposium on Principles of Distributed Computing (Edmonton, Alb., Canada, Aug. 14-16). ACM, New York, pp. 159-175.
22. RACHMAN O 1994 Anomalies in the wait-free hierarchy. In Proceedings of the 8th Workshop on Distributed Algorithms (Terschelling, The Netherlands, Sept.-Oct.). Lecture Notes in Computer Science, vol. 857. Springer-Verlag, New York, pp. 156-163.
23. SAKS M AND ZAHAROGLOU, F. 1993. Wait-free k-set agreement is impossible: The topology of public knowledge. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 101-110.
24. SCHENK, E. 1997. The consensus hierarchy is not robust. (Brief Announcement). In Proceedings of the 16th ACM Symposium on Principles of Distributed Computing. ACM, New York.