Information-theoretic lower bounds on the storage cost of shared memory emulation

Viveck Ramesh Cadambe, Zhiying Wang, Nancy Lynch

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

    8 Citations (Scopus)

    Abstract

    The focus of this paper is to understand storage costs of em- ulating an atomic shared memory over an asynchronous, dis- tributed message passing system. Previous literature has de- veloped several shared memory emulation algorithms based on replication and erasure coding techniques, and analyzed the storage costs of the proposed algorithms. In this pa- per, we present the first known information-theoretic lower bounds on the storage costs incurred by shared memory em- ulation algorithms. Our storage cost lower bounds are uni- versally applicable, that is, we make no assumption on the structure of the algorithm or the method of encoding the data. We consider an arbitrary algorithm A that implements an atomic multi-writer-single-reader (MWSR) shared memory variable whose values come from a finite set V over a system of N servers connected by point-to-point asynchronous links. We require that in every fair execution of algorithm A where the number of server failures is smaller than a parameter f, every operation invoked at a non-failing client terminates. We define the storage cost of a server in algorithm A as the logarithm (to base 2) of the number of states it can take on; the total storage cost of algorithm A is the sum of the storage cost of all servers. Previously, it was known that the storage cost cannot be smaller than N/N-f log2 |V|. We develop three new lower bounds on the storage cost of algorithm A. • In our first lower bound, we show that if algorithm A does not use server gossip, then the total storage cost is lower bounded by 2N/N-f+1 log2 |V| - o(log2 |V|). • In our second lower bound we show that the total stor- age cost is at least 2N/N-f+2 log2 |V| - o(log2 |V|) even if the algorithm uses server gossip. • In our third lower bound, we consider algorithms where the write protocol sends information about the value in at most one phase. For such algorithms, we show that the total storage cost is at least v N/N-f+v-1 log2(|V|) -o(log2(|V|), where v is the minimum of f + 1 and the number of active write operations of an execution. Our first and second lower bounds are approximately twice as strong as the previously known bound of N/N-f log2 |V|. Furthermore, our first two lower bounds apply even for regu- lar, single-writer-single-reader (SWSR) shared memory em- ulation algorithms. Our third lower bound is much larger than our first and second lower bounds, although it is appli- cable to a smaller class of algorithms where the write proto- col has certain restrictions. In particular, our third bound is comparable to the storage cost achieved by most shared memory emulation algorithms in the literature, which nat- urally fall under the class of algorithms studied. Our proof ideas are inspired by recent results in coding theory.

    Original languageEnglish (US)
    Title of host publicationPODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
    PublisherAssociation for Computing Machinery
    Pages305-314
    Number of pages10
    ISBN (Electronic)9781450339643
    DOIs
    StatePublished - Jul 25 2016
    Event35th ACM Symposium on Principles of Distributed Computing, PODC 2016 - Chicago, United States
    Duration: Jul 25 2016Jul 28 2016

    Publication series

    NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing
    Volume25-28-July-2016

    Other

    Other35th ACM Symposium on Principles of Distributed Computing, PODC 2016
    CountryUnited States
    CityChicago
    Period7/25/167/28/16

    Fingerprint

    Data storage equipment
    Costs
    Servers
    Network protocols
    Message passing
    Cables

    All Science Journal Classification (ASJC) codes

    • Software
    • Hardware and Architecture
    • Computer Networks and Communications

    Cite this

    Cadambe, V. R., Wang, Z., & Lynch, N. (2016). Information-theoretic lower bounds on the storage cost of shared memory emulation. In PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (pp. 305-314). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; Vol. 25-28-July-2016). Association for Computing Machinery. https://doi.org/10.1145/2933057.2933118
    Cadambe, Viveck Ramesh ; Wang, Zhiying ; Lynch, Nancy. / Information-theoretic lower bounds on the storage cost of shared memory emulation. PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2016. pp. 305-314 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).
    @inproceedings{727c22f4874c47b8a040da185e4af901,
    title = "Information-theoretic lower bounds on the storage cost of shared memory emulation",
    abstract = "The focus of this paper is to understand storage costs of em- ulating an atomic shared memory over an asynchronous, dis- tributed message passing system. Previous literature has de- veloped several shared memory emulation algorithms based on replication and erasure coding techniques, and analyzed the storage costs of the proposed algorithms. In this pa- per, we present the first known information-theoretic lower bounds on the storage costs incurred by shared memory em- ulation algorithms. Our storage cost lower bounds are uni- versally applicable, that is, we make no assumption on the structure of the algorithm or the method of encoding the data. We consider an arbitrary algorithm A that implements an atomic multi-writer-single-reader (MWSR) shared memory variable whose values come from a finite set V over a system of N servers connected by point-to-point asynchronous links. We require that in every fair execution of algorithm A where the number of server failures is smaller than a parameter f, every operation invoked at a non-failing client terminates. We define the storage cost of a server in algorithm A as the logarithm (to base 2) of the number of states it can take on; the total storage cost of algorithm A is the sum of the storage cost of all servers. Previously, it was known that the storage cost cannot be smaller than N/N-f log2 |V|. We develop three new lower bounds on the storage cost of algorithm A. • In our first lower bound, we show that if algorithm A does not use server gossip, then the total storage cost is lower bounded by 2N/N-f+1 log2 |V| - o(log2 |V|). • In our second lower bound we show that the total stor- age cost is at least 2N/N-f+2 log2 |V| - o(log2 |V|) even if the algorithm uses server gossip. • In our third lower bound, we consider algorithms where the write protocol sends information about the value in at most one phase. For such algorithms, we show that the total storage cost is at least v∗ N/N-f+v∗-1 log2(|V|) -o(log2(|V|), where v∗ is the minimum of f + 1 and the number of active write operations of an execution. Our first and second lower bounds are approximately twice as strong as the previously known bound of N/N-f log2 |V|. Furthermore, our first two lower bounds apply even for regu- lar, single-writer-single-reader (SWSR) shared memory em- ulation algorithms. Our third lower bound is much larger than our first and second lower bounds, although it is appli- cable to a smaller class of algorithms where the write proto- col has certain restrictions. In particular, our third bound is comparable to the storage cost achieved by most shared memory emulation algorithms in the literature, which nat- urally fall under the class of algorithms studied. Our proof ideas are inspired by recent results in coding theory.",
    author = "Cadambe, {Viveck Ramesh} and Zhiying Wang and Nancy Lynch",
    year = "2016",
    month = "7",
    day = "25",
    doi = "10.1145/2933057.2933118",
    language = "English (US)",
    series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
    publisher = "Association for Computing Machinery",
    pages = "305--314",
    booktitle = "PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing",

    }

    Cadambe, VR, Wang, Z & Lynch, N 2016, Information-theoretic lower bounds on the storage cost of shared memory emulation. in PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, vol. 25-28-July-2016, Association for Computing Machinery, pp. 305-314, 35th ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, United States, 7/25/16. https://doi.org/10.1145/2933057.2933118

    Information-theoretic lower bounds on the storage cost of shared memory emulation. / Cadambe, Viveck Ramesh; Wang, Zhiying; Lynch, Nancy.

    PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2016. p. 305-314 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; Vol. 25-28-July-2016).

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

    TY - GEN

    T1 - Information-theoretic lower bounds on the storage cost of shared memory emulation

    AU - Cadambe, Viveck Ramesh

    AU - Wang, Zhiying

    AU - Lynch, Nancy

    PY - 2016/7/25

    Y1 - 2016/7/25

    N2 - The focus of this paper is to understand storage costs of em- ulating an atomic shared memory over an asynchronous, dis- tributed message passing system. Previous literature has de- veloped several shared memory emulation algorithms based on replication and erasure coding techniques, and analyzed the storage costs of the proposed algorithms. In this pa- per, we present the first known information-theoretic lower bounds on the storage costs incurred by shared memory em- ulation algorithms. Our storage cost lower bounds are uni- versally applicable, that is, we make no assumption on the structure of the algorithm or the method of encoding the data. We consider an arbitrary algorithm A that implements an atomic multi-writer-single-reader (MWSR) shared memory variable whose values come from a finite set V over a system of N servers connected by point-to-point asynchronous links. We require that in every fair execution of algorithm A where the number of server failures is smaller than a parameter f, every operation invoked at a non-failing client terminates. We define the storage cost of a server in algorithm A as the logarithm (to base 2) of the number of states it can take on; the total storage cost of algorithm A is the sum of the storage cost of all servers. Previously, it was known that the storage cost cannot be smaller than N/N-f log2 |V|. We develop three new lower bounds on the storage cost of algorithm A. • In our first lower bound, we show that if algorithm A does not use server gossip, then the total storage cost is lower bounded by 2N/N-f+1 log2 |V| - o(log2 |V|). • In our second lower bound we show that the total stor- age cost is at least 2N/N-f+2 log2 |V| - o(log2 |V|) even if the algorithm uses server gossip. • In our third lower bound, we consider algorithms where the write protocol sends information about the value in at most one phase. For such algorithms, we show that the total storage cost is at least v∗ N/N-f+v∗-1 log2(|V|) -o(log2(|V|), where v∗ is the minimum of f + 1 and the number of active write operations of an execution. Our first and second lower bounds are approximately twice as strong as the previously known bound of N/N-f log2 |V|. Furthermore, our first two lower bounds apply even for regu- lar, single-writer-single-reader (SWSR) shared memory em- ulation algorithms. Our third lower bound is much larger than our first and second lower bounds, although it is appli- cable to a smaller class of algorithms where the write proto- col has certain restrictions. In particular, our third bound is comparable to the storage cost achieved by most shared memory emulation algorithms in the literature, which nat- urally fall under the class of algorithms studied. Our proof ideas are inspired by recent results in coding theory.

    AB - The focus of this paper is to understand storage costs of em- ulating an atomic shared memory over an asynchronous, dis- tributed message passing system. Previous literature has de- veloped several shared memory emulation algorithms based on replication and erasure coding techniques, and analyzed the storage costs of the proposed algorithms. In this pa- per, we present the first known information-theoretic lower bounds on the storage costs incurred by shared memory em- ulation algorithms. Our storage cost lower bounds are uni- versally applicable, that is, we make no assumption on the structure of the algorithm or the method of encoding the data. We consider an arbitrary algorithm A that implements an atomic multi-writer-single-reader (MWSR) shared memory variable whose values come from a finite set V over a system of N servers connected by point-to-point asynchronous links. We require that in every fair execution of algorithm A where the number of server failures is smaller than a parameter f, every operation invoked at a non-failing client terminates. We define the storage cost of a server in algorithm A as the logarithm (to base 2) of the number of states it can take on; the total storage cost of algorithm A is the sum of the storage cost of all servers. Previously, it was known that the storage cost cannot be smaller than N/N-f log2 |V|. We develop three new lower bounds on the storage cost of algorithm A. • In our first lower bound, we show that if algorithm A does not use server gossip, then the total storage cost is lower bounded by 2N/N-f+1 log2 |V| - o(log2 |V|). • In our second lower bound we show that the total stor- age cost is at least 2N/N-f+2 log2 |V| - o(log2 |V|) even if the algorithm uses server gossip. • In our third lower bound, we consider algorithms where the write protocol sends information about the value in at most one phase. For such algorithms, we show that the total storage cost is at least v∗ N/N-f+v∗-1 log2(|V|) -o(log2(|V|), where v∗ is the minimum of f + 1 and the number of active write operations of an execution. Our first and second lower bounds are approximately twice as strong as the previously known bound of N/N-f log2 |V|. Furthermore, our first two lower bounds apply even for regu- lar, single-writer-single-reader (SWSR) shared memory em- ulation algorithms. Our third lower bound is much larger than our first and second lower bounds, although it is appli- cable to a smaller class of algorithms where the write proto- col has certain restrictions. In particular, our third bound is comparable to the storage cost achieved by most shared memory emulation algorithms in the literature, which nat- urally fall under the class of algorithms studied. Our proof ideas are inspired by recent results in coding theory.

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

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

    U2 - 10.1145/2933057.2933118

    DO - 10.1145/2933057.2933118

    M3 - Conference contribution

    T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

    SP - 305

    EP - 314

    BT - PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

    PB - Association for Computing Machinery

    ER -

    Cadambe VR, Wang Z, Lynch N. Information-theoretic lower bounds on the storage cost of shared memory emulation. In PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery. 2016. p. 305-314. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). https://doi.org/10.1145/2933057.2933118