Advertisement

Revisiting the Election Problem in Asynchronous Distributed Systems

  • SungUoon Bauk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3756)

Abstract

This paper is about the relationship between the Election Problem and Failure Detectors in asynchronous distributed systems. It is stated in [7] that a Perfect Failure Detector P is needed to solve the Election problem. But in contrast to the result, there is a failure detector that solves Election weaker than the Perfect Failure Detector. We introduce the Confirmatory failure detector C. We show that to solve Election, C is necessary while P is not, whereas C+\(\diamondsuit\)S is sufficient when a majority of the processes are correct.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    LeLann, G.: Distributed Systems–towards a Formal Approach. In: Gilchrist, B. (ed.) Information Processing, vol. 77. North–Holland, Amsterdam (1977)Google Scholar
  2. 2.
    Garcia-Molina, H.: Elections in a Distributed Computing System. IEEE Transactions on Computers C-31, 49–59 (1982)CrossRefGoogle Scholar
  3. 3.
    Abu-Amara, H., Lokre, J.: Election in Asynchronous Complete Networks with Intermittent Link Failures. IEEE Transactions on Computers 43, 778–788 (1994)zbMATHCrossRefGoogle Scholar
  4. 4.
    Singh, G.: Leader Election in the Presence of Link Failures. IEEE Transactions on Parallel and Distributed Systems 7, 231–236 (1996)CrossRefGoogle Scholar
  5. 5.
    Fischer, M., Lynch, N., Paterson, M.: Impossibility of Distributed Consensus with One Faulty Process. Journal of ACM (32), 374–382 (1985)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Chandra, T., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of ACM 43, 225–267 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Sabel, L., Marzullo, K.: Election Vs. Consensus in Asynchronous Distributed Systems. In: Technical Report Cornell Univ. (October 1995)Google Scholar
  8. 8.
    Chandra, T., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. Journal of ACM 43, 685–722 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading (1979)zbMATHGoogle Scholar
  10. 10.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman W.H & Co., New York (1979)zbMATHGoogle Scholar
  11. 11.
    Fromentin, E., RAY, M., TRONEL, F.: On Classes of Problems in Asynchronous Distributed Systems. In: Proceedings of Distributed Computing Conference, June 1999. IEEE, Los Alamitos (1999)Google Scholar
  12. 12.
    Hadzilacos, V., Toueg, S.: Reliable Broadcast and Related Problems. Distributed Systems, 2nd edn., pp. 97–145. ACM Press, New York (1993)Google Scholar
  13. 13.
    Guerraoui, R.: Indulgent Algorithms. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. ACM Press, New York (2000)Google Scholar
  14. 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. 15.
    Guerraoui, R., Schiper, A.: Transaction model vs. Virtual Synchrony model: bridging the gap. In: Birman, K., Mattern, F., Schiper, A. (eds.) Dagstuhl Seminar 1994. LNCS, vol. 938, pp. 121–132. Springer, Heidelberg (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • SungUoon Bauk
    • 1
  1. 1.School of Electrical and Computer EngineeringChungbuk National Unvi. CheongjuChungBukKorea

Personalised recommendations