Skip to main content
SpringerLink
Log in

Analysis of an Election Problem for CSCW in Asynchronous Distributed Systems

  • Conference paper
  • First Online:
Engineering and Deployment of Cooperative Information Systems (EDCIS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2480))

  • 470 Accesses

Abstract

This paper analyses the leader election problem in terms of the failure detectors in asynchronous distributed systems. A Leader is a Coordinator that supports a set of processes to cooperate a given task. This concept is used in several domains such as distributed systems, parallelism and cooperative support for cooperative work (CSCW). We first discuss the relationship between the Election problem and the Consensus problem in asynchronous distributed systems with unreliable failure detectors. Chandra and Toueg have stated that Consensus is solvable in asynchronous systems with unreliable failure detectors. But, in contrast to the Consensus problem, the Election problem is impossible to solve with unreliable failure detectors even with a single crash failure. More precisely, the weakest failure detector that is needed to solve this problem is a Perfect Failure Detector, which is strictly stronger than the weakest failure detector that is needed to solve Consensus.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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, 9 (1995) 147–156

    Article  MathSciNet  Google Scholar 

  5. J. Brunekreef, J.-P. Katoen, R. Koymans, and S. Mauw: Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks. Distributed Computing, 9 (1996) 157–171

    Article  Google Scholar 

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

    Article  Google Scholar 

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

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

    Article  MATH  MathSciNet  Google Scholar 

  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

    Chapter  Google Scholar 

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

  11. Rachid Guerraoui: Revisiting the Relationship between Non-Blocking Atomic Commitment and Consensus. In Proceedings of the 10th International Workshop on Distributed Algorithms. Lecture Notes in Computer Science, Vol. 857 Springer-Verlag, Berlin Heidelberg New York (1996) 27–37

    Google Scholar 

  12. P. A. Bernstein, V. Hadzilacos and N. Goodman: Concurrency Control and Recovery in Database Systems. Addison Wesley, 1987

    Google Scholar 

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

    MATH  Google Scholar 

  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

    MATH  Google Scholar 

  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

    Google Scholar 

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

    Google Scholar 

  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

    Chapter  Google Scholar 

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

    Google Scholar 

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

Author information

Authors and Affiliations

  1. Dept. of Computer Science, NamSeoul University, Chung-Nam, 330-800, Korea

    Sung-Hoon Park

Authors
  1. Sung-Hoon Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computing Technique, P.O. Box 2704, 100080, Beijing, China

    Yanbo Han

  2. IBM T.J. Watson Research Center, P.O. Box 704, 10598, NY, Yorktown Heights, USA

    Stefan Tai

  3. FH Brandenburg, University of Applied Sciences, Magdeburger Str. 50, 14770, Brandenburg an der Havel, Germany

    Dietmar Wikarski

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, SH. (2002). Analysis of an Election Problem for CSCW in Asynchronous Distributed Systems. In: Han, Y., Tai, S., Wikarski, D. (eds) Engineering and Deployment of Cooperative Information Systems. EDCIS 2002. Lecture Notes in Computer Science, vol 2480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45785-2_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-45785-2_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44222-6

  • Online ISBN: 978-3-540-45785-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation