[1] 罗象宏, 舒继武. 存储系统中的纠删码研究综述[J]. 计算机研究与发展, 2012, 49(1): 1-11. Luo Xianghong, Shu Jiwu. Summary of research for erasure code in storage system[J]. Journal of Compute Research and Development, 2012, 49(1): 1-11.[2] 宋杰, 李甜甜, 闫振兴, 等. 数据密集型计算中负载均衡的数据布局方法[J]. 北京邮电大学学报, 2013, 36 (4): 76-80. Song Jie, Li Tiantian, Yan Zhenxing, et al. Load balanced data layout approach in data intensive computing[J]. Journal of Beijing University of Posts and Telecommunications, 2013, 36 (4): 76-80.[3] Blaum M, Brady J, Bruck J, et al. EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures[J]. IEEE Transaction on Computers, 1995, 44(2): 192-202.[4] Li Mingqiang, Shu Jiwu. C-codes: cyclic lowest density MDS array codes constructed using starters or RAID 6[EB/OL]. (2012-08-04) [2013-03-20]. http://arxiv. org/abs/1104. 2547.[5] Corbett P, English B, Goel A, et al. Row diagonal parity for double disk failure[C]//Proceedings of the Third USENIX Conference on File and Storage Technologies. San Francisco: the USENIX Association, 2004: 1-14.[6] Wu Chentao, Wan Shenggang, He Xubin, et al. H-code: a hybrid MDS array code to optimize partial stripe writes in RAID-6[C]//Proceeding of the 25th IEEE Congress on International Parallel & Distributed Processing Symposium. USA: IEEE, 2011: 782-793.[7] Huang Cheng, Xu Lihao. STAR: an efficient coding scheme for correcting triple storage node failures[J]. IEEE Transaction on Computers, 2008, 57(7): 889-901.[8] 万武南, 吴震, 陈运, 等. RAID-EEOD: 一种基于3容错阵列码RAID数据布局研究[J]. 计算机学报, 2007, 30(10): 1-10. Wan Wunan, Wu Zhen, Chen Yun, et al. RAID-EEOD: the study of data placement based on toleration on triple failures array codes in RAID[J]. Chinese Journal of Computers, 2007, 30(10): 1-10.[9] Feng Guilian, Robert D, Feng Bao, et. al. New efficient MDS array codes for RAID, part I: reed-solomon-like codes for tolerating three disk filures[J]. IEEE Transaction on Computers, 2005, 54(9): 1071-1080. |