TY - JOUR
T1 - Accessing nearby copies of replicated objects in a distributed environment
AU - Plaxton, C. G.
AU - Rajaraman, R.
AU - Richa, Andrea
N1 - Funding Information:
∗ A preliminary version of this paper appeared in the Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 311–320, June 1997. The first author was supported by the National Science Foundation under Grant No. CCR-9504145. Part of this work was done when the second author was at the University of Texas at Austin, with support from the National Science Foundation under Grant No. CCR-9504145, and when he was at DIMACS Center, Rutgers University. DIMACS is an NSF Science and Technology Center, funded under Contract STC-91-19999 and partially supported by the New Jersey Commission on Science and Technology. Part of this work was done while the third author was at Carnegie Mellon University, supported by National Young Investigator Award under Grant No. CCR-94-57766, and ARPA Contract F33615-93-1-1330.
PY - 1999
Y1 - 1999
N2 - Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as efficient utilization of network resources, it is desirable that each access request be satisfied by a copy "close" to the requesting node. Unfortunately, it is not clear how to achieve this goal efficiently in a dynamic, distributed environment in which large numbers of objects are continuously being created, replicated, and destroyed. In this paper we design a simple randomized algorithm for accessing shared objects that tends to satisfy each access request with a nearby copy. The algorithm is based on a novel mechanism to maintain and distribute information about object locations, and requires only a small amount of additional memory at each node.
AB - Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as efficient utilization of network resources, it is desirable that each access request be satisfied by a copy "close" to the requesting node. Unfortunately, it is not clear how to achieve this goal efficiently in a dynamic, distributed environment in which large numbers of objects are continuously being created, replicated, and destroyed. In this paper we design a simple randomized algorithm for accessing shared objects that tends to satisfy each access request with a nearby copy. The algorithm is based on a novel mechanism to maintain and distribute information about object locations, and requires only a small amount of additional memory at each node.
UR - http://www.scopus.com/inward/record.url?scp=0033433272&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0033433272&partnerID=8YFLogxK
U2 - 10.1007/s002240000118
DO - 10.1007/s002240000118
M3 - Article
AN - SCOPUS:0033433272
SN - 1432-4350
VL - 32
SP - 241
EP - 280
JO - Theory of Computing Systems
JF - Theory of Computing Systems
IS - 3
ER -