论文标题
优化分层突袭中裁员的分配
Optimizing Apportionment of Redundancies in Hierarchical RAID
论文作者
论文摘要
大型磁盘阵列被组织成存储节点 - SNS或砖块，并带有自己的现金RAID控制器，用于多个磁盘。 SN级别的擦除编码是通过奇偶校验或芦苇 - 固体代码获得的。分层突袭 - HRAID-提供了跨SNS的额外编码水平，例如，在SN级别的sn级和r在SN级别的检查条p，q。失败的磁盘和SN不能替换，重建是通过约束来完成的，例如，用于磁盘故障的P和Q覆盖P和Q，而R对于SN失败。对于给定的总冗余水平，我们使用近似的可靠性分析方法和蒙特卡洛模拟来探索用于内部内部冗余的止回块的更好分配。我们的研究表明，较高的MTTDL（平均时间到数据损失）是通过在SN内含量而不是SN Inter SN水平上关联的可靠性来实现的，这与IBM研究相反。
Large disk arrays are organized into storage nodes -- SNs or bricks with their own cashed RAID controller for multiple disks. Erasure coding at SN level is attained via parity or Reed-Solomon codes. Hierarchical RAID -- HRAID -- provides an additional level of coding across SNs, e.g., check strips P, Q at intra-SN level and R at the inter-SN level. Failed disks and SNs are not replaced and rebuild is accomplished by restriping, e.g., overwriting P and Q for disk failures and R for an SN failure. For a given total redundancy level we use an approximate reliability analysis method and Monte-Carlo simulation to explore the better apportionment of check blocks for intra- vs inter-SN redundancy. Our study indicates that a higher MTTDL -- Mean-Time-to-Data-Loss -- is attained by associating higher reliability at intra-SN level rather than inter-SN level, which is contrary to that of an IBM study.
