Skip to main content
SpringerLink
Log in

State-of-the-Art Review

  • Chapter
  • First Online:
Concurrency Control in Distributed System Using Mutual Exclusion

Part of the book series: Studies in Systems, Decision and Control ((SSDC,volume 116))

  • 484 Accesses

Abstract

A distributed system is a collection of autonomous computers connected via a communication network. There is no common memory and processes communicate through message passing. In many applications, there are critical operations that should not be performed by different processes concurrently. It may sometimes be required that a typical resource is used by only one process at a time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Housini, A., Trehel, M.: Distributed mutual exclusion token-permission based by prioritized groups. In: Proceedings of ACS/IEEE International Conference, pp. 253–259 (2001)

    Google Scholar 

  2. Mueller, F.: Prioritized token-based mutual exclusion for distributed systems. In: Proceedings of the 9th Symposium on Parallel and Distributed Processing, pp. 791–795 (1998)

    Google Scholar 

  3. Saxena, P.C., Rai, J.: A survey of permission-based distributed mutual exclusion algorithms. Comput. Stan. Interfaces 25(2), 159–181 (2003)

    Article  Google Scholar 

  4. Helary, J.M., Mostefaoui, A., Raynal, M.: A general scheme for token and tree based distributed mutual exclusion algorithm. IEEE Trans. Parallel Distrib. Syst. 5(11), 1185–1196 (1994)

    Article  Google Scholar 

  5. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)

    Google Scholar 

  6. Madria, S.K.: Timestamp based approach for the detection and resolution of mutual conflicts in real-time distributed systems. Computer Science Technical Reports. Paper 1367, pp. 1–16 (1997)

    Google Scholar 

  7. Karnar, S., Chaki, N.: Modified Raymond’s algorithm for priority (MRA-P) based mutual exclusion in distributed systems. In: Proceedings of ICDCIT 2006. LNCS 4317, pp. 325–332 (2006)

    Google Scholar 

  8. Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7, 61–77 (1989)

    Article  Google Scholar 

  9. Mittal, N., Mohan, P.K.: A priority-based distributed group mutual exclusion algorithm when group access is non-uniform. J. Parallel Distrib. Comput. 67(7), 797–815 (2007)

    Article  MATH  Google Scholar 

  10. Walter, J.E., Welch, J.L., Vaidya, M.H.: Mutual exclusion algorithm for Ad hoc mobile networks. Wirel. Network 7(6), 585–600 (2001)

    Article  MATH  Google Scholar 

  11. Suzuki., Kasami, T.: An optimality theory for mutual exclusion algorithms in computer science. In: Proceedings of IEEE International Conference on Distributed Computing and System, pp. 365–370 (1982)

    Google Scholar 

  12. Bernabeu-Auban, J.M., Ahamad, M.: Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm, vol. 392, pp. 33–44 (1989)

    Google Scholar 

  13. Carvalho, O.S.F., Roucairol, G.: On mutual exclusion in computer network. Commun. ACM 26(2), 146–147 (1983)

    Article  Google Scholar 

  14. Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24(1), 9–17 (1981)

    Article  MathSciNet  Google Scholar 

  15. Lodha, S., Kshemkalyani, A.: A fair distributed mutual exclusion algorithm. IEEE Trans. Parallel Distrib. Syst. 11(6), 537–549 (2000)

    Article  Google Scholar 

  16. Swaroop, A., Singh, A.K.: A Distributed group mutual exclusion algorithm for soft real-time systems. In: Proceedings of World Academy of Science, Engineering and Technology, vol. 26, pp. 138–143 (2007)

    Google Scholar 

  17. Joung, Y.J.: Asynchronous group mutual exclusion. In: Proceedings of the 17th annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 51–60 (1998)

    Google Scholar 

  18. Manabe, Y., Park, J.: A quorum based extended group mutual exclusion algorithm without unnecessary blocking. In: Proceedings of 10th International Conference on Parallel and Distributed Systems (ICPADS’04) (2004)

    Google Scholar 

  19. Attreya, R., Mittal, N.: A dynamic group mutual exclusion algorithm using surrogate quorums. In: Proceedings of the 25th IEEE Conference on Distributed Computing Systems (ICDCS’05) (2005)

    Google Scholar 

  20. Lin, D., Moh, T.S., Moh, M.: Brief announcement: Improved asynchronous group mutual exclusion in token passing networks. In: Proceedings of PODC’05, pp. 275–275 (2005)

    Google Scholar 

  21. Singhal, M.: A heuristically-aided algorithm for mutual exclusion for distributed systems. IEEE Trans. Comput. 38(5), 70–78 (1989)

    Article  Google Scholar 

  22. Sanders, B.: The information structure of distributed mutual exclusion algorithm. ACM Comput. Syst. 5(3), 284–299 (1987)

    Article  Google Scholar 

  23. Singhal, M.: A dynamic information structure mutual exclusion in distributed system. IEEE Trans. Parallel. Distrib. Syst. 3(1), 121–125 (1992)

    Article  Google Scholar 

  24. Naimi, M., Trehel, M., Arnold, A.: A log(N) distributed mutual exclusion algorithm based on path reversal. J. Parallel. Distrib. Comput. 34(1), 1–13 (1996)

    Article  Google Scholar 

  25. Bertier, M., Arantes, L., Sens, P.: Hierarchical token based mutual exclusion algorithms. In: IEEE International Symposium on Cluster Computing and the Grid, pp. 539–546 (2004)

    Google Scholar 

  26. Swaroop, A., Singh, A.K.: A token-based group mutual exclusion algorithm for cellular wireless networks, In: India Conference (INDICON), pp. 1–4 (2009)

    Google Scholar 

  27. Helary J.M., Mostefaoui A.: A O(log2 n) fault-tolerant distributed mutual exclusion algorithm based on open-cube structure. In: 14th International Conference in Distributed System, pp. 89–96 (1994)

    Google Scholar 

  28. Saxena, P.C., Guptal, S.: A token-based delay optimal algorithm for mutual exclusion in distributed systems. Comput. Stan. Interfaces 21(1), 33–50 (1999)

    Article  Google Scholar 

  29. Lejeune, J., Arantes, L., Sopena, J.: A O(log2 n) fault-tolerant distributed mutual exclusion algorithm based on open-cube structure. In: 42nd International Conference of Parallel Processing (ICPP), pp. 290–299 (2013)

    Google Scholar 

  30. Chang, YI.: A dynamic request set based algorithm for mutual exclusion in distributed systems. Operating Syst. Rev. 30(2), 52–62 (1996)

    Google Scholar 

  31. Bonollo, U., Sonenberg, E.A.: Deadlock-free information structure distributed mutual exclusion algorithms. Aust. Comput. Sci. Commun. 18, 234–241 (1996)

    Google Scholar 

  32. Chang, Y.I., Singhal, M., Liu.,M.: A fault tolerant algorithm for distributed mutual exclusion. In: Ninth IEEE Symposium on Reliable Distributed Systems, pp. 146–154 (1990)

    Google Scholar 

  33. Baldoni, R., Virgillito, A., Petrassi, R.: A distributed mutual exclusion algorithm for mobile Ad-hoc networks. In: Seventh International Symposium on Computers and Communications (ISCC 2002), pp. 539–544 (2002)

    Google Scholar 

  34. Maddi, A.: Token based solutions to M resources allocation problem. In: ACM Symposium on Applied Computing, pp. 340–344 (1997)

    Google Scholar 

  35. Swaroop, A., Singh, A.K.: A token-based group mutual exclusion algorithm for cellular wireless networks. In: India Conference (INDICON-2009), pp. 1–4 (2009)

    Google Scholar 

  36. Raynal, M.: Token-based sequential consistency in asynchronous distributed systems. In: 17th International Conference on Advanced Information Networking and Applications (AINA 2003), pp. 421–426 (2003)

    Google Scholar 

  37. Mizuno, M., Neilsen, M.L., Rao, R.: A token based distributed mutual exclusion algorithm based on quorum agreements. In: ICDCS, pp. 361-368 (1991)

    Google Scholar 

  38. Meza, F., Perez, J., Eterovic, Y.: Implementing distributed mutual exclusion on multithreaded environments: The alien-threads approach. In: Advanced Distributed Systems, pp. 51–62 (2005)

    Google Scholar 

  39. Chang, Y.I., Singhal, M., Liu, M.T.: A dynamic token-based distributed mutual exclusion algorithm. In: Tenth Annual International Phoenix Conference on Computers and Communications, pp. 240–246 (1991)

    Google Scholar 

  40. Lejeune, J., Arantes, L., Sopena, J., Sens, P.: Service level agreement for distributed mutual exclusion in cloud computing. In: 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012), pp. 180–187 (2012)

    Google Scholar 

  41. Kanrar, S., Chaki, N.: FAPP: A new fairness algorithm for priority process mutual exclusion in distributed systems. Special issue on recent advances in network and parallel computing. Int. J. Networks 5(1), 11–18 (2010). ISSN: 1796-2056

    Google Scholar 

  42. Chang, Y.I.: A simulation study on distributed mutual exclusion. J. Parallel Distrib. Comput. 33(2), 107–121 (1996)

    Google Scholar 

  43. Maekawa, M.: A √n algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3(2), 145–159 (1985)

    Article  Google Scholar 

  44. Madhuram, S., Kumar, A.: A hybrid approach for mutual exclusion in distributed computing systems. In: Sixth IEEE Symposium on Parallel and Distributed Processing, pp. 18–25 (1994)

    Google Scholar 

  45. Beauquier, J., Cantarell, S., Datta, A.K., Petit, F.: Group mutual exclusion in tree networks. In: Ninth International Conference on Parallel and Distributed Systems, pp. 111–116 (2002)

    Google Scholar 

  46. Bertier, M., Arantes, L., Sens, P.: Distributed mutual exclusion algorithms for grid applications: A hierarchical approach. J. Parallel. Distrib. Comput. 66(1), 128–144 (2006)

    Article  MATH  Google Scholar 

  47. Walter, J., Cao, G., Mohanty, M.: A k-mutual exclusion algorithm for ad hoc wireless networks. In: Proceedings of the First Annual Work Shop on Principles of Mobile Computing (POMC 2001) (2001)

    Google Scholar 

  48. Kanrar, S., Choudhury, S., Chaki, N.: A link-failure resilient token based mutual exclusion algorithm for directed graph topology. In: Proceedings of the 7th International Symposium on Parallel and Distributed Computing—ISPDC 2008 (2008)

    Google Scholar 

  49. Kanrar, S., Chaki, N., Chattopadhyay, S.: A new link failure resilient priority based fair mutual exclusion algorithm for distributed systems. J. Network. Syst. Manage. (JONS) 21(1), 1–24 (2013). ISSN 1064-7570

    Google Scholar 

  50. Sil, S., Das, S.: An energy efficient algorithm for distributed mutual exclusion in mobile Ad-hoc networks. World. Acad. Sci. Eng. Technol. 64, 517–522 (2010)

    Google Scholar 

  51. Panghal, K., Rana, M.K., Kumar, P.: Minimum-process synchronous check pointing in mobile distributed systems. Int. J. Comput. Appl. 17(4), 1–4 (2011)

    Google Scholar 

  52. Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685–722 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  53. Chen, W., Lin, S., Lian, Q., Zhang, Z.: Sigma: A fault-tolerant mutual exclusion algorithm in dynamic distributed systems subject to process crashes and memory losses. Microsoft Research Technical Report MSR-TR-2005-58 (2005)

    Google Scholar 

  54. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kouznetsov, P.: Mutual exclusion in asynchronous systems with failure detectors. Technical Report in Computer and Communication Sciences, id: 200227 (2002)

    Google Scholar 

  55. Reddy, R.L.N., Gupta, B., Srimani, P.K.: A new fault tolerant distributed mutual exclusion algorithm. In: ACM/SIGAPP Symposium on Applied computing: Technological Challenges of the 1990’s, pp. 831–839 (1992)

    Google Scholar 

  56. Bouabdallah, A., Koenig, J.C.: An improvement of Maekawa’s mutual exclusion algorithm to make it fault-tolerant. Parallel Process. Let. 02n03(2), 283–290 (1992)

    Google Scholar 

  57. Chang, Y.I., Chang, Y.J.: A fault-tolerant dynamic triangular mesh protocol for distributed mutual exclusion. ACM SIGOPS Operating Syst. Rev. 31(3), 29–44 (1997)

    Article  Google Scholar 

  58. Barbara, D., Garcia-Molina, H.: Mutual exclusion in partitioned distributed systems. Distrib. Comput. 1(2), 119–132 (1986)

    Article  Google Scholar 

  59. Lotem, E.Y., Keidar, I., Dolev, D.: Dynamic voting for consistent primary components. In: 16th ACM Symposium on Principles of Distributed Computing (PODC), pp. 63–71 (1997)

    Google Scholar 

  60. Lim, J.B., Chung, K.S., Chin, S.H., Yu, H.C.: A gossip-based mutual exclusion algorithm for cloud environments. In: Advances in Grid and Pervasive Computing. Lecture Notes in Computer Science, vol. 7296, pp. 31–45 (2012)

    Google Scholar 

  61. Edmondson, J., Schmidt, D., Gokhale, A.: QoS-enabled distributed mutual exclusion in public clouds. In: On the Move to Meaningful Internet Systems: OTM 2011. Lecture Notes in Computer Science, vol. 7045, pp. 542–559 (2011)

    Google Scholar 

  62. Chang, Y.I.: A hybrid distributed mutual exclusion algorithm. Microproces. Microprogram. 41(10), 715–731 (1996)

    Article  Google Scholar 

  63. Vidyasankar, K.: A highly concurrent group mutual L-execution algorithm. Parallel Process. Let. 16(04), 467–483 (2006)

    Article  MathSciNet  Google Scholar 

  64. Atreya, R., Mittal, N., Peri, S.: A quorum-based group mutual exclusion algorithm for a distributed system with dynamic group set. IEEE Trans. Parallel Distrib. Syst. 18(10), 1345–1360 (2007)

    Google Scholar 

  65. Vidyasankar, K.: A simple group mutual l-exclusion algorithm. Inf. Process. Let. 85(2), 79–85 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  66. Atreya, R., Mittal, N.: A distributed group mutual exclusion algorithm using surrogate-quorums. In: 25th IEEE International Conference on Distributed Computing Systems, pp. 251–260 (2005)

    Google Scholar 

  67. Jayanti, P., Petrovic, S., Tan, K.: Fair group mutual exclusion. In: Twenty-Second Annual Symposium on Principles of Distributed Computing, pp. 275–284 (2003)

    Google Scholar 

  68. Takamura, M., Altman, T., Igarashi, Y.: Speedup of Vidyasankar’s algorithm for the group k-exclusion problem. Inf. Process. Let. 91(2), 85–91 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  69. Singhal, M.: A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems. Distrib. Comput. 4(3), 131–138 (1991)

    Article  MATH  Google Scholar 

  70. Li, M.A., Liu, X.S., Wang, Z.: A high performance distributed mutual exclusion algorithm based on relaxed cyclic difference set. Dianzi Xuebao (Acta Electron. Sinica) 35(1), 58–63 (2007)

    Google Scholar 

  71. Burns, J.E., Jackson, P., Lynch, N.A., Fischer, M.J., Peterson, G.L.: Data requirements for implementation of n-process mutual exclusion using a single shared variable. J. ACM (JACM) 29(1), 183–205 (1982)

    Google Scholar 

  72. Huang, S.T., Jiang, J.R., Kuo, Y.C.: K-coteries for fault-tolerant k entries to a critical section. In: ICDCS, pp. 74–81 (1993)

    Google Scholar 

  73. Joung, Y.J.: Quorum-based algorithms for group mutual exclusion. In: Distributed Computing, pp. 16–32 (2001)

    Google Scholar 

  74. Hardekopf, B., Kwiat, K., Upadhyaya, S.: A decentralized voting algorithm for increasing dependability in distributed systems. Join MEETING of the 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI 2001) and the 7th International Conference on Information System Analysis and Synthesis (ISAS 2001) (2001)

    Google Scholar 

  75. Thomas, T.H.: A majority consensus approach to concurrency control for multiple copy databases. ACM Trans.Database Syst. 4(2), 180–209 (1979)

    Article  Google Scholar 

  76. Ahmad, M., Ammar, M.H., Cheung, S.Y.: Multi-dimensional voting: A general method for implementing synchronisation in distributed systems. In: Proceedings 10th International Conference on Distributed Computer Systems, pp. 362–369 (1990)

    Google Scholar 

  77. Barbara, D., Garcia-Molina, H., Spauster, A.: Increasing availability under mutual exclusion constraints with dynamic vote reassignment. ACM Trans. Comput. Syst. 7(4), 394–428 (1989)

    Article  Google Scholar 

  78. Rabinowich, M., Lazowska, E.D.: Improving fault-tolerance and supporting partial writes in structured coterie protocols for replicated objects. In: Proceedings ACM SIGMOD, pp. 226–235 (1992)

    Google Scholar 

  79. Adam, N.R.: New dynamic voting algorithm for distributed database systems. IEEE Trans. Knowl. Data Eng. Arch. 6(3), 470–478 (1994)

    Article  Google Scholar 

  80. Xu, L., Bruck, J.: Deterministic voting in distributed systems using error-correcting codes. IEEE Trans. Parallel Distrib. Syst. 9(8), 813–824 (1998)

    Article  Google Scholar 

  81. Hardekopf, B., Kwiat, K., Upadhyaya, S.: Secure and fault-tolerant voting in distributed systems. In: IEEE Aerospace Conference (2001)

    Google Scholar 

  82. Paris, J.F., Long, D.D.E.: Efficient dynamic voting algorithms. In: Proceedings of the Fourth International Conference on Data Engineering, pp. 268–275 (1998)

    Google Scholar 

  83. Paris, J.F., Long, D.D.E.: A realistic evaluation of optimistic dynamic voting. In: Proceeding of Seventh Symposium on Reliable Distributed Systems, pp. 129–137 (1988)

    Google Scholar 

  84. Jajodia, S., Mutchler, D.: Dynamic voting algorithms for maintaining the consistency of a replicated data. ACM Trans. Database Syst. 15(2), 230–280 (1990)

    Article  Google Scholar 

  85. Agrawal, D., El Abbadi, A.: An efficient and fault tolerant solution for distributed mutual exclusion. ACM Trans. Comput. Syst. 9(1), 1–20 (1991)

    Google Scholar 

  86. Zarafshan, F., Karimi, A., Al-Haddad, S.A.R., Saripan, M.I., Subramaniam, S.: A preliminary study on ancestral voting algorithm for availability improvement of mutual exclusion in partitioned distributed systems. In: Proceedings of International Conference on Computers and Computing (ICCC’11), pp. 61–69 (2011)

    Google Scholar 

  87. Garcia-Molina, H., Barbara, D.: How to assign votes in a distributed system. J. Assoc. Comput. Mach. 32(4), 841–860 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  88. Tong, Z., Kain, R.Y.: Vote assignments in weighted voting mechanisms. In: Seventh Symposium on Reliable Distributed Systems, pp. 138–143 (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Narasinha Dutt College, Howrah, West Bengal, India

    Sukhendu Kanrar

  2. Department of Computer Science & Engineering, University of Calcutta, Kolkata, West Bengal, India

    Nabendu Chaki

  3. Department of Information Technology, Jadavpur University, Kolkata, West Bengal, India

    Samiran Chattopadhyay

Authors
  1. Sukhendu Kanrar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nabendu Chaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Samiran Chattopadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sukhendu Kanrar .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this chapter

Cite this chapter

Kanrar, S., Chaki, N., Chattopadhyay, S. (2018). State-of-the-Art Review. In: Concurrency Control in Distributed System Using Mutual Exclusion. Studies in Systems, Decision and Control, vol 116. Springer, Singapore. https://doi.org/10.1007/978-981-10-5559-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-5559-1_2

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-5558-4

  • Online ISBN: 978-981-10-5559-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation