On Relationship between Safety and Liveness of Election Problem in Asynchronous Distributed Systems
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (10)
- G. LeLann, "Distributed Systems–towards a Formal Approach, In Information Processing 77" (1977), North–Holland
- H.Garcia-Molian, "Elections in a Distributed Computing System", IEEE Transactions on Computers, C-31(1), pp.49~59 (1982)
- H. Abu-Amara, "Election in Asynchronous Complete Networks with Intermittent Link Failures", IEEE Transactions on Computers, 43(7), pp.778~788 (1994)
- H.M. Sayeed, "Optimal Asynchronous Agreement and Leader Election Algorithm for Complete Networks with Byzantine Faulty Links", Distributed Computing, 9(3), pp.147~156 (1995)
- J. Brunekreef, "Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks", Distributed Computing, 9(4), pp.157~171 (1996)
- G. Singh, "Leader Election in the Presence of Link Failures", IEEE Transactions on Parallel and Distributed Systems, 7(3), pp.231~236 (1996)
- M. Fischer, "Impossibility of Distributed Consensus with One Faulty Process", Journal of the ACM, (32), pp.374~382 (1985)
- T. Chandra, "Unreliable Failure Detectors for Reliable Distributed Systems", Journal of ACM, 43(2), pp.225~267 (1996)
- D. Dolev, "A Simple Model For Agreement in Distributed Systems, In Fault-Tolerant Distributed Computing", pp.42~50 (1987), Springer Verlag (LNCS 448)
- T. Chandra, "The Weakest Failure Detector for Solving Consensus", Journal of ACM, 43(4), pp.685~722 (1996)