The Weakest Failure Detector for Solving Election Problems in Asynchronous Distributed Systems

1. G. LeLann: Distributed Systems-towards a Formal Approach. Information Processing 77, B. Gilchrist, Ed. North-Holland, 1977

   Google Scholar 

2. H. Garcia-Molina: Elections in a Distributed Computing System. IEEE Transactions on Computers, C-31 (1982) 49–59

   Article  Google Scholar 

3. H. Abu-Amara and J. Lokre: Election in Asynchronous Complete Networks with Intermittent Link Failures. IEEE Transactions on Computers, 43 (1994) 778–788

   Article  MATH  Google Scholar 

4. G. Singh: Leader Election in the Presence of Link Failures. IEEE Transactions on Parallel and Distributed Systems, 7 (1996) 231–236

   Article  Google Scholar 

5. M. Fischer, N. Lynch, and M. Paterson: Impossibility of Distributed Consensus with One Faulty Process. Journal of ACM, (32) 1985 374–382

   Article  MATH  MathSciNet  Google Scholar 

6. T. Chandra and S. Toueg: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of ACM, 43 (1996) 225–267

   Article  MATH  MathSciNet  Google Scholar 

7. 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

   Google Scholar 

8. T. Chandra, V. Hadzilacos and S. Toueg: The Weakest Failure Detector for Solving Consensus. Journal of ACM, 43 (1996) 685–722

   Article  MATH  MathSciNet  Google Scholar 

9. J. E. Hopcroft and J. D. Ullman: Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading, Mass., 1979

   MATH  Google Scholar 

10. 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

    MATH  Google Scholar 

11. Eddy Fromentin, Michel RAY and Frederic TRONEL: On Classes of Problems in Asynchronous Distributed Systems. In Proceedings of Distributed Computing Conference. IEEE, June 1999

    Google Scholar 

12. Hadzilacos V. and Toueg S: Reliable Broadcast and Related Problems. Distributed Systems (Second Edition), ACM Press, New York, pp. 97–145, 1993

    Google Scholar 

13. 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

    Chapter  Google Scholar 

14. Schiper and A. Sandoz: Primary Partition: Virtually-Synchronous Communication harder than Consensus. In Proceedings of the 8th Workshop on Distributed Algorithms, 1994

    Google Scholar 

15. R. Guerraoui and A. Schiper: Transaction model vs. Virtual Synchrony model: bridging the gap. In: K. Birman, F. Mattern 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

    Google Scholar 

Download references