Abstract : The replication scheme of a distributed database determines how many replicas of each object are created, and to which processors these replicas are allocated. This scheme critically affects the performance of a distributed system, since reading an object locally is less costly than reading is from a remote processor. Therefore in a read-intensive network a widely distributed replication is mandated. On the other hand, an update of an object is usually written to all, or a majority of the replicas, and therefore in a write- intensive network a narrowly distributed replication is mandated. In other words, the optimal replication scheme depends on the read-write pattern for each object. Currently, the replication scheme is established in a static fashion, when the distributed-database is designed, and it remains fixed until the designer manually intervenes to change the number of replicas or their location. If the read-write patterns are fixed and are known a priori, this is a reasonable solution. However, if the read-write patterns change dynamically, in unpredictable ways, a static replication scheme may lead to severe performance problems. In this paper we propose a practical algorithm, called Dynamic-Data- Allocation (DDA), that changes the replication scheme of an object(i.e. the processors which store a replica of the object) dynamically as the read-write pattern of the object changes in the network. We assume that the changes in the read-write pattern are not known a priori.
[1]
Robert E. Tarjan,et al.
Amortized efficiency of list update and paging rules
,
1985,
CACM.
[2]
David L. Black,et al.
Competitive algorithms for replication and migration problems
,
1989
.
[3]
Rafael Alonso,et al.
Data caching issues in an information retrieval system
,
1990,
TODS.
[4]
Ouri Wolfson,et al.
The multicast policy and its relationship to replicated data placement
,
1991,
TODS.
[5]
Rafael Alonso,et al.
Quasi-Copies: Efficient Data Sharing for Information Retrieval Systems
,
1988,
EDBT.
[6]
Sushil Jajodia,et al.
Distributed algorithms for dynamic replication of data
,
1992,
PODS.
[7]
Lawrence W. Dowdy,et al.
Comparative Models of the File Assignment Problem
,
1982,
CSUR.
[8]
Hector Garcia-Molina,et al.
The case for controlled inconsistency in replicated data
,
1990,
[1990] Proceedings. Workshop on the Management of Replicated Data.
[9]
Arthur J. Bernstein,et al.
Bounded ignorance in replicated systems
,
1991,
PODS.
[10]
Allan Borodin,et al.
An optimal online algorithm for metrical task systems
,
1987,
STOC.