JOURNAL BROWSE
Search
Advanced SearchSearch Tips
On Relationship between Safety and Liveness of Election Problem in Asynchronous Distributed Systems
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
On Relationship between Safety and Liveness of Election Problem in Asynchronous Distributed Systems
Park, Sung-Hoon;
  PDF(new window)
 Abstract
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. In completely asynchronous systems, there is no solution for the election problem satisfying both of safety and liveness properties in asynchronous distributed systems. Therefore, to solve the election problem in those systems, one property should be weaker than the other property. If an election algorithm strengthens the safety property in sacrifice of liveness property, it would not nearly progress. But on the contrary, an election algorithm strengthening the liveness property in sacrifice of the safety property would have the high probability of violating the safety property. In this paper, we presents a safety strengthened Leader Election protocol with an unreliable failure detector and analyses it in terms of safety and liveness properties in asynchronous distributed systems.
 Keywords
Distributed Computing;Leader Election;Asynchronous Distributed Systems;Failure Detectors;
 Language
English
 Cited by
 References
1.
G. LeLann, "Distributed Systems-towards a Formal Approach," in Information Processing 77, B. Gilchrist, Ed. North-Holland, 1977.

2.
H.Garcia-Molian, "Elections in a Distributed Computing System," IEEE Transactions on Computers, vol. C-31, no. 1, Jan. 1982, pp. 49-59.

3.
H. Abu-Amara and J. Lokre, "Election in Asynchronous Complete Networks with Intermittent Link Failures." IEEE Transactions on Computers, vol. 43, no. 7, 1994, pp.778-788. crossref(new window)

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, vol. 9, no. 3, 1995, pp.147-156. crossref(new window)

5.
J. Brunekreef, J.-P. Katoen, R. Koymans, and S. Mauw, "Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks," Distributed Computing, vol. 9, no. 4, 1996, pp.157-171. crossref(new window)

6.
G. Singh, "Leader Election in the Presence of Link Failures," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 3, March 1996, pp.231-236. crossref(new window)

7.
M. Fischer, N. Lynch, and M. Paterson, "Impossibility of Distributed Consensus with One Faulty Process," Journal of the ACM,(32) 1985, pp. 374-382 crossref(new window)

8.
T. Chandra and S.Toueg, "Unreliable Failure Detectors for Reliable Distributed Systems," Journal of ACM, vol.43 no.2, 1996, pp. 225-267. crossref(new window)

9.
D. Dolev and R Strong, "A Simple Model For Agreement in Distributed Systems," In Fault-Tolerant Distributed Computing, pp. 42-50. B. Simons and A. Spector ed, Springer Verlag (LNCS 448), 1987.

10.
T. Chandra, V. Hadzilacos and S. Toueg, "The Weakest Failure Detector for Solving Consensus," Journal of ACM, vol.43 no.4, 1996, pp. 685-722. crossref(new window)