37 search results - page 1 / 8 » Accessing Nearby Copies of Replicated Objects in a Distribut... |
SPAA
1997
ACM
13 years 9 months ago
1997
ACM
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 e ...
CSCW
2000
ACM
13 years 9 months ago
2000
ACM
In real−time collaborative systems, replicated objects, shared by users, are subject to concurrency constraints. In order to satisfy these, various algorithms, qualified as opâˆ...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
Dynamic replication algorithms aim at allocating, migrating and deleting copies of an object over various Internet hosts, according to the access patterns exhibited online, so as ...
ICDE
1990
IEEE
13 years 8 months ago
1990
IEEE
All previous multicopy algorithms require additional space for redundant information equal to the size of the object being replicated. This paper proposes a new multicopy algorith...
VLDB
1990
ACM
13 years 8 months ago
1990
ACM
In this paper, we present an efficient algorithm for managing replicated data. We impose a logical tree structure on the set of copies of an object. In a failurefree environment t...