A Novel Symmetric Algorithm for Process Synchronization in Distributed Systems

  • Sourasekhar Banerjee
  • Prasita Mukherjee
  • Sukhendu Kanrar
  • Nabendu Chaki
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 88)

Abstract

While symmetric mutual exclusion algorithms are easy to implement, message complexity per critical section (CS) access to such approaches in a distributed system is typically high. There exist works that handle this issue but to a limited extent. In this paper, we propose a new symmetric algorithm for mutual exclusion. The proposed approach is essentially a prioritized version of the well-known Ricart–Agrawala algorithm for mutual exclusion in distributed systems. The solution proposed uses one or more priority levels, such that different participating processes are placed at different priority levels depending on the initial priority of the processes. The proposed algorithm maintains safety, liveness, and fairness properties toward implementation in a distributed system.

Keywords

Mutual exclusion Critical section Symmetric Distributed system Priority Permission based Progress condition 

References

  1. 1.
    Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24(1), 9–17 (1981)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)Google Scholar
  3. 3.
    Lodha, S., Kshemkalyani, A.: A fair distributed mutual exclusion algorithm. IEEE Trans. Parallel Distrib. Syst. 11(6), 537–549 (2000)CrossRefGoogle Scholar
  4. 4.
    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. Netw. 5(1), 11–18 (2010). ISSN 1796-2056Google Scholar
  5. 5.
    Raymond, Kerry.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7(1), 61–77 (1989)CrossRefGoogle Scholar
  6. 6.
    Lejeune, J., Arantes, L., Sopena, J., Sens, P.: Service level agreement for distributed mutual exclusion in cloud computing. In: 12th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing (CCGRID’12) (2012)Google Scholar
  7. 7.
    Lejeune, J., Arantes, L., Sopena, J., Sens, P.: A fair starvation-free prioritized mutual exclusion algorithm for distributed system. J. Parallel Distrib. Comput. (2015)Google Scholar
  8. 8.
    Swaroop, A., Singh, A.K.: A distributed group mutual exclusion algorithm for soft real-time systems. Proc. World Acad. Sci. Eng. Technol. 26, 138–143 (2007)Google Scholar
  9. 9.
    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
  10. 10.
    Housini, A., Trehel, M.: Distributed mutual exclusion token-permission based by prioritized groups. In Proceedings of the ACS/IEEE International Conference, pp. 253–259 (2001)Google Scholar
  11. 11.
    Maekawa, M.: A √N algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3(2), 145–159 (1985)CrossRefGoogle Scholar
  12. 12.
    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
  13. 13.
    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)Google Scholar
  14. 14.
    Kanrar, S., Chaki, N., Chattopadhyay, S.: A new hybrid mutual exclusion algorithm in absence of majority consensus. In: Proceedings of the 2nd International Doctoral Symposium on Applied Computation and security System, ACSS (2015)Google Scholar
  15. 15.
    Singhal, M.: A heuristically-aided algorithm for mutual exclusion for distributed systems. IEEE Trans. Comput. 38(5), 70–78 (1989)CrossRefGoogle Scholar
  16. 16.
    Naimi, M., Thiare, O.: Distributed mutual exclusion based on causal ordering. J. Comput. Sci., 398–404 (2009). ISBN: 1549–3636Google Scholar
  17. 17.
    Suzuki, I., Kasami, T.: A distributed mutual exclusion algorithm. ACM Trans. Comput. Syst. (TOCS) 3(4), 344–349 (1985)CrossRefGoogle Scholar
  18. 18.
    Sayani, 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

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • Sourasekhar Banerjee
    • 1
  • Prasita Mukherjee
    • 2
  • Sukhendu Kanrar
    • 3
  • Nabendu Chaki
    • 1
  1. 1.Department of Computer Science & EngineeringUniversity of CalcuttaSalt Lake City, KolkataIndia
  2. 2.Computer Science and Engineering, core 2, Academic complexIIT GuwahatiGuwahatiIndia
  3. 3.Department of Computer ScienceNarasinha Dutt CollegeHowrahIndia

Personalised recommendations