Weighted voting for operation dependent management of replicated data

  • Mirjana Obradovic
  • Piotr Berman
Conference paper

DOI: 10.1007/3-540-54099-7_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 486)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Mirjana Obradovic
    • 1
  • Piotr Berman
    • 1
  1. 1.Department of Computer Science 333 Whitmore LaboratoryPenn State UniversityUniversity Park

Personalised recommendations