Space Bounds for Reliable Storage: Fundamental Limits of Coding (Keynote)

Authors Alexander Spiegelman, Yuval Cassuto, Gregory Chockler, Idit Keidar



PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2015.4.pdf
  • Filesize: 321 kB
  • 3 pages

Document Identifiers

Author Details

Alexander Spiegelman
Yuval Cassuto
Gregory Chockler
Idit Keidar

Cite AsGet BibTex

Alexander Spiegelman, Yuval Cassuto, Gregory Chockler, and Idit Keidar. Space Bounds for Reliable Storage: Fundamental Limits of Coding (Keynote). In 19th International Conference on Principles of Distributed Systems (OPODIS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 46, pp. 4:1-4:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.OPODIS.2015.4

Abstract

We present here a synopsis of a keynote presentation given by Idit Keidar at OPODIS 2015, the International Conference on Principles of Distributed Systems, which took place in Rennes, France, on December 14-17 2015.
Keywords
  • distributed storage
  • impossibility

Metrics

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

References

  1. Marcos Kawazoe Aguilera, Ramaprabhu Janakiraman, and Lihao Xu. Using erasure codes efficiently for storage in a distributed system. In Dependable Systems and Networks, 2005. DSN 2005. Proceedings. International Conference on, pages 336-345. IEEE, 2005. Google Scholar
  2. 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. Google Scholar
  3. 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
  4. 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
  5. 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.
  6. 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
  7. Leslie Lamport. On interprocess communication. Distributed computing, 1(2):86-101, 1986. Google Scholar
  8. Cheng Shao, Jennifer L Welch, Evelyn Pierce, and Hyunyoung Lee. Multiwriter consistency conditions for shared memory registers. SIAM Journal on Computing, 40(1):28-62, 2011. Google Scholar
  9. Alexander Spiegelman, Yuval Cassuto, Gregory Chockler, and Idit Keidar. Space bounds for reliable storage: Fundamental limits of coding. arXiv preprint arXiv:1507.05169, 2015. Google Scholar
  10. Zhiying Wang and Viveck Cadambe. Multi-version coding in distributed storage. In Information Theory (ISIT), 2014 IEEE International Symposium on, pages 871-875. IEEE, 2014. 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