On failure detectors and type boosters: (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2848, Issue , 2003, Pages 292-305

  Guerraoui, Rachid ^a   Kouznetsov, Petr ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; DISTRIBUTED COMPUTER SYSTEMS;

EXTENDED ABSTRACTS; FAILURE DETECTORS;

OUTAGES;

EID: 35248852517     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39989-6_21     Document Type: Article

References (19)

1. P. Attie, N. Lynch, and S. Rajsbaum. Boosting fault-tolerance in asynchronous message passing systems is impossible. Technical report, MIT Laboratory for Computer Science, MIT-LCS-TR-877, 2002.
2. E. Borowsky, E. Gafni, and Y. Afek. Consensus power makes (some) sense! In Proceedings of the 13th ACM Symposium on Principles of Distributed Computing (PODC), pages 363-372, August 1994.
3. T. Chandra, V. Hadzilacos, P. Jayanti, and S. Toueg. Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies. In Proceedings of the 13th ACM Symposium on Principles of Distributed Computing (PODC), pages 334-343. ACM Press, 1994.
4. T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM (JACM), 43(4):685-722, July 1996.
5. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM (JACM), 43(2):225-267, March 1996.
6. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM (JACM), 35(2):288-323, 1988.
7. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(3):374-382, April 1985.
8. R. Guerraoui and P. Kouznetsov. On failure detectors and type boosters. Technical report, IC, EPFL, ID:IC/2003/48, 2003. Available at http://icwww.epfl.ch/publications/.
9. V. Hadzilacos. On the relationship between the atomic commitment and consensus problems. In Proceedings of the Workshop on Fault-Tolerant Distributed Computing, volume 448 of LNCS, pages 201-208. Springer-Verlag, 1986.
10. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems (TOPLAS), 13(1):124-149, January 1991.
11. M. Herlihy and E. Ruppert. On the existence of booster types. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), pages 653-663, 2000.
12. M. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 12(3):463-492, June 1990.
13. P. Jayanti. Wait-free computing. In Proceedings of the 9th International Workshop on Distributed Algorithms (WDAG), volume 972 of LNCS, pages 19-50. Springer Verlag, 1995.
14. P. Jayanti. Robust wait-free hierarchies. Journal of the ACM (JACM), 44(4):592-614, 1997.
15. W.-K. Lo and V. Hadzilacos. Using failure detectors to solve consensus in asynchronous shared-memory systems. In Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG), volume 857 of LNCS, pages 280-295. Springer Verlag, 1994.
16. W.-K. Lo and V. Hadzilacos. All of us are smarter than any of us: Nondeterministic wait-free hierarchies are not robust. SIAM Journal of Computing, 30(3):689-728, 2000.
17. M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, pages 163-183, 1987.
18. G. Neiger. Failure detectors and the wait-free hierarchy. In Proceedings of the 14th A CM Symposium on Principles of Distributed Computing (PODC), pages 100-109, August 1995.
19. E. Ruppert. Determining consensus numbers. SIAM Journal of Computing, 30(4):1156-1168, 2000.