English

Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation

Distributed, Parallel, and Cluster Computing 2020-11-23 v3

Abstract

We propose repair pipelining, a technique that speeds up the repair performance in general erasure-coded storage. By carefully scheduling the repair of failed data in small-size units across storage nodes in a pipelined manner, repair pipelining reduces the single-block repair time to approximately the same as the normal read time for a single block in homogeneous environments. We further design different extensions of repair pipelining algorithms for heterogeneous environments and multi-block repair operations. We implement a repair pipelining prototype, called ECPipe, and integrate it as a middleware system into two versions of Hadoop Distributed File System (HDFS) (namely HDFS-RAID and HDFS-3) as well as Quantcast File System (QFS). Experiments on a local testbed and Amazon EC2 show that repair pipelining significantly improves the performance of degraded reads and full-node recovery over existing repair techniques.

Keywords

Cite

@article{arxiv.1908.01527,
  title  = {Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation},
  author = {Xiaolu Li and Zuoru Yang and Jinhong Li and Runhui Li and Patrick P. C. Lee and Qun Huang and Yuchong Hu},
  journal= {arXiv preprint arXiv:1908.01527},
  year   = {2020}
}

Comments

28 pages. Accepted by ACM Transactions on Storage

R2 v1 2026-06-23T10:39:35.615Z