A realistic look at failure detectors

Proceedings of the 2002 International Conference on Dependable Systems and Networks

Volumn , Issue , 2002, Pages 345-353

  Delporte Gallet, C ^a   Fauconnier, H ^a   Guerraoui, R ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BYZANTINE GENERALS PROBLEM; DETERMINISTIC AUTOMATA; FAILURE DETECTION; TERMINATING RELIABLE BROADCAST;

ALGORITHMS; AUTOMATA THEORY; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; FAILURE ANALYSIS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0036922360     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2002.1028919     Document Type: Conference Paper

References (17)

1. T. Chandra and S. Toueg, Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2), March 1996.
2. T. Chandra, V. Hadzilacos and S. Toueg. The Weakest Failure Detector for Solving Consensus. Journal of the ACM, 43(4), July 1996.
3. C. Dwork, N. Lynch and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35 (2), 1988.
4. C. Fetzer and F. Cristian. Fail-aware failure detectors. Proceedings of the 15th IEEE Symposium on Reliable Distributed Systems, Niagara-on-the-Lake, Canada, Oct 1996.
5. M. Fischer, N. Lynch and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2), 1985.
6. F. Greve, M. Hurfin, M. Raynal and F. Tronel. Primary Component Asynchronous Group Membership as an Instance of a Generic Agreement Framework. Proceedings of the IEEE International Symposium on Autonomous Decentralized Systems (ISADS), 2001.
7. E. Fromentin, M. Raynal, and F. Tronel. About Classes of Problems in Asynchronous Distributed Systems with Process Crashes. Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS), 1999.
8. R. Guerraoui. Revisiting the relationship between the atomic commitment and consensus problems. Proceedings of the Workshop on Distributed Algorithms, Springer Verlag (LNCS 972), 1995.
9. R. Guerraoui. On the Hardness of Failure Sensitive Agreement Problems. Information Processing Letters, 79, 2001.
10. V. Hadzilacos. On the relationship between the atomic commitment and consensus problems. Proceedings of the Workshop on Fault-Tolerant Distributed Computing, Springer Verlag (LNCS 448), 1986.
11. V. Hadzilacos and S. Toueg. Fault-Tolerant Broadcasts and Related Problems. Cornell University, Technical Report (TR 94-1425), 1994.
12. Distributed Systems, S. Mullender (ed), Addison-Wesley, 1993.
13. J. Halpern and A. Ricciardi. A Knowledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors. Proceedings of the ACM Symposium on Principles of Distributed Computing, 1999.
14. L. Lamport, M. Pease and R. Shostak. The Byzantine Generals Problems. ACM Transactions on Programming Languages and Systems 4(3), July 1982.
15. D. Powell (editor). Special issue on Group Communications. Communications of the ACM, 39 (4), 1996.
16. G. Tel. Topics in Distributed Algorithms. Cambridge International Series, 1991.
17. P. Verissimo, A. Casimiro and C. Fetzer. The Timely Computing Base: Timely Actions in the Presence of Uncertain Timeliness. Proceedings of the IEEE International Symposium on Dependable Systems and Networks (DSN), 2000.