Tight failure detection bounds on atomic object implementations

Journal of the ACM

Volumn 57, Issue 4, 2010, Pages

  Delporte Gallet, Carole ^a   Fauconnier, Hugues ^a   Guerraoui, Rachid ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b EPFL   (Switzerland)

Author keywords

Atomic objects; Failure detection

Indexed keywords

ATOMIC OBJECTS; DISTRIBUTED SYSTEMS; FAILURE DETECTION; FAILURE DETECTORS;

DETECTORS;

ATOMS;

EID: 77952073107     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1734213.1734216     Document Type: Article

References (18)

1. AGUILERA, M., DELPORTE-GALLET, C., FAUCONNIER, H., AND TOUEG, S. 2000. Thrifty generic broadcast. In Proceedings of the 14th International Symposium on Distributed Computing. Lecture Notes in Computer Science, vol. 1914. Springer-Verlag, Berlin, Germany, 268-283.
2. ATTIYA, H., BAR-NOY, A., AND DOLEV, D. 1995. Sharing memory robustly in message passing systems. J. ACM 42, 2 (Jan.), 124-142.
3. ATTIYA, H., AND WELCH, J. 1998. Distributed Computing. Fundamentals, Simulations, and Advanced Topics. McGraw-Hill, New York.
4. BAZZI, R. A., NEIGER, G., AND PETERSON, G. L. 1997. On the use of registers in achieving wait-free consensus. Distrib. Comput. 10, 3, 117-127.
5. CHANDRA, T. D., HADZILACOS, V., AND TOUEG, S. 1996. The weakest failure detector for solving consensus. J. ACM 43, 4 (July), 685-722.
6. CHANDRA, T. D., AND TOUEG, S. 1996. Unreliable failure detectors for reliable distributed systems. J. ACM 43, 2 (Mar.), 225-267.
7. FISCHER, M. J., LYNCH, N. A., AND PATERSON, M. S. 1985. Impossibility of distributed consensus with one faulty process. J. ACM 32, 2 (Apr.), 374-382.
8. HADZILACOS, V., AND TOUEG, S. 1993. Fault-tolerant broadcasts and related problems. In Distributed Systems. Addison-Wesley, Reading, MA, Chapter 5, 97-145.
9. HERLIHY, M., AND WING, J. M. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3, 463-492.
10. HERLIHY, M. P. 1991. Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13, 1 (Jan.), 123-149.
11. ISRAELI, A., AND LI, M. 1993. Bounded time-stamps. Distrib. Comput. 6, 4 (July), 205-209.
12. JAYANTI, P. 1993. On the robustness of Herlihy's hierarchy. In Proceedings of the 12th ACM Symposium on Principles of Distributed Computing. ACM, New York, 145-157.
13. LAMPORT, L. 1978. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7 (July), 558-565.
14. LAMPORT, L. 1986. On interprocess communication; part I and II. Distrib. Comput. 1, 2, 77-101.
15. LAMPORT, L. 1998. The Part-Time parliament. ACM Trans. Comput. Syst. 16, 2 (May), 133-169.
16. LOUI, M., AND ABU-AMARA, H. 1987. Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163-183.
17. SCHNEIDER, F. 1986. The state machine approach: A tutorial. In Fault-Tolerant Distributed Computing. Lecture Notes in Computer Science, vol. 448. Springer-Verlag, Berlin, Germany, 18-41.
18. VITANYI, P., AND AWERBUCH, B. 1986. Atomic shared register access by asynchronous hardware. In Proceedings of the IEEE Symposium om Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 233-243.