Abstract
This chapter presents a distributed object-transfer service that allows users at different addresses to share a set of objects. Each object is characterized by an id and a mutable value. There are three input functions at each address: a blocking function to acquire an object and get its value; a blocking function to receive a request for an object (held by the user); and a nonblocking function to release an object (held by the user) with its value. The service ensures that every acquire call eventually returns with the value it had at its last release, provided no user holds the object indefinitely. Thus a user can acquire an object, make changes to its value, and release the object when asked for it. Over time the object passes from user to user, changing its value. Other than the requirement that the value of an object when acquired be the same as at its last release, an object is just like a token.
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
M. Mizuno, M.L. Neilsen, R. Rao, A token based distributed mutual exclusion algorithm based on quorum agreements, in Proceedings of the International Conference on Distributed Computing Systems, Arlington, pp. 361–368 (1991)
M. Naimi, M. Trehel, A. Arnold, A log(n) distributed mutual exclusion algorithm based on path reversal. J. Parallel Distrib. Comput. 34(1), 1–13 (1996)
M.L. Neilsen, M. Mizuno, A dag-based algorithm for distributed mutual exclusion, in Proceedings of the International Conference on Distributed Computing Systems, Arlington, pp. 354–360 (1991)
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
P. Thambu, J. Wong, An efficient token-based mutual exclusion algorithm in a distributed system. J. Syst. Softw. 28(3), 267–276 (1995). doi:10.1016/0164-1212(94)00061-Q. http://www.sciencedirect.com/science/article/pii/016412129400061Q
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, pp. 35–39 (1987)
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). Object-Transfer Service. In: Distributed Programming. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-4881-5_15
Download citation
DOI: https://doi.org/10.1007/978-1-4614-4881-5_15
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)