About the relationship between election problem and failure detector in asynchronous distributed systems

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

Volumn 2657, Issue , 2003, Pages 185-193

  Park, Sung Hoon ^a  

^a Namseoul University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASYNCHRONOUS DISTRIBUTED SYSTEM; ASYNCHRONOUS SYSTEM; CHANDRA; CONSENSUS PROBLEMS; CRASH FAILURES; FAILURE DETECTORS; UNRELIABLE FAILURE DETECTOR;

PROBLEM SOLVING;

EID: 35248894830     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44860-8_19     Document Type: Article

References (19)

1. G. LeLann: Distributed Systems-towards a Formal Approach. Information Processing 77, B. Gilchrist, Ed. North-Holland, 1977
2. H. Garcia-Molina: Elections in a Distributed Computing System. IEEE Transactions on Computers, C-31 (1982) 49-59
3. H. Abu-Amara and J. Lokre: Election in Asynchronous Complete Networks with Intermittent Link Failures. IEEE Transactions on Computers, 43 (1994) 778-788
4. H.M. Sayeed, M. Abu-Amara, and H. Abu-Avara, "Optimal Asynchronous Agreement and Leader Election Algorithm for Complete Networks with Byzantine Faulty Links.," Distributed Computing, vol. 9, no. 3, pp.147-156, 1995
5. J. Brunekreef, J.-P. Katoen, R. Koymans, and S. Mauw, "Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks," Distributed Computing, vol. 9, no. 4, pp.157-171, 1996
6. G. Singh: Leader Election in the Presence of Link Failures. IEEE Transactions on Parallel and Distributed Systems, 7 (1996) 231-236
7. M. Fischer, N. Lynch, and M. Paterson: Impossibility of Distributed Consensus with One Faulty Process. Journal of ACM, (32) 1985 374-382
8. T. Chandra and S. Toueg: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of ACM, 43 (1996) 225-267
9. D. Dolev and R Strong: A Simple Model For Agreement in Distributed Systems. In: B. Simons and A. Spector (eds.): Fault-Tolerant Distributed Computing. Lecture Notes in Computer Science, Vol.448. Springer-Verlag, Berlin Heidelberg New York (1987) 42-50
10. T. Chandra, V. Hadzilacos and S. Toueg: The Weakest Failure Detector for Solving Consensus. Journal of ACM, 43 (1996) 685-722
11. Rachid Guerraoui. "Revisiting the Relationship between Non-Blocking Atomic Commitment and Consensus," In Proceedings of the 10th International Workshop on Distributed Algorithms, Springer Verlag (LNCS 857), 1996
12. P.A. Bernstein, V. Hadzilacos, and N. Goodman, "Concurrency Control and Recovery in Database Systems," Addison Wesley, 1987
13. J. E. Hopcroft and J. D. Ullman: Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading, Mass., 1979
14. Garey M.R. and Johnson D.S: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman W.H & Co, New York, 1979
15. Eddy Fromentin, Michel RAY and Frederic TRONEL: On Classes of Problems in Asynchronous Distributed Systems. In Proceedings of Distributed Computing Conference. IEEE, June 1999
16. Hadzilacos V. and Toueg S: Reliable Broadcast and Related Problems. Distributed Systems (Second Edition), ACM Press, New York, pp.97-145, 1993
17. V. Hadzilacos, "On the Relationship between the Atomic Commitment and Consensus Problems," In Fault-Tolerant Distributed Computing, pp. 201-208. B. Simons and A. spector ed, Springer Verlag (LNCS 448), 1987
18. Schiper and A. Sandoz: Primary Partition: Virtually-Synchronous Communication harder than Consensus. In Proceedings of the 8th Workshop on Distributed Algorithms, 1994
19. R. Guerraoui and A. Schiper: Transaction model vs. Virtual Synchrony model: bridging the gap. In: K. Birman, F. Mattem and A. Schiper (eds.): Distributed Systems: From Theory to Practice. Lecture Notes in Computer Science, Vol. 938. Springer-Verlag, Berlin Heidelberg New York (1995) 121-132