This Article 
 Bibliographic References 
 Add to: 
Leader Election in Asynchronous Distributed Systems
March 2000 (vol. 49 no. 3)
pp. 283-284

Abstract—In a previous paper, Garcia-Molina specifies the leader election problem for synchronous and asynchronous distributed systems with crash and link failures and gives an elegant algorithm for each type of system. This paper points out a flaw in Garcia-Molina's specification of leader election in asynchronous systems and proposes a new specification.

[1] R. Chow and T. Johnson, Distributed Operating Systems and Algorithms. Addison Wesley, 1997.
[2] F. Cristian and F. Schmuck, “Agreeing on Processor Group Membership in Asynchronous Distributed Systems,” Technical Report CSE95-428, Univ. of California, San Diego, 1995.
[3] H. Garcia-Molina, “Elections in a Distributed Computing System,” IEEE Trans. Computers, vol. 31, no. 1, pp. 47-59, Jan. 1982.
[4] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[5] M.F. Kaashoek and A.S. Tanenbaum, “Group Communication in the Amoeba Distributed Operating System,” Proc. IEEE 11th Int'l Conf. Distributed Computing Systems (ICDCS), pp. 222-230, 1991.

Index Terms:
Leader election, group membership, asynchronous distributed systems, crash failures.
Scott D. Stoller, "Leader Election in Asynchronous Distributed Systems," IEEE Transactions on Computers, vol. 49, no. 3, pp. 283-284, March 2000, doi:10.1109/12.841132
Usage of this product signifies your acceptance of the Terms of Use.