存储系统容编码简介.ppt

存储系统容错编码简介 内容 RAID、容错编码 Reed-Solomon编码 二进制线性码 阵列码 利用组合数学工具构造容错编码 内容 RAID、容错编码 Reed-Solomon编码 二进制线性码 阵列码 利用组合数学工具构造容错编码 RAID Redundant Arrays of Inexpensive DisksRedundant Arrays of Independent Disks 容量 性能 可靠性 Chen, P. M., Lee, E. K., Gibson, G. A., Katz, R. H., and Patterson, D. A. “RAID: high-performance, reliable secondary storage.” ACM Computing Surveys 26(2), pp. 143-185, June 1994. RAID结构 Data Striping RAID结构 Redundancy RAID结构 编码：d1 XOR d2 XOR … XOR dn = p 解码：di = p XOR d1 XOR … XOR di-1 XOR di-1 … 解码：pnew = p XOR diold XOR dinew RAID结构 data unit、parity unit RAID5：更新负载均匀分布 RAID结构 RAID5的读写 RAID5的读写 RAID5布局 Edward K. Lee, Randy H. Katz, “The Performance of Parity Placements in Disk Arrays”, IEEE Transactions on Computers, vol. 42 no. 6, pp. 651-664, 1993. RAID5布局 RAID5布局 RAID0 Hui-I Hsiao and David J. DeWitt, “Chained declustering: A new availability strategy for multiprocessor database machines”, Technical Report CS TR 854, University of Wisconsin, Madison, June 1989. RAID0 Gang Wang, Xiaoguang Liu, Sheng Lin, Guangjun Xie, Jing Liu, “Constructing Double- and Triple-erasure-correcting Codes with High Availability Using Mirroring and Parity Approaches”, ICPADS2007. What is an Erasure Code? J. S. Plank, “Erasure Codes for Storage Applications”, Tutorial of the 4th Usenix Conference on File and Storage Technologies, San Francisco, CA, Dec, 2005. When are they useful? Anytime you need to tolerate failures. When are they useful? Anytime you need to tolerate failures. When are they useful? Anytime you need to tolerate failures. When are they useful? Anytime you need to tolerate failures. When are they useful? Anytime you need to tolerate failures. When are they useful? Anytime you need to tolerate failures. When are they useful? Anytime you need to tolerate failures. Terms Definitions Number of data disks: n Number of coding disks: m Rate of a code: R = n/(n+m) Identifiable Failure: “Erasure” The problem, once again Issues with Erasure Codin