The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
The CORE Storage Primitive: Cross-Object Redundancy for Efficient Data Repair & Access in Erasure Coded Storage
[article]
2013
arXiv
pre-print
Erasure codes are an integral part of many distributed storage systems aimed at Big Data, since they provide high fault-tolerance for low overheads. However, traditional erasure codes are inefficient on reading stored data in degraded environments (when nodes might be unavailable), and on replenishing lost data (vital for long term resilience). Consequently, novel codes optimized to cope with distributed storage system nuances are vigorously being researched. In this paper, we take an
arXiv:1302.5192v4
fatcat:rwljkazcc5azfi7khqpsy7vc5i