Weighted voting for operation dependent management of replicated data
- Cite this paper as:
- Obradovic M., Berman P. (1991) Weighted voting for operation dependent management of replicated data. In: van Leeuwen J., Santoro N. (eds) Distributed Algorithms. WDAG 1990. Lecture Notes in Computer Science, vol 486. Springer, Berlin, Heidelberg
We consider the problem of finding an optimal static pessimistic replica control scheme. It has been recognized that operation mix plays an important role in finding optimal schemes. We demonstrate that voting provides the highest possible availability for fully connected networks and Ethernet systems for the cases of one or two operations. We introduce a technique for reducing the number of operations considered in the analysis. Using this technique we extend the above results to all cases of three operations.
Unable to display preview. Download preview PDF.