Abstract
This chapter presents a distributed lock service, that is, a lock whose users may be spread over different locations (e.g., users at different computers of a network). At each location there is an access system through which users access the lock. (In contrast, SimpleLockService (in Chap. 2) is centralized because all users access the service at one system.)
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
References
S. Banerjee, P. Chrysanthis, A new token passing distributed mutual exclusion algorithm. Int. Conf. Distrib. Comput. Syst. 0, 717 (1996). doi:http://doi.ieeecomputersociety.org/10.1109/ICDCS.1996.508024
D. Ginat, A.U. Shankar, An assertional proof of correctness and serializability of a distributed mutual exclusion algorithm based on path reversal. Technical report, University of Maryland, Computer Science Department, 1988. CSTR-2104
L. Lamport, Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978). doi:10.1145/359545.359563. http://doi.acm.org/10.1145/359545.359563
M. Maekawa, A \(\sqrt{n}\) algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3(2), 145–159 (1985). doi:10.1145/214438.214445. http://doi.acm.org/10.1145/214438.214445
M. Mizuno, M.L. Neilsen, R. Rao, A token based distributed mutual exclusion algorithm based on quorum agreements, in Proceedings of International Conference on Distributed Computing Systems (IEEE, LosAlamitos, 1991), pp. 361–368
M.L. Neilsen, M. Mizuno, A dag-based algorithm for distributed mutual exclusion, in Proceedings of International Conference on Distributed Computing Systems (IEEE, LosAlamitos, 1991), pp. 354–360
G. Ricart, A.K. Agrawala, An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24(1), 9–17 (1981). doi:10.1145/358527.358537. http://doi.acm.org/10.1145/358527.358537
I. Suzuki, T. Kasami, A distributed mutual exclusion algorithm. ACM Trans. Comput. Syst. 3(4), 344–349 (1985). doi:10.1145/6110.214406. http://doi.acm.org/10.1145/6110.214406
M. Trehel, M. Naimi, A distributed algorithm for mutual exclusion based on data structures and fault tolerance, in 6th Annual International Phoenix Conference on Computers and Communication, Scottsdale, 1987, pp. 35–39
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Shankar, A.U. (2013). Distributed Lock Service. In: Distributed Programming. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-4881-5_11
Download citation
DOI: https://doi.org/10.1007/978-1-4614-4881-5_11
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-4880-8
Online ISBN: 978-1-4614-4881-5
eBook Packages: Computer ScienceComputer Science (R0)