An adaptive data replication algorithm

被引:204
作者
Wolfson, O
Jajodia, S
Huang, YX
机构
[1] NASA, GODDARD SPACE FLIGHT CTR, CESDIS, GREENBELT, MD 20771 USA
[2] GEORGE MASON UNIV, INFORMAT & SOFTWARE SYST ENGN DEPT, FAIRFAX, VA 22030 USA
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 1997年 / 22卷 / 02期
关键词
algorithms; performance; computer networks; dynamic data allocation; file allocation; replicated data;
D O I
10.1145/249978.249982
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This article addresses the performance of distributed database systems. Specifically, we present an algorithm for dynamic replication of an object in distributed systems. The algorithm is adaptive in the sense that it changes the replication scheme of the object (i.e., the set of processors at which the object is replicated) as changes occur in the read-write pattern of the object (i.e., the number of reads and writes issued by each processor). The algorithm continuously moves the replication scheme towards an optimal one. We show that the algorithm can be combined with the concurrency control and recovery mechanisms of a distributed database management system. The performance of the algorithm is analyzed theoretically and experimentally. On the way we provide a lower bound on the performance of any dynamic replication algorithm.
引用
收藏
页码:255 / 314
页数:60
相关论文
共 46 条
[11]  
BARTAL Y, 1992, P 24 ANN ACM STOC VI
[12]  
Bernstein P.A., 1987, Concurrency Control and Recovery in Database Systems
[13]  
CERI S, 1984, DISTRIBUTED DATABASE
[14]   MULTIDIMENSIONAL VOTING [J].
CHEUNG, SY .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1991, 9 (04) :399-431
[15]  
DOWDY LW, 1982, ACM COMPUT SUR, V14, P2
[16]  
DUPUY A, 1991, P 2 INT S INT NETW M
[17]  
DUPUY A, 1991, IEEE NETW MAR
[18]  
FISCHER M, 1992, ACM PODS 92 ACM, P70
[19]   HOW TO ASSIGN VOTES IN A DISTRIBUTED SYSTEM [J].
GARCIAMOLINA, H ;
BARBARA, D .
JOURNAL OF THE ACM, 1985, 32 (04) :841-860
[20]   DYNAMIC FILE MIGRATION IN DISTRIBUTED COMPUTER-SYSTEMS [J].
GAVISH, B ;
SHENG, ORL .
COMMUNICATIONS OF THE ACM, 1990, 33 (02) :177-189