This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimization of the Number of Copies in a Distributed Data Base
January 1981 (vol. 7 no. 1)
pp. 78-84
E.G. Coffman, Bell Laboratories
We consider the effect on system performance of the distribution of a data base in the form of multiple copies at distinct sites. The purpose of our analysis is to determine the gain in READ throughput that can be obtained in the presence of consistency preserving algorithms that have to be implemented when UPDATE operations are carried out on each copy. We show that READ throughput diminishes if the number of copies exceeds an optimal value. The theoretical model we develop is applied to a system in which consistency is preserved through the use of Ellis' ring algorithm.
Index Terms:
update, Consistency control algorithm, distributed database, performance evaluation, preemptive priority, queuing theory, read processing capacity
Citation:
E.G. Coffman, E. Gelenbe, B. Plateau, "Optimization of the Number of Copies in a Distributed Data Base," IEEE Transactions on Software Engineering, vol. 7, no. 1, pp. 78-84, Jan. 1981, doi:10.1109/TSE.1981.234510
Usage of this product signifies your acceptance of the Terms of Use.