Failure detectors as type boosters

Distributed Computing

Volumn 20, Issue 5, 2008, Pages 343-358

  Guerraoui, Rachid ^a   Kouznetsov, Petr ^a,b  

^a EPFL   (Switzerland)

^b MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSFER; FAILURE ANALYSIS; FAULT DETECTION; PROCESS CONTROL; STORAGE ALLOCATION (COMPUTER);

DISTRIBUTED SHARED MEMORY SYSTEMS; FAILURE DETECTORS; MESSAGE PASSING SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 38849110837     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-007-0043-z     Document Type: Article

References (24)

1. Afek Y., Attiya H., Dolev D., Gafni E., Merrit M. and Shavit N. (1993). Atomic snapshots of shared memory. J. ACM 40(4): 873-890
2. Attie, P., Lynch, N.A., Rajsbaum, S.: Boosting fault-tolerance in asynchronous message passing systems is impossible. Technical report. MIT Laboratory for Computer Science, MIT-LCS-TR-877, (2002)
3. Attie, P.C., Guerraoui, R., Kouznetsov, P., Lynch, N.A., Rajsbaum, S.: The impossibility of boosting distributed service resilience. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), June (2005)
4. Attiya H. and Welch J.L. (2004). Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. Wiley, New York
5. Borowsky, E., Gafni, E., Afek, Y.: Consensus power makes (some) sense! In: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 363-372, August (1994)
6. Chandra T.D., Hadzilacos V., Jayanti P. and Toueg S. (2004). Generalized irreducibility of consensus and the equivalence of t-resilient and wait-free implementations of consensus. SIAM J. Comput. 34(2): 333-357
7. Chandra T.D., Hadzilacos V. and Toueg S. (1996). The weakest failure detector for solving consensus. J. ACM 43(4): 685-722
8. Chandra T.D. and Toueg S. (1996). Unreliable failure detectors for reliable distributed systems. J. ACM 43(2): 225-267
9. Dolev D., Dwork C. and Stockmeyer L.J. (1987). On the minimal synchronism needed for distributed consensus. J. ACM 34(1): 77-97
10. Dwork C., Lynch N.A. and Stockmeyer L.J. (1988). Consensus in the presence of partial synchrony. J. ACM 35(2): 288-323
11. Fischer M.J., Lynch N.A. and Paterson M.S. (1985). Impossibility of distributed consensus with one faulty process. J. ACM 32(3): 374-382
12. Guerraoui, R., Herlihy, M., Kouznetsov, P., Lynch, N., Newport, C.: On the weakest failure detector ever. Technical report, Max Planck Institute for Software Systems
13. Guerraoui, R., Kouznetsov, P.: On failure detectors and type boosters. In: Proceedings of the 17th International Symposium on Distributed Computing (DISC'03), October (2003)
14. Herlihy M. (1991). Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1): 124-149
15. Herlihy, M., Ruppert, E.: On the existence of booster types. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp 653-663 (2000)
16. Herlihy M. and Wing J.M. (1990). Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3): 463-492
17. Jayanti P. (1997). Robust wait-free hierarchies. J. ACM 44(4): 592-614
18. Jayanti, P., Toueg, S.: Some results on the impossibility, universality and decidability of consensus. In: Proceedings of the 6th International Workshop on Distributed Algorithms (WDAG'92). LNCS, vol 647. Springer, Heidelberg (1992)
19. Lo, W.-K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared-memory systems. In: Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG'94). LNCS, vol. 857, pp. 280-295. Springer, Heidelberg (1994)
20. Lo W.-K. and Hadzilacos V. (2000). All of us are smarter than any of us: Nondeterministic wait-free hierarchies are not robust. SIAM J. Comput. 30(3): 689-728
21. Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res., pp. 163-183 (1987)
22. Lynch N.A. (1996). Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco
23. Neiger, G.: Failure detectors and the wait-free hierarchy. In: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 100-109, August (1995)
24. Ruppert E. (2000). Determining consensus numbers. SIAM J. Comput. 30(4): 1156-1168