The Community for Technology Leaders
Green Image
<p>This paper investigates the problem of finding an optimal static pessimistic replica control scheme. It has been widely accepted that coteries (proposed by Garcia-Molina and Barbara) provide the most general framework for such schemes. We demonstrate that voting schemes, a very small subset of static pessimistic schemes, are optimal for fully connected networks with negligible link failure rates, as well as for Ethernet systems. Wealso show that voting is not optimal for somewhat more general systems. We propose amodification of the algorithm of Z. Tong and R.Y. Kain (1988) for computing optimal voting in operation independent case, so that it runs in linear (rather than exponential) time. Finally, we propose the first efficient algorithm for computing the optimal vote assignment and appropriate thresholds for fully connected networks when relative frequencies of read and write operations are known. We also extend this result to Ethernet systems.</p>
Index Termsdistributed databases; software reliability; protocols; local area networks; optimal staticpessimistic scheme; replicated data; voting schemes; Ethernet systems; optimal voteassignment; fully connected networks

P. Berman and M. Spasojevic, "Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 64-73, 1994.
86 ms
(Ver 3.3 (11022016))