【24h】

Ordering disks for double erasure codes

机译:订购光盘的双重擦除代码

获取原文

摘要

Dish arrays have been designed with two competing goals in mind, the ability to reconstruct erased disks (reliability), and the speed with which information can be read, written, and reconstructed (performance). The substantial loss in performance of write operations as reliability requirements increase has resulted in an emphasis on performance at the expense of reliability. This has proved acceptable given the relatively small members of disks in current disk arrays. We develop a method for improving the performance of write operations in disk arrays capable of correcting any double erasure, by ordering the columns of the erasure code to minimize the amount of parity information that requires updating. For large disk arrays, this affords a method to support the reliability needed without the generally accepted loss of performance.

机译:

在设计磁盘阵列时,要牢记两个相互竞争的目标:重建擦除磁盘的能力(可靠性)以及读取,写入和重建信息的速度(性能)。随着可靠性要求的提高,写入操作的性能大大降低,从而导致了对性能的重视,而牺牲了可靠性。考虑到当前磁盘阵列中的磁盘成员相对较小,这已被证明是可以接受的。我们开发了一种方法,该方法可通过对擦除代码的各列进行排序以最大程度地减少需要更新的奇偶校验信息量,从而提高磁盘阵列中写入操作的性能,从而能够纠正任何双重擦除。对于大型磁盘阵列,这提供了一种在不普遍认可的性能损失的情况下支持所需可靠性的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号