New Wide Locally Recoverable Codes with Unified Locality

TL;DR

This paper introduces UniLRC, a new wide locally recoverable code that unifies locality considerations to optimize fault tolerance and performance in distributed storage systems, addressing limitations of existing LRCs.

Contribution

The paper proposes UniLRC, a novel wide LRC construction that unifies locality considerations, achieving optimal fault tolerance and overcoming key limitations of prior codes.

Findings

UniLRC significantly improves reliability over existing wide LRCs.

UniLRC demonstrates better performance in system evaluations.

The prototype shows practical feasibility in real-world clusters.

Abstract

Wide Locally Recoverable Codes (LRCs) have recently been proposed as a solution for achieving high reliability, good performance, and ultra-low storage cost in distributed storage systems. However, existing wide LRCs struggle to balance optimal fault tolerance and high availability during frequent system events. By analyzing the existing LRCs, we reveal three limitations in the LRC construction which lay behind the non-optimal overall performance from multiple perspectives, including non-minimum local recovery cost, non cluster-topology-aware data distribution, and non XOR-based local coding. Thanks to the flexible design space offered by the locality property of wide LRCs, we present UniLRC, which unifies locality considerations in code construction. UniLRC achieves the optimal fault tolerance while overcoming the revealed limitations. We implement UniLRC prototype and conduct comprehensive theoretical and system evaluations, showing significant improvements in reliability and performance over existing wide LRCs deployed in Google and Azure clusters.