Weighted voting for operation dependent management of replicated data

Mirjana Obradovic; Piotr Berman

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

Weighted voting for operation dependent management of replicated data

Mirjana Obradovic, Piotr Berman

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

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.

Original language	English (US)
Title of host publication	Distributed Algorithms - 4th International Workshop, Proceedings
Editors	Jan van Leeuwen, Nicola Santoro
Publisher	Springer Verlag
Pages	263-276
Number of pages	14
ISBN (Print)	9783540540991
DOIs	https://doi.org/10.1007/3-540-54099-7_18
State	Published - 1991
Event	4th International Workshop on Distributed Algorithms, WDAG 1990 - Bari, Italy Duration: Sep 24 1990 → Sep 26 1990

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	486 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	4th International Workshop on Distributed Algorithms, WDAG 1990
Country/Territory	Italy
City	Bari
Period	9/24/90 → 9/26/90

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-54099-7_18

Cite this

Obradovic, M., & Berman, P. (1991). Weighted voting for operation dependent management of replicated data. In J. van Leeuwen, & N. Santoro (Eds.), Distributed Algorithms - 4th International Workshop, Proceedings (pp. 263-276). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 486 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-54099-7_18

Obradovic, Mirjana ; Berman, Piotr. / Weighted voting for operation dependent management of replicated data. Distributed Algorithms - 4th International Workshop, Proceedings. editor / Jan van Leeuwen ; Nicola Santoro. Springer Verlag, 1991. pp. 263-276 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{909ff2bb6bf64a2a83ec83518dc6ac23,

title = "Weighted voting for operation dependent management of replicated data",

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.",

author = "Mirjana Obradovic and Piotr Berman",

note = "Funding Information: 1This work was partially supported; 4th International Workshop on Distributed Algorithms, WDAG 1990 ; Conference date: 24-09-1990 Through 26-09-1990",

year = "1991",

doi = "10.1007/3-540-54099-7_18",

language = "English (US)",

isbn = "9783540540991",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "263--276",

editor = "{van Leeuwen}, Jan and Nicola Santoro",

booktitle = "Distributed Algorithms - 4th International Workshop, Proceedings",

address = "Germany",

}

Obradovic, M & Berman, P 1991, Weighted voting for operation dependent management of replicated data. in J van Leeuwen & N Santoro (eds), Distributed Algorithms - 4th International Workshop, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 486 LNCS, Springer Verlag, pp. 263-276, 4th International Workshop on Distributed Algorithms, WDAG 1990, Bari, Italy, 9/24/90. https://doi.org/10.1007/3-540-54099-7_18

Weighted voting for operation dependent management of replicated data. / Obradovic, Mirjana; Berman, Piotr.
Distributed Algorithms - 4th International Workshop, Proceedings. ed. / Jan van Leeuwen; Nicola Santoro. Springer Verlag, 1991. p. 263-276 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 486 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Weighted voting for operation dependent management of replicated data

AU - Obradovic, Mirjana

AU - Berman, Piotr

N1 - Funding Information: 1This work was partially supported

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84941535028&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84941535028&partnerID=8YFLogxK

U2 - 10.1007/3-540-54099-7_18

DO - 10.1007/3-540-54099-7_18

M3 - Conference contribution

AN - SCOPUS:84941535028

SN - 9783540540991

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 263

EP - 276

BT - Distributed Algorithms - 4th International Workshop, Proceedings

A2 - van Leeuwen, Jan

A2 - Santoro, Nicola

PB - Springer Verlag

T2 - 4th International Workshop on Distributed Algorithms, WDAG 1990

Y2 - 24 September 1990 through 26 September 1990

ER -

Obradovic M, Berman P. Weighted voting for operation dependent management of replicated data. In van Leeuwen J, Santoro N, editors, Distributed Algorithms - 4th International Workshop, Proceedings. Springer Verlag. 1991. p. 263-276. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-54099-7_18

Weighted voting for operation dependent management of replicated data

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this