• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Parity-Switched Data Placement: Optimizing Partial Stripe Writes in XOR-Coded Storage Systems
【24h】

Parity-Switched Data Placement: Optimizing Partial Stripe Writes in XOR-Coded Storage Systems

机译：奇偶校验数据放置：在XOR编码存储系统中优化部分条带写入

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

摘要

Erasure codes tolerate disk failures by pre-storing a low degree of data redundancy, and have been commonly adopted in current storage systems. However, the attached requirement on data consistency exaggerates partial stripe write operations and thus seriously downgrades system performance. Previous works to optimize partial stripe writes are relatively limited, and a general mechanism is still absent. In this paper, we propose a Parity-Switched Data Placement (PDP) to optimize partial stripe writes for any XOR-coded storage system. PDP first reduces the write operations by arranging continuous data elements to join a common parity element's generation. To achieve a deeper optimization, PDP further explores the generation orders of parity elements and makes any two continuous data elements associate with a common parity element. Intensive evaluations show that for tested erasure codes, PDP reduces up to 31.9 percent of write operations and further increases the write speed by up to 59.8 percent when compared with two state-of-the-art data placement methods.
机译：擦除代码通过预存储低程度的数据冗余来容忍磁盘故障，并且已在当前存储系统中普遍采用。但是，对数据一致性的附加要求夸大了部分条带写入操作，从而严重降低了系统性能。先前优化部分条带写入的工作相对有限，并且仍然缺少通用机制。在本文中，我们提出了奇偶校验交换数据放置（PDP）来优化任何XOR编码存储系统的部分条带写入。 PDP首先通过安排连续的数据元素以加入公共奇偶校验元素的生成来减少写操作。为了实现更深入的优化，PDP进一步探索了奇偶校验元素的生成顺序，并使任何两个连续的数据元素与一个公共奇偶校验元素相关联。深入的评估表明，与两种最新的数据放置方法相比，对于经过测试的擦除码，PDP最多可减少31.9％的写操作，并进一步提高高达59.8％的写速度。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号