Journal of the Korea Academia-Industrial cooperation Society (한국산학기술학회논문지)

The Korea Academia-Industrial cooperation Society (한국산학기술학회)
권호 표지
DOI QR코드

DOI QR Code

A Mutual Exclusion Algorithm in Asynchronous Distributed System with Failure Detectors

비동기적 분산시스템에서 고장 추적 장치를 이용한 상호배제 알고리즘 설계

  • Received : 2013.04.15
  • Accepted : 2013.05.09
  • Published : 2013.05.31
Download PDF
⟨ Previous Next ⟩

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.

본 논문에서는 토큰과 고장추적 장치를 이용한 상호배제 알고리즘을 비동기적인 분산시스템 환경에서 설계하고 분석하고자 한다. 고장추적 장치란 독립된 프로그램으로 다른 프로세스의 크래시 여부를 알려주는 기능을 한다. 이러한 고장추적 장치를 이용하여 토큰기반 ME 알고리즘을 재 작성하는 경우 많은 유익함이 있다. 기존에 동기적인 분산 시스템에서 제안 되었던 토큰기반의 상호배제 (Mutual Exclusion)은 고장 추적 장치를 이용하여 재설계 되는 경우 전통적인 토큰기반 상호배제 알고리즘 보다 훨씬 효율적으로 구현 될 수 있음을 보인다.

Keywords

References

  1. 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
  2. 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
  3. 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
  4. 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
  5. 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.
  6. 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
  7. 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. https://doi.org/10.1145/3149.214121
  8. 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
  9. 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
  10. 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
  11. 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
  12. 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
  13. 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
  14. 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
  15. 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
  16. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
  17. 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
  18. 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.