关键词: 计算机系统结构, 双容错数据布局, 简单图表示法, 完全1-因子分解

Abstract: On the basis of the simple graph presentation of Redundant Arrays of Inexpensive Disks (RAID) doubleerasurecorrecting codes and the judgment theorem of doubleerasurecorrecting data layout, the optimal redundancy data layout theorem was proposed. This theorem proves the lower bound of the number of disks of doubleerasurecorrecting data layout of full-2 code (corresponding to complete graph), it also proves the structure features of the optimal redundancy data layout. A construction method for optimal redundancy doubleerasurecorrecting data layout based on perfect 1-factorization was also presented. Compared with other methods of doubleerasurecorrecting codes/data layouts, the reliability of this method is higher, the update penalty and the redundancy are optimal, and the complexity of encoding/decoding is lower. Moreover the applicability of this construction method is high.

Key words: computer systems organization, doubleerasurecorrecting data layout, simple graph representation, perfect 1-factorization