The CORE Storage Primitive: Cross-Object Redundancy for Efficient Data Repair & Access in Erasure Coded Storage

TL;DR

The paper introduces CORE, a storage primitive combining erasure codes with RAID-4 like parity, significantly improving data repair efficiency and access speed in distributed storage systems.

Contribution

It proposes a novel, practical storage primitive that enhances erasure code performance using simple techniques, validated through analytical study and real-world benchmarks.

Findings

CORE reduces bandwidth usage by 50% during recovery.

CORE is up to 75% faster in single node failure recovery.

Performance gains are 15% and 60% for double node failures.

Abstract

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 engineering alternative, exploring the use of simple and mature techniques -juxtaposing a standard erasure code with RAID-4 like parity. We carry out an analytical study to determine the efficacy of this approach over traditional as well as some novel codes. We build upon this study to design CORE, a general storage primitive that we integrate into HDFS. We benchmark this implementation in a proprietary cluster and in EC2. Our experiments show that compared to traditional erasure codes, CORE uses 50% less bandwidth and is up to 75% faster while recovering a single failed node, while the gains are respectively 15% and 60% for double node failures.