Asymptotically optimal erasure-resilient codes for large disk arrays
Asymptotically optimal erasure-resilient codes for large disk arrays
复制标题
大型磁盘阵列的渐近最优抗擦除码
DOI：
10.1016/s0166-218x(99)00228-0
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
A. Ling
中科院分区：
文献类型：
--
作者：
Yeow Meng Chee;C. Colbourn;A. Ling
可靠性是大型磁盘阵列设计中的一个主要问题。Hellerstein等人率先研究了擦除弹性代码，即使在磁盘出现故障的情况下，也可以重建原始数据。本文从集合系统的角度研究了构造纠删码的问题。这导致了有限集合论中有趣的极值问题。其中一些问题的解决方案以众所周知的组合设计为特征。在其他情况下，组合设计可以给出这些问题的渐近精确解。因此，我们改进、扩展和推广了Hellerstein等人之前的结果。
Reliability is a major concern in the design of large disk arrays. Hellerstein et al. pioneered the study of erasure-resilient codes that allow one to reconstruct the original data even in the presence of disk failures. In this paper, we take a set systems view of the problem of constructing erasure-resilient codes. This leads to interesting extremal problems in finite set theory. Solutions to some of these problems are characterized by well-known combinatorial designs. In other instances, combinatorial designs are shown to give asymptotically exact solutions to these problems. As a result, we improve, extend and generalize previous results of Hellerstein et al.