New Wide Locally Recoverable Codes with Unified Locality

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Xu, Liangliang, Tang, Fengming, Chen, Tingting, Li, Qiliang, Lyu, Min, Ge, Gennian
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913840982130688
author Xu, Liangliang
Tang, Fengming
Chen, Tingting
Li, Qiliang
Lyu, Min
Ge, Gennian
author_facet Xu, Liangliang
Tang, Fengming
Chen, Tingting
Li, Qiliang
Lyu, Min
Ge, Gennian
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2505_06819
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle New Wide Locally Recoverable Codes with Unified Locality
Xu, Liangliang
Tang, Fengming
Chen, Tingting
Li, Qiliang
Lyu, Min
Ge, Gennian
Distributed, Parallel, and Cluster Computing
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.
title New Wide Locally Recoverable Codes with Unified Locality
topic Distributed, Parallel, and Cluster Computing
url https://arxiv.org/abs/2505.06819