A survey of permission-based distributed mutual exclusion algorithms

Computer Standards and Interfaces

Volumn 25, Issue 2, 2003, Pages 159-181

  Saxena, P C ^a   Rai, Jagmohan ^b,c  

^a JAWAHARLAL NEHRU UNIVERSITY   (India)

^b UNIVERSITY OF DELHI   (India)

^c SFS Flats ^*  (India)

Author keywords

Coteries; Distributed systems; K Mutual exclusion; Mutual exclusion; Voting

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER NETWORKS; PROBLEM SOLVING;

EXCLUSION ALGORITHMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0037402303     PISSN: 09205489     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0920-5489(02)00105-8     Document Type: Article

References (100)

1. Kumar A. Hierarchical quorum consensus: a new algorithm for managing replicated data. IEEE Transactions on Computers. 40(9):1991;996-1004.
2. Agrawal D., Abbadi A.El. An efficient and fault tolerant solution for distributed mutual exclusion. ACM Transactions on Computer Systems. 9(1):1991;1-20.
3. Agrawal D., Abbadi A.El. The generalized tree quorum protocol: an efficient approach for managing replicated data. ACM Transactions on Database Systems. 17(4):1992;689-717.
4. Ahmad M., Ammar M.H., Cheung S.Y. Multi-dimensional voting. ACM Transactions on Computer Systems. 9(4):1991;399-431.
5. Ahmad M., Ammar M.H., Cheung S.Y. Replicated data management in distributed systems. Readings in Distributed Computing Systems. 1994;572-591 IEEE Computer Society Press, Los Alamitos, CA.
6. Kumar A., Cheung S.Y. A high availability √N hierarchical grid algorithm for replicated data. Information Processing Letters. 40:1991;311-316.
7. Agrawal D., Egecioglu Ö., Abbadi A.E. Analysis of quorum-based protocols for distributed (k+1)-exclusion. IEEE Transactions on Parallel and Distributed Systems. 1(5):1997, (May);533-537.
8. Agrawal D., Egecioglu Ö., Abbadi A.El. Billiard quorums on the grid. Information Processing Letters. 64:1997;9-16.
9. Amir Y., Wool A. Optimal availability quorum systems: theory and practice. Information Processing Letters. 65:1998;223-228.
10. Bacon J. Concurrent Systems. 2nd ed. 1998;Addison Wesley, Harlow, England.
11. De Bruijn J.G. Additional comments on a problem in concurrent programming control. Communications of the ACM. 10(3):1967;137-138.
12. Bernstein P.A., Goodman N. An algorithm for concurrency control and recovery for replicated database. ACM Transactions on Database Systems. 9(4):1984;596-615.
13. Barbara D., Garcia-Molina H. The vulnerability of vote-assignments. ACM Transactions on Computer Systems. 4(3):1986;187-213.
14. Barbara D., Garcia-Molina H. The reliability of voting mechanisms. IEEE Transactions on Computers. c-36(10):1987;1197-1208.
15. Barbara D., Garcia-Molina H., Spauster A. Increasing availability under mutual exclusion constraints with dynamic vote reassignment. ACM Transactions on Computer Systems. 7(4):1989;394-428.
16. Bioch J.C., Ibaraki T. Generating and approximating non-dominated coteries. IEEE Transactions on Parallel and Distributed Systems. 6(9):1995;905-914.
17. Bonollo U., Sonenberg E.A. Deadlock-free information structure distributed mutual exclusion algorithms. Australian Computer Science Communications (ACSC'96). 18(1):1996;234-241.
18. Bernstein P.A., Shipman D.W., Wong W.S. Formal aspects of serializability in database concurrency control. IEEE Transactions on Software Engineering SE. 5(3):1979;203-216.
19. Chang Y.I. A simulation study on distributed mutual exclusion. Journal of Parallel Distributed Computing. 33:1996;107-121.
20. Cheung S.Y., Ahmad M., Ammar M.H. Optimizing vote and quorum assignments for reading and writing replicated data. IEEE Transactions on Knowledge and Data Engineering. 1(3):1989;387-397.
21. Cheung S.Y., Ammar M.H., Ahamad M. The grid protocol: a high performance scheme for maintaining replicated data. IEEE Transactions on Knowledge and Data Engineering. 4(6):1992;582-592.
22. Chang Y.I., Chen B.H. A generalized grid quorum strategy for k-mutual exclusion in distributed systems. Information Processing Letters. 80(4):2001, (Nov. 30);205-212.
23. Coulouris G., Dollimore J., Kindberg T. Distributed Systems: Concepts and Design. 2nd ed. 1994;Addison Wesley, Harlow, England.
24. Carvalho O.S.F., Roucairol C. On the mutual exclusion in computer networks. Communications of the ACM. 26(2):1983;146-147.
25. Cao G., Singhal M., Deng Y., Rishe N., Sun W. A delay-optimal quorum-based mutual exclusion scheme with fault-tolerance capability. Proceedings of the 18th International Conference on Distributed Computing Systems (ICDCS'98):1998;444-451 IEEE Computer Society, Amsterdam.
26. Chang Y.I., Singhal M., Liu M.T. An improved o(log(n)) mutual exclusion algorithm for distributed systems. International Conference on Parallel Processing. 1990;295-302.
27. Choi E.H., Tsuchiya T., Kikuno T. On the availability of k-coteries in networks with unreliable nodes and links. Proceedings of the Fourth International Workshop on Object-Oriented Real-Time Dependable Systems, Jan. 1999:1999, (January);148-155 IEEE, Santa Barbara, California.
28. Choi E.H., Tsuchiya T., Kikuno T. New constructions for nondominated k-coteries. IEICE Transactions on Information and Systems. E83D(7):2000, (Jul.);1526-1532.
29. Dijkstra E.W. Co-operating sequential processes. Genuys F. Programming Languages. 1965;43-112 Academic Press, New York.
30. Davidson S.B., Garcia-Molina H., Skeen D. Consistency in partitioned networks. Computing Surveys. 17(3):1985;341-369.
31. Diks K., Kranakis E., Krizanc D., Mans B., Pelc A. Optimal coteries and voting schemes. Information Processing Letters. 51:1994;1-6.
32. Eisenberg M.A., McGuire M.R. Further comments on Dijkstra's concurrent programming control problem. Communications of the ACM. 15(11):1972;999.
33. Fu A.W. Delay optimal quorum consensus for distributed systems. IEEE Transactions on Parallel and Distributed Systems. 8(1):1997;59-69.
34. Fujita S. A quorum based k-mutual exclusion by weighted k-quorum systems. Information Processing Letters. 67(4):1998, (Aug. 31);191-197.
35. A.W. Fu, M.H. Wong, T.W. Lau, G.F. Ng, Cost Optimal Coteries. Technical Report CS-TR-94-07, Chinese University of Hong Kong (1994).
36. Gifford D.K. Weighted voting for replicated data. Proceedings of 7th Symposium on Operating Systems. 1979;150-162 ACM, New York.
37. Gupta S., Delay optimal mutual exclusion algorithms in distributed systems. PhD Thesis, School of Computer and Systems Sciences, Jawahar Lal Nehru University, New Delhi, 1998.
38. Garcia-Molina H., Barbara D. How to assign votes in a distributed system. Journal for the Association for Computing Machinery. 32(4):1985;841-860.
39. Helary M., Mostefaoui A., Raynal M. A general scheme for token and tree based distributed mutual exclusion algorithms. IEEE Transactions on Parallel and Distributed Systems. 5(11):1994;1185-1196.
40. Helary M., Plouzeau N., Raynal M. A distributed algorithm for mutual exclusion in an arbitrary network. The Computer Journal. 31(4):1988;289-295.
41. Harada T., Yamashita M. Non-dominated Coteries on Graphs. IEEE Transactions on Parallel and Distributed Systems. 8(6):1997;667-672.
42. Harada T., Yamashita M. Coterie join operation and tree structured k-coteries. IEEE Transactions on Parallel and Distributed Systems. 12(9):2001, (September);865-874.
43. Ibaraki T., Kameda T. A theory of coteries: mutual exclusion in distributed systems. IEEE Transactions on Parallel and Distributed Systems. 4(7):1991;779-793.
44. Ibaraki T., Nagamochi H., Kameda T. Optimal coteries for rings and related networks. Distributed Computing. 8:1995;191-201.
45. Jiang J.-R., Huang S.-T., Kuo Y.-C. Cohorts structures for fault-tolerant k entries to a critical section. IEEE Transactions on Computers. 46(2):1997, (Feb.);222-228.
46. Jajodia S., Mutchler D. Dynamic voting algorithms for maintaining the consistency of a replicated data. ACM Transactions on Database Systems. 15(2):1990;230-280.
47. Knuth D.E. Additional comments on a problem in concurrent programming control. Communications of the ACM. 9(5):1966;321-322.
48. Kuo Y.C. k-arbiter join operation. Journal of Information Science and Engineering. 17(4):2001, (Jul.);615-631.
49. Kuo Y.-C. Composite k-arbiters. IEEE Transactions on Parallel and Distributed Systems. 12(11):2001, (November);1134-1145.
50. Kakugawa H., Fujita S., Yamashita M., Ae T. Availability of k-coterie. IEEE Transactions on Computers. 42(5):1993, (May);553-558.
51. Kakugawa H., Fujita S., Yamashita M., Ae T. A distributed k-mutual exclusion algorithm using k-coterie. Information Processing Letters. 49:1994;213-218.
52. Kuo Y., Huang S. A simple scheme to construct k-coteries with. O( N ) uniform quorum sizes Information Processing Letters. 59:1996;31-36.
53. Kuo Y., Huang S. A geometric approach for constructing coteries and k-coteries. IEEE Transactions on Parallel and Distributed Systems. 8(4):1997, (April);402-411.
54. Kuo Y., Huang S. Recognizing ND-coteries and wr-coteries by availability. IEEE Transactions on Parallel and Distributed Systems. 9(8):1998;721-728.
55. Kobayashi N., Tsuchiya T., Kikuno T. Minimizing the mean delay of quorum-based mutual exclusion schemes. The Journal of Systems and Software. 58:2001;1-9.
56. Lamport L. Time, clocks and the ordering of events in a distributed computing. Communications of the ACM. 21(7):1978;558-565.
57. Lamport L., Shostak R., Paese M. Byzantine generals problem. ACM Transactions on Programming Languages and Systems. 4(3):1982;382-401.
58. Luk W., Wong T. Two new quorum based algorithms for distributed mutual exclusion. Proceedings of the 17th International Conference on Distributed Computing Systems, USA, ICDCS' 97. 1997, (May);100-106 IEEE, Baltimore, MD, USA.
59. Maekawa M. A √N algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems. 3(2):1985;145-159.
60. Mullender S. Distributed Systems. 2nd ed. 1993;Addison-Wesley, Harlow, England.
61. Manabe Y., Baldoni R., Raynal M., Aoyagi S. k-Arbiter: a safe and general scheme for h-out of-k mutual exclusion. Theoretical Computer Science. 193(1-2):1998, (Feb.);97-112.
62. Neilsen M.L. Properties of nondominated k-coteries. Journal of Systems and Software. 37(1):1997, (Apr.);91-96.
63. Neilson L.N., Mizuno M. A DAG based algorithm for distributed mutual exclusion. International Conference on Distributed Computer Systems. 1991;354-360.
64. Neilson L.N., Mizuno M. Coteries join algorithm. IEEE Transactions on Parallel and Distributed Systems. 3(5):1992;582-590.
65. Neilsen M.L., Mizuno M. Nondominated k-coteries for multiple mutual exclusion. Information Processing Letters. 50:1994;247-252.
66. Naimi M., Trehel M., Arnold A. A log(n) distributed mutual exclusion algorithm based on path reversal. Journal of Parallel and Distributed Computing. 34:1996;1-13.
67. Öhring S., Das S.K. Folded Petersen cube networks: new competitors for the hypercubes. IEEE Transactions on Parallel and Distributed Systems. 7(2):1996;151-168.
68. Peterson G.L. Myths about the mutual exclusion problem. Information Processing Letters. 12(3):1981;115-116.
69. Peleg D., Wool A. The availability of quorum systems. Information and Computation. 123:1995;210-223.
70. Raynal M. Algorithms for Mutual Exclusion. 1986;North Oxford Academic, London.
71. Raymond K. A distributed algorithm for multiple entries to a critical section. Information Processing Letters. 30:1989;189-193.
72. Raymond K. A tree based algorithm for distributed mutual exclusion algorithms. ACM Transactions on Computer Systems. 7(1):1989;61-77.
73. Raynal M. A simple taxonomy for distributed mutual exclusion algorithms. ACM Operating Systems Review. 23(2):1991;47-51.
74. Ricart G., Agrawala A.K. An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM. 24(1):1981;9-17.
75. Rabinowich M., Lazowska E.D. Improving fault-tolerance and supporting partial writes in structured coterie protocols for replicated objects. Proceedings ACM SIGMOD. 1992;226-235.
76. Rangarajan S., Setia S., Tripathi S.K. A fault-tolerant algorithm for replicated data management. IEEE Transactions on Parallel and Distributed Systems. 6(12):1995;1271-1282.
77. Sanders B.A. The information structure of distributed mutual exclusion algorithms. ACM Transactions on Computer Systems. 5(3):1987;284-299.
78. Singhal M. A heuristically aided algorithm for mutual exclusion in distributed systems. IEEE Transactions on Computers. 38(8):1989;651-661.
79. Singhal M. A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems. Distributed Computing. 4:1991;131-138.
80. Singhal M. A dynamic information-structure mutual exclusion algorithm for distributed systems. IEEE Transactions on Parallel and Distributed Systems. 3(1):1992;121-125.
81. Singhal M. A taxonomy of distributed mutual exclusion. Journal of Parallel and Distributed Computing. 18:1993;94-101.
82. Son S.H. Synchronization of replicated data in distributed systems. Information Systems. 12(20):1987;191-202.
83. Spasojevic M., Berman P. Voting as the optimal static pessimistic scheme for managing replicated data. IEEE Transactions on Parallel and Distributed Systems. 5(1):1994;64-73.
84. Saxena P.C., Gupta S. A performance comparison of token and tree based mutual exclusion algorithms on chordal rings. Journal of Networks and Computer Applications. 21:1998;187-201.
85. Saxena P.C., Gupta S. A token-based delay optimal algorithm for mutual exclusion in distributed systems. Computer Standards and Interfaces. 21:1999;33-50.
86. Silberschatz A., Galvin P. Operating System Concepts. 5th ed. 1998;Addison-Wesley, Harlow, England.
87. Saxena P.C., Gupta S., Rai J. Delay optimal coteries on regular symmetric networks. Computer Standards and Interfaces. 23:2001;341-353.
88. P.C. Saxena S. Gupta, J. Rai, A delay optimal coterie on the k-dimensional folded Petersen Graph. Appearing.
89. Suzuki I., Kasami T. A distributed mutual exclusion algorithm. ACM Transactions on Computer Systems. 3(4):1985;344-349.
90. Srimani P.K., Reddy R.L.N. Another distributed algorithm for multiple entries to a critical section. Information Processing Letters. 41:1992;51-57.
91. P.C. Saxena, J. Rai, Communication Cost of k-coteries, submitted for publication.
92. P.C. Saxena, J. Rai, Cross Product of Coteries, submitted for publication.
93. Schlichting R., Schneider F. Fail-stop processors: an approach to designing fault-tolerant computing systems. ACM Transactions on Computer Systems. 1(3):1983, (August);222-238.
94. Thomas T.H. A majority consensus approach to concurrency control. ACM Transactions on Database Systems. 4(2):1979;180-209.
95. Tong Z., Kain R.Y. Vote assignments in weighted voting mechanisms. Proceedings of 7th IEEE Symposium on Reliable Distributed Systems, SRDS' 88, Ohio State University, Columbus, Ohio, USA. 1988;138-143 IEEE Computer Society Press.
96. Tsuchiya T., Kikuno T. Availability evaluation of quorum-based mutual exclusion schemes in general topology networks. The Computer Journal. 42(7):1999;613-622.
97. Tsuchiya T., Yamaguchi M., Kikuno T. Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion. IEEE Transactions on Parallel and Distributed Systems. 10(4):1999;337-345.
98. Yuan S.-M., Chang H.-K. Comments on availability of k-coterie. IEEE Transactions on Computers. 43(12):1994;1457.
99. Yamashita M., Kameda T. Modeling k-coteries by well-covered graphs. Networks. 34(3):1999, (Oct.);221-228.
100. Yan Y., Zhang X., Yang H. A fast token chasing mutual exclusion algorithm in arbitrary network topologies. Journal of Parallel and Distributed Computing. 35:1996;156-172.