Abstract
The traditional approaches towards implementing mutual exclusion can not be applied for distributed systems where nodes are loosely coupled. The existing algorithms typically follow either a symmetric or a token based approach. While the symmetric algorithms tend to increase the network traffic, token based approach offers solutions at a lower communication cost. Raymond has designed an efficient token based mutual exclusion algorithm. However, one major limitation of Raymond’s algorithm is the lack of fairness in the sense that a token request that is generated later may be granted ahead of another request that was made earlier. In this work, we have proposed a modification of Raymond’s algorithm. The new token based algorithm not only overcomes the fairness problem, but also handles the priority of the requesting processes.
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
Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM 24(1), 9–17 (1981)
Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Transaction on Computer System 7, 61–77 (1989)
Mueller, F.: Prioritized Token-Based Mutual Exclusion for Distributed Systems. In: Proceeding of 12th Intern. Parallel Proc. Symposium and 9th Symp. on Parallel and Distributed Processing, Orlando, Florida, March 30-April 3, 1998, pp. 791–795 (1998)
Housni, A., Trehel, M.: Distributed mutual exclusion token-permission based by prioritized groups. In: Proc. of ACS/IEEE International Conference, pp. 253–259 (2001)
Suzuki, Kasami, T.: An optimality theory for mutual exclusion algorithms in computer science. In: Proc. of IEEE Int Conf erence on Dist. Comp. Syst., October 1982, pp. 365–370 (1982)
Lamport., L.: Time, Clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)
Neilsen., M., Mizuno., M.: A Dag–Based Algorithm for distributed mutual exclusion. In: Proc. of the 11th IEEE International Conference on Distributed Computing System (May 1991)
Carvalho, O.S.F., Roucairol, G.: On mutual exclusion in computer network. Communications of the ACM 26(2), 146–147 (1983)
Singhal, M.: A heuristically-aided algorithm for mutual exclusion for distributed systems. IEEE Transactions on Computers 38(5), 70–78 (1989)
Trehel, M., Naimi, M.: A distributed algorithm for mutual exclusion based on data structures and fault tolerance. In: Proc. of 6th Intl. conf. on Computers & Communication, pp. 35–39 (1987)
Bernabeu-Auban, J.M., Ahamad, M.: Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol. 392, pp. 33–44. Springer, Heidelberg (1989)
Naimi, M., Trehel, M., Arnold, A.: A log(N) distributed mutual exclusion algorithm based on path reversal. Journal of Parallel and Distributed Computing 34(1), 1–13 (1996)
Chang, Y.: Design of mutual exclusion algorithms for real-time distributed systems. Journal of Information Science and Engeneering 10, 527–548 (1994)
Goscinski, A.: Two algorithms for mutual exclusion in real-time distributed computer systems. Journal of Parallel and Distributed Computing 1, 77–82 (1990)
Suzuki, I., Kasami, T.: A distributed mutual exclusion algorithm. ACM Transactions of Computer Systems 18(12), 94–101 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kanrar, S., Chaki, N. (2006). Modified Raymond’s Algorithm for Priority (MRA-P) Based Mutual Exclusion in Distributed Systems. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds) Distributed Computing and Internet Technology. ICDCIT 2006. Lecture Notes in Computer Science, vol 4317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11951957_29
Download citation
DOI: https://doi.org/10.1007/11951957_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68379-7
Online ISBN: 978-3-540-68380-3
eBook Packages: Computer ScienceComputer Science (R0)