Abstract
The Ricart-Agrawala protocol [1] is one of the classical solutions to mutual exclusion problem. Although, the protocol was invented, essentially, for failure free static distributed systems, it has been adapted by various researchers for almost all changing computing paradigms from classical to contemporary. The purpose of the article is to highlight the strength of the concept used in the Ricart-Agrawala protocol.
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.: An Optimal Algorithm for Mutual Exclusion in Computer Networks. Communications of the ACM 24, 9–17 (1981)
Lamport, L.: Time, Clocks and Ordering of Events in Distributed Systems. Communications of the ACM 21, 558–565 (1978)
Singhal, M., Manivannan, D.: A Distributed Mutual Exclusion Algorithm for Mobile Computing Environments. In: International Conference on Intelligent Information Systems, pp. 557–561. IEEE Press, New York (1997)
Wu, W., Cao, J., Yang, J.: A Fault Tolerant Mutual Exclusion Algorithm for Mobile Ad Hoc Networks. Pervasive and Mobile Computing 4, 139–160 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sharma, B., Bhatia, R.S., Singh, A.K. (2011). On the Potential of Ricart-Agrawala Algorithm in Mobile Computing Environments. In: Mantri, A., Nandi, S., Kumar, G., Kumar, S. (eds) High Performance Architecture and Grid Computing. HPAGC 2011. Communications in Computer and Information Science, vol 169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22577-2_58
Download citation
DOI: https://doi.org/10.1007/978-3-642-22577-2_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22576-5
Online ISBN: 978-3-642-22577-2
eBook Packages: Computer ScienceComputer Science (R0)