The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—This paper makes two contributions. First, we introduce a model for evaluating the performance of data allocation and replication algorithms in distributed databases. The model is comprehensive in the sense that it accounts for I/O cost, for communication cost, and, because of reliability considerations, for limits on the minimum number of copies of the object. The model captures existing replica-management algorithms, such as read-one-write-all, quorum-consensus, etc. These algorithms are static in the sense that, in the absence of failures,, the copies of each object are allocated to a fixed set of processors.</p><p>In modern distributed databases, particularly in mobile computing environments, processors will dynamically store objects in their local database and will relinquish them. Therefore, as a second contribution of this paper, we introduce an algorithm for automatic dynamic allocation of replicas to processors. Then, using the new model, we compare the performance of the traditional read-one-write-all static allocation algorithm to the performance of the dynamic allocation algorithm. As a result, we obtain the relationship between the communication cost and I/O cost for which static allocation is superior to dynamic allocation, and the relationships for which dynamic allocation is superior.</p>
Object allocation, caching, distributed database, mobile computing, wireless communication, competitiveness.

O. Wolfson and Y. Huang, "Competitive Analysis of Caching in Distributed Databases," in IEEE Transactions on Parallel & Distributed Systems, vol. 9, no. , pp. 391-409, 1998.
90 ms
(Ver 3.3 (11022016))