首页> 外文会议>Parallel and Distributed Computing and Networks >UNCOMPLICATED RECOVERING ALGORITHM BASED ON DUAL PARITY PLACEMENT SCHEME IN DISK ARRAY SYSTEMS
【24h】

UNCOMPLICATED RECOVERING ALGORITHM BASED ON DUAL PARITY PLACEMENT SCHEME IN DISK ARRAY SYSTEMS

机译:磁盘阵列系统中基于双重奇偶校验方案的不复杂恢复算法

获取原文

摘要

This paper proposes an improved and intuitional dual parity placement scheme to enhance the reliability of a disk array system. The presented scheme can tolerate up to two disk failures by using two types of parity information in a matrix of disk block partitions. This scheme can reduce the occurrences of the bottleneck partially because the diagonal parity stripe units are uniformly distributed over the disk array. The encoding algorithm of this scheme is simple and many of the steps of the recovering algorithms can be executed in parallel. This scheme enables a disk array to recover rapidly from any two disk failures, with a single algorithm applied straightforwardly.
机译:本文提出了一种改进且直观的双重奇偶校验放置方案,以提高磁盘阵列系统的可靠性。通过在磁盘块分区矩阵中使用两种类型的奇偶校验信息,提出的方案最多可以容忍两个磁盘故障。该方案可以部分地减少瓶颈的发生,因为对角奇偶校验条带单元均匀地分布在磁盘阵列上。该方案的编码算法很简单,恢复算法的许多步骤可以并行执行。该方案使磁盘阵列能够从任何两个磁盘故障中快速恢复,只需直接应用一种算法即可。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号