Title
Thou code: a triple-erasure-correcting horizontal code with optimal update complexity
Abstract
Taking advantage of consuming low storage resource, erasure codes have been widely adopted by various storage systems, e.g., HDFS, Ceph, and Microsoft Azure, to provide reliability. With the rapid expansion of data storage, it becomes increasingly significant to protect against co-occurring failure events. RAID-6 codes are capable of addressing the issue of multi-disk faults to some extent, while they are prone to catastrophic data loss if two disks are held on the same shelf and the shelf encounters some unrecoverable failures. Therefore, triple disk failure tolerant (3DFT) coding, which increases tolerance for concurrent faults, is increasingly popular. Existing 3DFT codes either have low computational efficiency, e.g., Reed–Solomon (RS) codes and minimum storage regeneration (MSR) codes, or high write overhead, e.g., Cauchy RS (CRS) codes, STAR codes, and RTP codes. In this paper, we propose a kind of lowest-density XOR-based 3DFT codes, named Thou codes, which have lowest storage overhead, high encoding and decoding performance, and optimal write overhead. Thou codes are constructed by an efficient searching approach over a cluster of matrices derived by Liberation codes, a sort of lowest-density RAID-6 codes. Experimental results demonstrate that Thou codes have high encoding and decoding efficiency and outperform three state-of-the-art 3DFT codes in write performance. Compared to STAR codes and RTP codes, Thou codes can reduce write overhead averagely by 21.9% and 26.8%, respectively, under real I/O workloads experiments.
Year
DOI
Venue
2022
10.1007/s11227-021-04271-9
The Journal of Supercomputing
Keywords
DocType
Volume
Erasure codes, Triple disk failure tolerant (3DFT) codes, Lowest density, Write overhead
Journal
78
Issue
ISSN
Citations 
7
0920-8542
0
PageRank 
References 
Authors
0.34
12
4
Name
Order
Citations
PageRank
Ningjing Liang100.34
Xingjun Zhang28134.06
Heng Chen303.72
Changjiang Zhang400.34