最优冗余双容错数据布局研究.pdfVIP

最优冗余双容错数据布局研究* 1 1 1 1 王 刚 ；刘晓光 ；董沙莎 ；刘 璟 （1. 南开大学 信息技术科学学院， 天津 300071 ） 摘要：在磁盘阵列双容错编码简单图表示法和双容错数据布局判定定理的基础上，提出了最优冗余布局定理，证 明了 full-2 码（对应完全图）的双容错数据布局的磁盘数下界，及最优冗余布局的构型。并给出了一种基于完全 图的完全 1-因子分解的 full-2 码最优冗余双容错数据布局构造方法，与其他双容错编码/布局相比，该方法生成的 布局具有高可靠性、更新代价最优、冗余率最优、低编码/解码复杂度等优点，且构造方法适应性更强。 关键词：计算机应用 双容错数据布局 简单图表示法 完全 1-因子分解 中图分类号：TP302 Research on Optimal Redundancy double-erasure-correcting Data Layout 1 1 1 1 WANG Gang ； LIU Xiao-guang ； DONG Sha-sha ； LIU Jing (1. Institute of Information Technical Science, Nankai University, Tianjin 300071) Abstract ：On the basis of the simple graph representation of RAID double-erasure-correcting codes and the double-erasure-correcting data layout judgement theorem, the optimal redundancy data layout theorem was proposed, and the theorem proves the lower bound of the number of disks of double-erasure-correcting data layout of full-2 code (corresponds to complete graph) and the structure properties of the optimal redundancy data layouts. A construction method for optimal redundancy double-erasure-correcting data layout based on perfect 1-factorization was presented. Compared with other double-erasure-correcting codes/data layouts, the data layouts produced by this method have high reliability, optimal update penalty, optimal redundancy and low encoding/decoding complexity. Moreover this construction method has high applicability. Key words ：Computer Application double-erasure-correcting data layout simple graph representation perfect 1-factorization 较早提出的双容错编码是 RAID6 结构，其可靠 * 0 引言