Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Leader election in distributed computing systems

  • Track 10: Distributed Systems
  • Conference paper
  • First Online:
Computing in the 90's (Great Lakes CS 1989)

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

Included in the following conference series:

Abstract

In a distributed computing system, a change in the state of the system usually requires that the new state be propagated to all active nodes so that they can correctly perform cooperative tasks. Since more than one node may detect a status change, conflicts in state determination and propagation are possible. In order to ensure that all nodes of a communicating group are at the same state, all nodes of the group must agree upon the election of a single leader (coordinator).

In this paper, we present an Election Protocol for General Configuration networks (EPGC). The protocol was tested on different well known configurations and its performance was studied using simulation modeling techniques. The simulation study showed a trade off between the election time and the number of exchanged messages. A technique to minimize the number of messages was then introduced. Both positive and negative effects of this technique were observed.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Garcia-Molina. “Elections in A Distributed Computing System,” IEEE Trans. on Comp., vol. C-31, no. 1, pp. 48–59, 1982.

    Google Scholar 

  2. W. Kim. “AUDITOR: A Framework for High Availability of DB/DC Systems,” IBM Res. Rep. RJ3512, 1982.

    Google Scholar 

  3. P. Bernstien, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987.

    Google Scholar 

  4. J. Kim and G. Belford. “A Robust, Distributed Election Protocol,” 7th Symp. Reliable Distributed Systems. (Colombus, Ohio), IEEE; vol. CH2612, pp. 54–60, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Illinois Institute of Technology, 10 W 31st Street, 60616, Chicago, IL

    Mohamed El-Ruby, James Kenevan & Robert Carlson

  2. Bell Communications Research, 444 Hoes Lane, Rm. RRC-1J217, 08854, Piscataway, NJ

    Khalid Khalil

Authors
  1. Mohamed El-Ruby
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. James Kenevan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert Carlson
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Khalid Khalil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

El-Ruby, M., Kenevan, J., Carlson, R., Khalil, K. (1991). Leader election in distributed computing systems. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038514

Download citation

  • DOI: https://doi.org/10.1007/BFb0038514

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation