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 \(\Diamond P\). The paper shows that at any environment, the problem is solvable with M*.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Delporte-Gallet, C., Fauconnier, H.: The weakest Failure Detector to Solve certain Fundamental Problems in Distributed computing. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. ACM, New York (2004)
Agrawal, D., Abbadi, A.E.: An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Transactions on Computer Systems 9(1), 1–20 (1991)
Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM 43(4), 685–722 (1996)
Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)
Chockler, G., Malkhi, D., Reiter, M.K.: Backo. protocols for distributed mutual exclusion and ordering. In: Proceedings of the 21st International Conference on Distributed Computing Systems, ICDCS 2001 (April 2001)
Dijkstra, E.W.: Solution of a problem in concurrent programming control. Communications of the ACMÂ 8(9), 569 (1965)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(3), 374–382 (1985)
Gafni, E., Mitzenmacher, M.: Analysis of timing-based mutual exclusion with random times. SIAM Journal on Computing 31(3), 816–837 (2001)
Hadzilacos, V.: A note on group mutual exclusion. In: 20th ACM SIGACTSIGOPS Symposium on Principles of Distributed Computing (August 2001)
Joung, Y.-J.: Asynchronous group mutual exclusion. In: 17th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 51–60 (June 1998)
Keane, P., Moir, M.: A simple local-spin group mutual exclusion algorithm. IEEE Transactions on Parallel and Distributed Systems 12(7), 673–685 (2001)
Lamport, L.: A new solution of Dijkstra’s concurrent programming problem. Communications of the ACM 17(8), 453–455 (1974)
Lamport, L.: The mutual exclusion problem. Parts I&II. Journal of the ACM 33(2), 313–348 (1986)
Lodha, S., Kshemkalyan, A.D.: A fair distributed mutual exclusion algorithm. IEEE Transactions on Parallel and Distributed Systems 11(6), 537–549 (2000)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers (1996)
Maekawa, M.: A√N algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems 3(2), 145–159 (1985)
Manivannan, D., Singhal, M.: An efficient fault-tolerant mutual exclusion algorithm for distributed systems. In: Proceedings of the ISCA International Conference on Parallel and Distributed Computing Systems, pp. 525–530 (October 1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, SH., Lee, SH. (2011). Quorum Based Mutual Exclusion in Asynchronous Systems with Unreliable Failure Detectors. In: Kim, Th., et al. Grid and Distributed Computing. GDC 2011. Communications in Computer and Information Science, vol 261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27180-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-27180-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27179-3
Online ISBN: 978-3-642-27180-9
eBook Packages: Computer ScienceComputer Science (R0)