Erasure Codes in a nutshell
summary
An overview of standard erasure-code implementations (EC) with a focus on the low-level mathematics and algorithms that power them, plus practical examples. Covers concrete EC implementations and their underlying math details; aimed at people who already know EC concepts rather than EC developers.
AI-written summary · about
chapters (10)
- 0:00Intro
- 0:19Getting Started
- 7:37Data Replication
- 10:48Erasure Codes 3
- 21:03Erasure Codes 5. Further reading
- 22:41Erasure Code 86. Storage consumption & EC cons
- 31:26EC & CEPH. Jerasure 1
- 34:27EC & CEPH. Jerasure Failures
- 36:08EC & CEPH. LRC
- 37:54References
related talks
24mOpenEC: Toward Unified and Configurable Erasure Coding Management...
01h 14mErasure Coding at Scale
26mFast Erasure Coding for Data Storage: A Comprehensive Study of the Acceleration...
22mELECT: Enabling Erasure Coding Tiering for LSM-tree-based Storage
25mErasure-Resilient Sublinear-Time Graph Algorithms
28mSpEQ: Translation of Sparse Codes using Equivalences
27mA Student's View of Locally Repairable Codes
23mEncrypted Search Party
