• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >A New Parity-Based Migration Method to Expand RAID-5
【24h】

A New Parity-Based Migration Method to Expand RAID-5

机译：一种新的基于奇偶校验的扩展RAID-5的迁移方法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

To expand the capacity of a RAID-5 array with additional disks, data have to be migrated between disks to leverage extra space and performance gain. Conventional methods for expanding RAID-5 are very slow because they have to migrate almost all existing data and recalculate all parity blocks. This paper proposes a new online expansion method for RAID-5, named parity-based migration (PBM). This method only migrates blocks that form a special parallelogram with one side consisting of only parity blocks. When adding $m$ disks to a RAID-5 with $n$ disks, PBM achieves the minimal data migration which only needs to move $m/(n+m)$ of all data blocks. Furthermore, no parity blocks are recalculated during the expansion. After expansion, although the RAID is not a standard RAID-5 distribution, the parity blocks are distributed evenly. Experimental results based on extensive trace-driven show that, on average, PBM can reduce the time of expansion by 73.6 percent while only reduces the performance of the expanded RAID by 1.83 percent when compared with Multiple-Device (MD), a toolkit provided in Linux kernel.
机译：为了使用更多磁盘扩展RAID-5阵列的容量，必须在磁盘之间迁移数据以利用额外的空间和性能提升。扩展RAID-5的常规方法非常慢，因为它们必须迁移几乎所有现有数据并重新计算所有奇偶校验块。本文提出了一种新的RAID-5在线扩展方法，称为基于奇偶校验的迁移（PBM）。此方法仅迁移形成特殊平行四边形且其一侧仅由奇偶校验块组成的块。将 $ m $ 磁盘添加到具有 $ n $ 磁盘，PBM实现了最小的数据迁移，只需要移动 $ m /（n + m） $ 所有数据块。此外，在扩展期间不会重新计算奇偶校验块。扩展后，尽管RAID不是标准的RAID-5分发，但奇偶校验块均匀地分发。基于大量跟踪驱动的实验结果表明，与多设备（MD）提供的工具包相比，PBM平均可以减少扩展时间73.6％，而仅将扩展RAID的性能降低1.83％。 Linux内核。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号