Voting as the optimal static pessimistic scheme for managing replicated data

Mirjana Obradovic, Piotr Berman

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    10 Citations (Scopus)

    Abstract

    The problem of finding an optimal static pessimistic replica control scheme is investigated. It has been widely accepted that coteries (proposed by Garcia-Molina and Barbara) provide the most general framework for such schemes. Under such an assumption, it is demonstrated that the voting scheme is an optimal static pessimistic scheme for fully connected networks with negligible link failure rates, as well as for Ethernet systems. It is also shown that voting is not optimal for somewhat more general systems. The authors propose a modification of the algorithm of Tong and Kain for the best voting in the operation-independent case so that it runs in linear (rather than exponential) time. They also propose a linear-time algorithm for computing the optimal vote assignment when relative frequencies of read and write operations are known.

    Original languageEnglish (US)
    Title of host publicationProceedings - Symposium on Reliability in Distributed Software and Database Systems
    PublisherPubl by IEEE
    Pages126-135
    Number of pages10
    StatePublished - 1990
    EventProceedings of the 9th Symposium on Reliable Distributed Systems - Huntsville, AL, USA
    Duration: Oct 9 1990Oct 11 1990

    Other

    OtherProceedings of the 9th Symposium on Reliable Distributed Systems
    CityHuntsville, AL, USA
    Period10/9/9010/11/90

    Fingerprint

    Ethernet

    All Science Journal Classification (ASJC) codes

    • Software

    Cite this

    Obradovic, M., & Berman, P. (1990). Voting as the optimal static pessimistic scheme for managing replicated data. In Proceedings - Symposium on Reliability in Distributed Software and Database Systems (pp. 126-135). Publ by IEEE.
    Obradovic, Mirjana ; Berman, Piotr. / Voting as the optimal static pessimistic scheme for managing replicated data. Proceedings - Symposium on Reliability in Distributed Software and Database Systems. Publ by IEEE, 1990. pp. 126-135
    @inproceedings{c53afaf36de94a36b8ddbb332498e910,
    title = "Voting as the optimal static pessimistic scheme for managing replicated data",
    abstract = "The problem of finding an optimal static pessimistic replica control scheme is investigated. It has been widely accepted that coteries (proposed by Garcia-Molina and Barbara) provide the most general framework for such schemes. Under such an assumption, it is demonstrated that the voting scheme is an optimal static pessimistic scheme for fully connected networks with negligible link failure rates, as well as for Ethernet systems. It is also shown that voting is not optimal for somewhat more general systems. The authors propose a modification of the algorithm of Tong and Kain for the best voting in the operation-independent case so that it runs in linear (rather than exponential) time. They also propose a linear-time algorithm for computing the optimal vote assignment when relative frequencies of read and write operations are known.",
    author = "Mirjana Obradovic and Piotr Berman",
    year = "1990",
    language = "English (US)",
    pages = "126--135",
    booktitle = "Proceedings - Symposium on Reliability in Distributed Software and Database Systems",
    publisher = "Publ by IEEE",

    }

    Obradovic, M & Berman, P 1990, Voting as the optimal static pessimistic scheme for managing replicated data. in Proceedings - Symposium on Reliability in Distributed Software and Database Systems. Publ by IEEE, pp. 126-135, Proceedings of the 9th Symposium on Reliable Distributed Systems, Huntsville, AL, USA, 10/9/90.

    Voting as the optimal static pessimistic scheme for managing replicated data. / Obradovic, Mirjana; Berman, Piotr.

    Proceedings - Symposium on Reliability in Distributed Software and Database Systems. Publ by IEEE, 1990. p. 126-135.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

    T1 - Voting as the optimal static pessimistic scheme for managing replicated data

    AU - Obradovic, Mirjana

    AU - Berman, Piotr

    PY - 1990

    Y1 - 1990

    N2 - The problem of finding an optimal static pessimistic replica control scheme is investigated. It has been widely accepted that coteries (proposed by Garcia-Molina and Barbara) provide the most general framework for such schemes. Under such an assumption, it is demonstrated that the voting scheme is an optimal static pessimistic scheme for fully connected networks with negligible link failure rates, as well as for Ethernet systems. It is also shown that voting is not optimal for somewhat more general systems. The authors propose a modification of the algorithm of Tong and Kain for the best voting in the operation-independent case so that it runs in linear (rather than exponential) time. They also propose a linear-time algorithm for computing the optimal vote assignment when relative frequencies of read and write operations are known.

    AB - The problem of finding an optimal static pessimistic replica control scheme is investigated. It has been widely accepted that coteries (proposed by Garcia-Molina and Barbara) provide the most general framework for such schemes. Under such an assumption, it is demonstrated that the voting scheme is an optimal static pessimistic scheme for fully connected networks with negligible link failure rates, as well as for Ethernet systems. It is also shown that voting is not optimal for somewhat more general systems. The authors propose a modification of the algorithm of Tong and Kain for the best voting in the operation-independent case so that it runs in linear (rather than exponential) time. They also propose a linear-time algorithm for computing the optimal vote assignment when relative frequencies of read and write operations are known.

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

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

    M3 - Conference contribution

    SP - 126

    EP - 135

    BT - Proceedings - Symposium on Reliability in Distributed Software and Database Systems

    PB - Publ by IEEE

    ER -

    Obradovic M, Berman P. Voting as the optimal static pessimistic scheme for managing replicated data. In Proceedings - Symposium on Reliability in Distributed Software and Database Systems. Publ by IEEE. 1990. p. 126-135