Abstract
This paper presents a non-token-based algorithm for mutual exclusion in distributed systems in which sites communicate with other sites by message passing. The Ricart–Agrawala algorithm is one of the mutual exclusion algorithms for a distributed system. This algorithm uses message passing concept to decide which site will execute the Critical Section. This algorithm is a modified version of Lamport mutual exclusion algorithm that takes 3(n − 1) numbers of messages to enter into the CS for any site, where n is the number of sites. Ricart–Agrawala algorithm requires 2(n − 1) messages per Critical Section execution. In our proposed algorithm, the number of messages required for any site to enter into the CS will always be less than the number of messages required in Ricart–Agrawala algorithm. We have reduced the number of messages by cleverly removing the number of reply messages for a site that has already executed the CS.
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
Similar content being viewed by others
References
Guohong Cao, A delay-optimal quorum-based mutual exclusion algorithm for distributed system. Parallel Distrib. Syst. 12(12), 1256–1267 (2001)
K. Raymond, A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7, 61–77 (1989)
M. Singhal, N. Shivaratri, in Advanced Concepts in Operating Systems: Distributed, Database and Multiprocessor Operating Systems (Tata McGraw Hill, 2001)
N. Naimi, M. Trehel, A. Arnold, A log(n) distributed mutual exclusion algorithm based on path reversal. J. Parallel Distrib. Comput. 34, 1–13 (1996)
G. Ricart, A.K. Agrawala, An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24(1), 9–17 (1981)
S. Lodha, A. Kshemkalyani, A fair distributed mutual exclusion algorithm. Parallel Distrib. Syst. 11(6), 537–548 (2000)
M. Naimi, M. Trehel, An improvement of the log n distributed algorithm for mutual exclusion. ICDS 371–377 (1987)
J.-M. Helary, A. Mostefaoui, A o(log2 n) fault-tolerant distributed mutual exclusion algorithm based on open-cube structure. ICDCS 89–96 (1994)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Maurya, A.K., Kumar, A., Mishra, A.K., Kumar, B., Vishwakarma, P. (2019). Distributed Mutual Exclusion Algorithm with Improved Performance. In: Krishna, C., Dutta, M., Kumar, R. (eds) Proceedings of 2nd International Conference on Communication, Computing and Networking. Lecture Notes in Networks and Systems, vol 46. Springer, Singapore. https://doi.org/10.1007/978-981-13-1217-5_91
Download citation
DOI: https://doi.org/10.1007/978-981-13-1217-5_91
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1216-8
Online ISBN: 978-981-13-1217-5
eBook Packages: EngineeringEngineering (R0)