A CASCADING LATIN SCHEME TO TOLERATE DOUBLE DISK FAILURES IN RAID ARCHITECTURES  

作　　者：Lin Sheng Wang Gang Liu Xiaoguang Liu Jing 

机构地区：[1]Nankai-Baidu Joint Laboratory, College of Information and Technical Science, Nankai University, Tianjin 300071, China

出　　处：《Journal of Electronics(China)》2010年第2期243-249,共7页电子科学学刊（英文版）

基　　金：Supported in part by the National High Technology Re-search and Development Program of China (2008 AA01Z-401);the National Science Foundation of China (No.60903028);Doctoral Fund of Ministry of Education of China (20070055054);Science and Technology De-velopment Plan of Tianjin (08JCYBJC13000)

摘　　要：In recent years,a lot of XOR-based coding schemes have been developed to tolerate double disk failures in Redundant Array of Independent Disks (RAID) architectures,such as EVENODD-code,X-code,B-code and BG-HEDP. Despite those researches,the decades-old strategy of Reed-Solomon (RS) code remains the only popular space-optimal Maximum Distance Separable (MDS) code for all but the smallest storage systems. The reason is that all those XOR-based schemes are too difficult to be implemented,it mainly because the coding-circle of those codes vary with the number of disks. By contrast,the coding-circle of RS code is a constant. In order to solve this problem,we develop a new MDS code named Latin code and a cascading scheme based on Latin code. The cascading Latin scheme is a nearly MDS code (with only one or two more parity disks compared with the MDS ones). Nev-ertheless,it keeps the coding-circle of the basic Latin code (i.e. a constant) and the low encod-ing/decoding complexity similar to other parity array codes.In recent years, a lot of XOR-based coding schemes have been developed to tolerate double disk failures in Redundant Array of Independent Disks （RAID） architectures, such as EVENODD-code, X-code, B-code and BG-HEDP. Despite those researches, the decades-old strategy of Reed-Solomon （RS） code remains the only popular space-optimal Maximum Distance Separable （MDS） code for all but the smallest storage systems. The reason is that all those XOR-based schemes are too difficult to be implemented, it mainly because the coding-circle of those codes vary with the number of disks. By contrast, the coding-circle of RS code is a constant. In order to solve this problem, we develop a new MDS code named Latin code and a cascading scheme based on Latin code. The cascading Latin scheme is a nearly MDS code （with only one or two more parity disks compared with the MDS ones）. Nevertheless, it keeps the coding-circle of the basic Latin code （i.e. a constant） and the low encoding/decoding complexity similar to other parity array codes.

关 键 词：2-erasure code Redundant Array of Independent Disks (RAID) Latin square 

分 类 号：TP302.8[自动化与计算机技术—计算机系统结构]