C. Greg Plaxton, Rajmohan Rajaraman, Andrea W. Richa  Home/Search
Context Related
Links: ACM DBLP | utexas.edu/users/rraj/Pubs/access.ps utexas.edu/pub/techrepor...tr9711.ps.Z utexas.edu/users/plaxton/html...spaa.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: utexas.edu/users/rraj/papers (more) From: utexas.edu/users/plaxton/ht...abc (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 efficiently achieve this goal in a dynamic, distributed environment in which large numbers of objects are continuously being created,... (Update)
Cited by: More
Active and Concurrent Topology Maintenance - Xiaozhou Li Jayadev (Correct)
Concurrent Maintenance of Rings - Xiaozhou Li Jayadev (Correct)
On Name Resolution in Peer-to-Peer Networks - Xiaozhou Li Greg (Correct)
Similar documents (at the sentence level):
55.3%: Accessing Nearby Copies of Replicated Objects in a.. - Plaxton, Rajaraman.. (1997) (Correct)
Active bibliography (related documents): More All
0.6: Sharing Resources in Distributed Systems - Rajaraman (1997) (Correct)
0.1: Exploiting Locality for Data Management in Systems .. - Maggs, der Heide, .. (1997) (Correct)
0.0: Fast Fault-Tolerant Concurrent Access to Shared Objects - Greg Plaxton Rajmohan (1996) (Correct)
Similar documents based on text: More All
0.2: A Data Tracking Scheme for General Networks - Rajmohan Rajaraman Andr'ea (2001) (Correct)
0.0: Tight Analyses of Two Local Load Balancing Algorithms - Ghosh, Leighton, Maggs.. (1995) (Correct)
0.0: On Contention Resolution Protocols and Associated.. - Mackenzie Boise State (1994) (Correct)
Related documents from co-citation: More All
65: Chord: A scalable peer-to-peer lookup service for Internet applications - Stoica, Morris et al. - 2001
64: A scalable content-addressable network - Ratnasamy, Francis et al. - 2001
44: OceanStore: An Architecture for Global-Scale Persistent Storage - Kubiatowicz - 2000
BibTeX entry: (Update)
C. Plaxton, R. Rajaram, and A. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 311--320, June 1997. http://citeseer.ist.psu.edu/plaxton97accessing.html More
@inproceedings{ plaxton97accessing,
author = "C. Greg Plaxton and Rajmohan Rajaraman and Andrea W. Richa",
title = "Accessing Nearby Copies of Replicated Objects in a Distributed Environment",
booktitle = "{ACM} Symposium on Parallel Algorithms and Architectures",
pages = "311-320",
year = "1997",
url = "citeseer.ist.psu.edu/plaxton97accessing.html" }
Citations (may not include all citations):442 Concrete Mathematics (context) - Graham, Knuth et al. - 1989 ACM
245 A measure of the asymptotic efficiency for tests of a hypoth.. (context) - Chernoff - 1952
196 How to emulate shared memory (context) - Ranade - 1991 ACM DBLP
185 Distributed Systems (context) - Mullender - 1993 ACM DBLP
106 Locating nearby copies of replicated Internet servers - Guyton, Schwartz - 1995 ACM DBLP
104 Sparse partitions (context) - Awerbuch, Peleg - 1990
101 Competitive algorithms for distributed data management - Bartal, Fiat et al. - 1992 ACM DBLP
81 Efficient PRAM simulation on a distributed memory machine - Karp, Luby et al. - 1992 ACM DBLP
64 Routing with polynomial communication space tradeoff - Awerbuch, Peleg - 1990
64 How to share memory in a distributed system (context) - Upfal, Wigderson - 1987 ACM DBLP
50 Distributed match-making (context) - Mullender, Vit'anyi - 1988 DBLP
44 Distributed paging for general networks - Awerbuch, Bartal et al. - 1996 ACM DBLP
16 Fast fault-tolerant concurrent access to shared objects - Plaxton, Rajaraman - 1996 ACM DBLP
14 Functional composition patterns and power series reversion (context) - Raney - 1960
2 Relieving hot spots on the World Wide Web (context) - Karger, Lehman et al. - 1997 ACM
1 Bubbles: Adaptative routing scheme for high-speed dynamic ne.. (context) - Dolev, Kranakis et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.utexas.edu/users/rraj/papers.html): More
Analysis of a Local Search Heuristic for Facility.. - Korupolu, Plaxton.. (1998) (Correct)
Rapid Convergence of a Local Load Balancing Algorithm for.. - Johannes Gehrke (1997) (Correct)
Tight Analyses of Two Local Load Balancing Algorithms - Ghosh, Leighton, Maggs.. (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC