DOI QR코드

DOI QR Code

Design of Fault-tolerant Mutual Exclusion Protocol in Asynchronous Distributed Systems

비동기적 분산 시스템에서 결함허용 상호 배제 프로토콜의 설계

  • Park, Sung-Hoon (Dept. of Computer Engineering, Chungbuk National University)
  • 박성훈 (충북대학교 컴퓨터공학과)
  • Published : 2010.01.31

Abstract

This paper defines the quorum-based fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines a failure detector to solve the problem. This failure detector, which we call the modal failure detector star, and which we denote by $M^*$, is strictly weaker than the perfect failure detector P but strictly stronger than the eventually perfect failure detector ◇P. The paper shows that at any environment, the problem is solvable with $M^*$.

Keywords

Mutual Exclusion;Failure Detector;Fault-Tolerant System;Asynchronous Distributed Systems

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
  2. D. Agrawal and A. E. Abbadi. An e.cient and fault-tolerant solution for distributed mutual exclusion. ACM Transactions on Computer Systems, 9(1):1 . 20, February 1991. https://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. https://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. https://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. https://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. E. Gafni and M. Mitzenmacher. Analysis of timing-based mutual exclusion with random times. SIAM Journal on Computing, 31(3):816.837, 2001. https://doi.org/10.1137/S0097539799364912
  9. V. Hadzilacos. A note on group mutual exclusion. In 20th ACM SIGACTSIGOPS Symposium on Principles of Distributed Computing, August 2001.
  10. Y.-J. Joung. Asynchronous group mutual exclusion. In 17th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 51.60, June 1998.
  11. 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. https://doi.org/10.1109/71.940743
  12. L. Lamport. A new solution of Dijkstra's concurrent programming problem. Communications of the ACM, 17(8):453.455, August 1974. https://doi.org/10.1145/361082.361093
  13. L. Lamport. The mutual exclusion problem. Parts I&II. Journal of the ACM, 33(2):313.348, April 1986. https://doi.org/10.1145/5383.5384
  14. 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 https://doi.org/10.1109/71.862205
  15. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
  16. M. Maekawa. $\sqrt[A]{N}$ algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145.159, May 1985. https://doi.org/10.1145/214438.214445
  17. D. Manivannan and M. Singhal. An e.cient 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.