Browse > Article
http://dx.doi.org/10.5762/KAIS.2013.14.5.2457

A Mutual Exclusion Algorithm in Asynchronous Distributed System with Failure Detectors  

Park, Sung-Hoon (Dept. of Computer Engineering, Chungbuk National University)
Publication Information
Journal of the Korea Academia-Industrial cooperation Society / v.14, no.5, 2013 , pp. 2457-2464 More about this Journal
Abstract
In this paper, we design and analyze a mutual exclusion algorithm, based on the Token and Failure detector, in asynchronous distributed systems. A Failure Detector is an independent module that detects and reports crashes of other processes. There are some of advantages in rewriting the Token-based ME algorithm using a Failure Detector. We show that the Token-based ME algorithm, when using Failure Detector, is more effectively implemented than the classic Token-based ME algorithm for synchronous distributed systems.
Keywords
Synchronous Distributed Systems; Mutual exclusion; Fault Tolerance; Failure Detector;
Citations & Related Records
연도 인용수 순위
  • Reference
1 T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685.722, March 1996. DOI: http://dx.doi.org/10.1145/234533.234549   DOI   ScienceOn
2 T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225.267, March 1996. DOI: http://dx.doi.org/10.1145/226643.226647   DOI   ScienceOn
3 G. Chockler, D. Malkhi, and M. K. Reiter. Backo. protocols for distributed mutual exclusion and ordering. In Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS-21), April 2001.
4 E. W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, September 1965. DOI: http://dx.doi.org/10.1145/365559.365617   DOI
5 M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(3):374.382, April 1985.   DOI   ScienceOn
6 I. Suzuki and T. Kasami. A distributed mutual exclusion algorithm. ACM transaction on Computer Systems, 3(4):344-349, November 1985. DOI: http://dx.doi.org/10.1145/6110.214406   DOI   ScienceOn
7 E. Gafni and M. Mitzenmacher. Analysis of timing-based mutual exclusion with random times. SIAM Journal on Computing, 31(3):816.837, 2001. DOI: http://dx.doi.org/10.1137/S0097539799364912   DOI   ScienceOn
8 V. Hadzilacos. A note on group mutual exclusion. In 20th ACM SIGACTSIGOPS Symposium on Principles of Distributed Computing, August 2001. DOI: http://dx.doi.org/10.1145/383962.383997   DOI
9 Y.-J. Joung. Asynchronous group mutual exclusion. In 17th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 51.60, June 1998. DOI: http://dx.doi.org/10.1145/277697.277706   DOI
10 P. Keane and M. Moir. A simple local-spin group mutual exclusion algorithm. IEEE Transactions on Parallel and Distributed Systems, 12(7):673. 685, July 2001. DOI: http://dx.doi.org/10.1109/71.940743   DOI   ScienceOn
11 L. Lamport. A new solution of Dijkstra's concurrent programming problem. Communications of the ACM, 17(8):453.455, August 1974. DOI: http://dx.doi.org/10.1145/361082.361093   DOI   ScienceOn
12 L. Lamport. The mutual exclusion problem. Parts I&II. Journal of the ACM, 33(2):313.348, April 1986. DOI: http://dx.doi.org/10.1145/5383.5385   DOI   ScienceOn
13 S. Lodha and A. D. Kshemkalyan. A fair distributed mutual exclusion algorithm. IEEE Transactions on Parallel and Distributed Systems, 11(6):537. 549, June 2000. 24 DOI: http://dx.doi.org/10.1109/71.862205   DOI   ScienceOn
14 N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
15 M. Maekawa. $A{\sqrt{N}}$ algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145.159, May 1985. DOI: http://dx.doi.org/10.1145/214438.214445   DOI   ScienceOn
16 D. Manivannan and M. Singhal. An efficient fault-tolerant mutual exclusion algorithm for distributed systems. In Proceedings of the ISCA International Conference on Parallel and Distributed Computing Systems, pages 525.530, October 1994.
17 Carole Delporte-Gallet and Hugues Fauconnier: The weakest Failure Detector to Solve certain Fundamental Problems in Distributed computing. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, New York: ACM Press 2004 DOI: http://dx.doi.org/10.1145/1011767.1011818   DOI
18 D. Agrawal and A. E. Abbadi. An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Transactions on Computer Systems, 9(1):1 . 20, February 1991. DOI: http://dx.doi.org/10.1145/103727.103728   DOI