Advertisement

Optimistic Erasure-Coded Distributed Storage

  • Partha Dutta
  • Rachid Guerraoui
  • Ron R. Levy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5218)

Abstract

We study erasure-coded atomic register implementations in an asynchronous crash-recovery model. Erasure coding provides a cheap and space-efficient way to tolerate failures in a distributed system. This paper presents ORCAS, Optimistic eRasure-Coded Atomic Storage, which consists of two separate implementations, ORCAS-A and ORCAS-B. In terms of storage space used, ORCAS-A is more efficient in systems where we expect large number of concurrent writes, whereas, ORCAS-B is more suitable if not many writes are invoked concurrently. Compared to replication based implementations, both ORCAS implementations significantly save on the storage space. The implementations are optimistic in the sense that the used storage is lower in synchronous periods, which are considered common in practice, as compared to asynchronous periods. Indirectly, we show that tolerating asynchronous periods does not increase storage overhead during synchronous periods.

Keywords

Stable Storage Atomic Register Storage Overhead Erasure Code Subsequent Read 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Byzantine disk paxos: optimal resilience with byzantine shared memory. Distributed Computing 18(5), 387–408 (2006)CrossRefGoogle Scholar
  2. 2.
    Aguilera, M.K., Janakiraman, R., Xu, L.: Using erasure codes efficiently for storage in a distributed system. In: Proceedings of the International Conference on Dependable Systems and Networks (DSN), pp. 336–345 (2005)Google Scholar
  3. 3.
    Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in a message passing system. Journal of the ACM 42(1), 124–142 (1995)zbMATHCrossRefGoogle Scholar
  4. 4.
    Boichat, R., Guerraoui, R.: Reliable and total order broadcast in the crash-recovery model. Journal of Parallel and Distributed Computing 65(4), 397–413 (2005)zbMATHCrossRefGoogle Scholar
  5. 5.
    Cachin, C., Tessaro, S.: Optimal resilience for erasure-coded byzantine distributed storage. In: Proceedings of the International Conference on Dependable Systems and Networks (DSN), pp. 115–124 (2006)Google Scholar
  6. 6.
    Dutta, P., Guerraoui, R., Levy, R.R.: Optimistic erasure-coded distributed storage. Technical report, EPFL-IC-LPD, Lausanne, Switzerland (2008)Google Scholar
  7. 7.
    Frolund, S., Merchant, A., Saito, Y., Spence, S., Veitch, A.: A decentralized algorithm for erasure-coded virtual disks. In: Proceedings of the International Conference on Dependable Systems and Networks (DSN), pp. 125–134 (2004)Google Scholar
  8. 8.
    Goodson, G.R., Wylie, J.J., Ganger, G.R., Reiter, M.K.: Efficient byzantine-tolerant erasure-coded storage. In: Proceedings of the International Conference on Dependable Systems and Networks (DSN) (2004)Google Scholar
  9. 9.
    Guerraoui, R., Levy, R.R., Pochon, B., Pugh, J.: The collective memory of amnesic processes. ACM Transactions on Algorithms 4(1) (2008)Google Scholar
  10. 10.
    Hendricks, J., Ganger, G.R., Reiter, M.K.: Low-overhead byzantine fault-tolerant storage. In: Proceedings of the 21st ACM Symposium on Operating Systems Principles (SOSP), pp. 73–86 (2007)Google Scholar
  11. 11.
    Hendricks, J., Ganger, G.R., Reiter, M.K.: Verifying distributed erasure-coded data. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 139–146 (2007)Google Scholar
  12. 12.
    Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)CrossRefGoogle Scholar
  13. 13.
    Lamport, L.: On interprocess communication - part i: Basic formalism, part ii: Algorithms. DEC SRC Report, 8 (1985); Also in Distributed Computing, 1, pp. 77-101 (1986)Google Scholar
  14. 14.
    Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers, San Mateo (1996)zbMATHGoogle Scholar
  15. 15.
    Lynch, N.A., Shvartsman, A.A.: Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In: Proceedings of the International Symposium on Fault-Tolerant Computing Systems (FTCS) (1997)Google Scholar
  16. 16.
    Martin, J.-P., Alvisi, L., Dahlin, M.: Minimal byzantine storage. In: Proceedings of the International Symposium on Distributed Computing (DISC), pp. 311–325 (2002)Google Scholar
  17. 17.
    Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. SIAM Journal of Applied Mathematics 8, 300–304 (1960)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Partha Dutta
    • 1
  • Rachid Guerraoui
    • 2
  • Ron R. Levy
    • 2
  1. 1.IBM India Research LabBangaloreIndia
  2. 2.EPFL ICLausanneSwitzerland

Personalised recommendations