On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes
On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes
复制标题
关于全长Reed-Solomon码修复方案的I/O成本
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Hien Chu
中科院分区：
文献类型：
--
作者：
Hoang Dau;I. Duursma;Hien Chu
在基于纠删码的分布式存储系统中，网络传输和磁盘读取是节点故障修复过程中最耗时的操作。里德 - 所罗门码是实际存储系统中应用最广泛的纠删码，近期对它的研究表明，专门针对这些码设计的高效修复方案可以显著减少恢复单个故障所花费的网络带宽。然而，I/O成本，即这些修复方案中执行的磁盘读取次数在很大程度上仍然未知。我们通过研究一些现有的全长里德 - 所罗门码修复方案的I/O成本，迈出了解决文献中这一差距的第一步。
Network transfer and disk read are the most time consuming operations in the repair process for node failures in erasure-code-based distributed storage systems. Recent developments on Reed-Solomon codes, the most widely used erasure codes in practical storage systems, have shown that efficient repair schemes specifically tailored to these codes can significantly reduce the network bandwidth spent to recover single failures. However, the I/O cost, that is, the number of disk reads performed in these repair schemes remains largely unknown. We take the first step to address this gap in the literature by investigating the I/O costs of some existing repair schemes for full-length Reed-Solomon codes
DOI：
10.1109/allerton.2017.8262840
发表时间：
2017-10
期刊：
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
影响因子：
--
作者：
Ameera Chowdhury;A. Vardy
通讯作者：
Ameera Chowdhury;A. Vardy