Pyramid Codes to the rescue
Roberta Barbi · 2016
In this paper, we study the tradeoffs between storage overhead, repair locality, and performance of erasure-correcting codes implemented in real-world distributed storage systems. In particular, we focus on a recent family of codes with locality called "pyramid codes" and compare it against Reed-Solomon codes with the aim of showing quantitative results demonstrating the benefits of small locality.