Weighted voting for operation dependent management of replicated data

Mirjana Obradovic, Piotr Berman

    Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
    Title of host publicationDistributed Algorithms - 4th International Workshop, Proceedings
    EditorsJan van Leeuwen, Nicola Santoro
    PublisherSpringer Verlag
    Pages263-276
    Number of pages14
    ISBN (Print)9783540540991
    DOIs
    StatePublished - 1991
    Event4th International Workshop on Distributed Algorithms, WDAG 1990 - Bari, Italy
    Duration: Sep 24 1990Sep 26 1990

    Publication series

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

    Other

    Other4th International Workshop on Distributed Algorithms, WDAG 1990
    Country/TerritoryItaly
    CityBari
    Period9/24/909/26/90

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint

    Dive into the research topics of 'Weighted voting for operation dependent management of replicated data'. Together they form a unique fingerprint.

    Cite this