• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Reconsidering Single Disk Failure Recovery for Erasure Coded Storage Systems: Optimizing Load Balancing in Stack-Level
【24h】

Reconsidering Single Disk Failure Recovery for Erasure Coded Storage Systems: Optimizing Load Balancing in Stack-Level

机译：重新考虑擦除编码存储系统的单磁盘故障恢复：优化堆栈级的负载平衡

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

摘要

The fast growing of data scale encourages the wide employment of data disks with large storage capacity. However, a mass of data disks’ equipment will in turn increase the probability of data loss or damage, because of the appearance of various kinds of disk failures. To ensure the intactness of the hosted data, modern storage systems usually adopt erasure codes, which can recover the lost data by pre-storing a small amount of redundant information. As the most common case among all the recovery mechanisms, the single disk failure recovery has been receiving intensive attentions for the past few years. However, most of existing works still take the stripe-level recovery as their only consideration, and a considerable performance improvement on single failure disk reconstruction in the stack-level (i.e., a group of rotated stripes) is missed.   To seize this potential improvement, in this paper we systematically study the problem of single failure recovery in the stack-level. We first propose two recovery mechanism based on greedy algorithm to seek for the near-optimal solution (BP-Scheme and STP-Scheme) for any erasure array code in stack level, and further design a rotated recovery algorithm (RR-Algorithm) to eliminate the size of required memory. Through a rigorous statistic analysis and intensive evaluation on a real system, the results show that BP-Scheme gains 3.4 to 38.9 percent (the average is 21.2 percent) higher recovery speed than Khan's Scheme and 3.4 to 34.8 percent (the average is 19.1 percent) higher recovery speed than Luo's U-Scheme, while STP-Scheme owns 3.4 to 46.9 percent (the average is 25.15 percent) and 3.4 to 41.1 percent (the average is 22.3 percent) higher recovery speed than Khan's Scheme and Luo's U-Scheme, respectively.
机译：数据规模的快速增长鼓励广泛使用具有大存储容量的数据磁盘。但是，由于各种磁盘故障的出现，大量数据磁盘的设备将反过来增加数据丢失或损坏的可能性。为了确保托管数据的完整性，现代存储系统通常采用擦除码，该擦除码可以通过预存储少量冗余信息来恢复丢失的数据。作为所有恢复机制中最常见的情况，单磁盘故障恢复在过去几年中受到了广泛关注。但是，大多数现有工作仍将条带级恢复作为其唯一考虑因素，并且错过了堆栈级（即一组旋转的条带）在单个故障磁盘重建上的显着性能改进。为了抓住这种潜在的改进，在本文中，我们系统地研究了堆栈级别的单个故障恢复问题。首先，我们提出了两种基于贪婪算法的恢复机制，以寻求栈级任何擦除阵列代码的近似最优解（BP-Scheme和STP-Scheme），然后进一步设计一种轮转恢复算法（RR-Algorithm）来消除所需内存的大小。通过对真实系统进行严格的统计分析和深入评估，结果表明，BP-Scheme的恢复速度比Khan's Scheme高3.4至38.9％（平均为21.2％），而3.4-34.8％（平均为19.1％）。恢复速度比Luo的U-Scheme高，而STP-Scheme的恢复速度分别比Khan's Scheme和Luo的U-Scheme高3.4％至46.9％（平均为25.15％）和3.4％至41.1％（平均为22.3％）。 。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号