Document Open Access Logo

Integrated Bounds for Disintegrated Storage

Authors Alon Berger, Idit Keidar, Alexander Spiegelman

PDF

File

Thumbnail PDF
PDF
LIPIcs.DISC.2018.11.pdf
  • Filesize: 491 kB
  • 18 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed computing models
  • Computing methodologies → Distributed algorithms
Keywords
  • storage
  • coding
  • lower bounds
  • space complexity
  • register emulations

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We point out a somewhat surprising similarity between non-authenticated Byzantine storage, coded storage, and certain emulations of shared registers from smaller ones. A common characteristic in all of these is the inability of reads to safely return a value obtained in a single atomic access to shared storage. We collectively refer to such systems as disintegrated storage, and show integrated space lower bounds for asynchronous regular wait-free emulations in all of them. In a nutshell, if readers are invisible, then the storage cost of such systems is inherently exponential in the size of written values; otherwise, it is at least linear in the number of readers. Our bounds are asymptotically tight to known algorithms, and thus justify their high costs.

Cite As Get BibTex

Alon Berger, Idit Keidar, and Alexander Spiegelman. Integrated Bounds for Disintegrated Storage. In 32nd International Symposium on Distributed Computing (DISC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 121, pp. 11:1-11:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/LIPIcs.DISC.2018.11

Author Details

Alon Berger
  • Viterbi Department of Electrical Engineering, Technion, Haifa, Israel
Idit Keidar
  • Viterbi Department of Electrical Engineering, Technion, Haifa, Israel
Alexander Spiegelman
  • VMware Research, Israel

References

  1. Ittai Abraham, Gregory Chockler, Idit Keidar, and Dahlia Malkhi. Byzantine disk paxos: optimal resilience with byzantine shared memory. Distributed Computing, 18(5):387-408, 2006. Google Scholar
  2. Ittai Abraham, Gregory Chockler, Idit Keidar, and Dahlia Malkhi. Wait-free regular storage from byzantine components. Information Processing Letters, 101(2):60-65, 2007. Google Scholar
  3. Marcos K. Aguilera, Burkhard Englert, and Eli Gafni. On using network attached disks as shared memory. In Proceedings of the Twenty-second Annual Symposium on Principles of Distributed Computing, PODC '03, pages 315-324, New York, NY, USA, 2003. ACM. URL: http://dx.doi.org/10.1145/872035.872082.
  4. Marcos Kawazoe Aguilera, Ramaprabhu Janakiraman, and Lihao Xu. Using erasure codes efficiently for storage in a distributed system. In 2005 International Conference on Dependable Systems and Networks (DSN'05), pages 336-345, June 2005. Google Scholar
  5. Elli Androulaki, Christian Cachin, Dan Dobre, and Marko Vukolić. Erasure-coded byzantine storage with separate metadata. In International Conference on Principles of Distributed Systems, pages 76-90. Springer, 2014. Google Scholar
  6. Hagit Attiya, Amotz Bar-Noy, and Danny Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM (JACM), 42(1):124-142, 1995. URL: http://dx.doi.org/10.1145/200836.200869.
  7. Rida A Bazzi and Yin Ding. Non-skipping timestamps for byzantine data storage systems. In International Symposium on Distributed Computing, pages 405-419. Springer, 2004. Google Scholar
  8. Alon Berger, Idit Keidar, and Alexander Spiegelman. Integrated bounds for disintegrated storage. arXiv preprint arXiv:1805.06265, 2018. Google Scholar
  9. Christian Cachin and Stefano Tessaro. Optimal resilience for erasure-coded byzantine distributed storage. In Dependable Systems and Networks, 2006. DSN 2006. International Conference on, pages 115-124. IEEE, 2006. Google Scholar
  10. Viveck R. Cadambe, Nancy Lynch, Muriel Medard, and Peter Musial. A coded shared atomic memory algorithm for message passing architectures. In Network Computing and Applications (NCA), 2014 IEEE 13th International Symposium on, pages 253-260. IEEE, 2014. Google Scholar
  11. Viveck R. Cadambe, Zhiying Wang, and Nancy Lynch. Information-theoretic lower bounds on the storage cost of shared memory emulation. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC '16, pages 305-313, New York, NY, USA, 2016. ACM. URL: http://dx.doi.org/10.1145/2933057.2933118.
  12. Soma Chaudhuri, Martha J Kosa, and Jennifer L Welch. One-write algorithms for multivalued regular and atomic registers. Acta Informatica, 37(3):161-192, 2000. Google Scholar
  13. Tian Ze Chen and Yuanhao Wei. Step Optimal Implementations of Large Single-Writer Registers. In Panagiota Fatourou, Ernesto Jiménez, and Fernando Pedone, editors, 20th International Conference on Principles of Distributed Systems (OPODIS 2016), volume 70 of Leibniz International Proceedings in Informatics (LIPIcs), pages 32:1-32:16, Dagstuhl, Germany, 2017. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. URL: http://dx.doi.org/10.4230/LIPIcs.OPODIS.2016.32.
  14. Gregory Chockler, Rachid Guerraoui, and Idit Keidar. Amnesic distributed storage. In Distributed Computing, pages 139-151. Springer, 2007. Google Scholar
  15. Gregory Chockler and Alexander Spiegelman. Space complexity of fault-tolerant register emulations. In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC '17, pages 83-92, New York, NY, USA, 2017. ACM. URL: http://dx.doi.org/10.1145/3087801.3087824.
  16. Dan Dobre, Ghassan Karame, Wenting Li, Matthias Majuntke, Neeraj Suri, and Marko Vukolić. Powerstore: proofs of writing for efficient and robust storage. In Proceedings of the 2013 ACM SIGSAC conference on Computer &communications security, pages 285-298. ACM, 2013. Google Scholar
  17. Partha Dutta, Rachid Guerraoui, and Ron R. Levy. Optimistic erasure-coded distributed storage. In Proceedings of the 22nd International Symposium on Distributed Computing, DISC '08, pages 182-196, Berlin, Heidelberg, 2008. Springer-Verlag. URL: http://dx.doi.org/10.1007/978-3-540-87779-0_13.
  18. Garth R Goodson, Jay J Wylie, Gregory R Ganger, and Michael K Reiter. Efficient byzantine-tolerant erasure-coded storage. In Dependable Systems and Networks, 2004 International Conference on, pages 135-144. IEEE, 2004. Google Scholar
  19. Prasad Jayanti, Tushar Deepak Chandra, and Sam Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM (JACM), 45(3):451-500, 1998. Google Scholar
  20. Leslie Lamport. On interprocess communication. Distributed computing, 1(2):86-101, 1986. Google Scholar
  21. Jean-Philippe Martin, Lorenzo Alvisi, and Michael Dahlin. Minimal byzantine storage. In International Symposium on Distributed Computing, pages 311-325. Springer, 2002. Google Scholar
  22. Gary L Peterson. Concurrent reading while writing. ACM Transactions on Programming Languages and Systems (TOPLAS), 5(1):46-55, 1983. Google Scholar
  23. Alexander Spiegelman, Yuval Cassuto, Gregory Chockler, and Idit Keidar. Space bounds for reliable storage: Fundamental limits of coding. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC '16, pages 249-258, New York, NY, USA, 2016. ACM. URL: http://dx.doi.org/10.1145/2933057.2933104.
  24. Zhiying Wang and Viveck R. Cadambe. On multi-version coding for distributed storage. In Communication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on, pages 569-575. IEEE, 2014. Google Scholar
  25. Yuanhao Wei. Space complexity of implementing large shared registers. arXiv preprint arXiv:1808.00481, 2018. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact