• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes
【24h】

A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes

机译：用于读取和下载有效的分布式存储代码的Pi带设计框架

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

摘要

Erasure codes are being extensively deployed in distributed storage systems instead of replication to achieve fault tolerance in a storage efficient manner. While traditional erasure codes are storage efficient, they can result in a significant increase in the amount of data access and downloaded during rebuilding of failed or otherwise unavailable nodes. In this paper, we present a new framework, which we call piggybacking, for constructing distributed storage codes that are efficient in the amount of data read and downloaded during rebuilding, while meeting requirements arising out of system considerations in data centers—maximum-distance-separability (MDS), high-rate, and a small number of so-called substripes. Under this setting, to the best of our knowledge, piggyback codes achieve the minimum average amount of data access and downloaded during rebuilding among all existing explicit solutions. The piggybacking framework also offers a rich design space for constructing codes for a variety of other settings. In particular, we construct codes that require minimum amount of data access and downloaded for rebuilding among all existing solutions for: 1) binary MDS array codes with more than two parities and 2) MDS codes with the smallest locality during rebuilding. In addition, we show how piggybacking can be employed to enable efficient repair of parity nodes in codes that address the rebuilding of only systematic nodes. The basic idea behind the piggybacking framework is to take multiple instances of existing codes and add carefully designed functions of the data from one instance to the others. This framework provides 25% to 50% savings in the average amount of data access and downloaded during rebuilding depending on the choice of the code parameters.
机译：擦除代码正在广泛地部署在分布式存储系统中，而不是进行复制，以便以存储有效的方式实现容错能力。尽管传统的擦除代码具有高效的存储能力，但是它们可以导致在重建故障节点或其他情况下不可用的节点期间，数据访问量和下载量的显着增加。在本文中，我们提出了一个称为背piggy式的新框架，该框架可用于构建分布式存储代码，该代码在重建过程中可以有效读取和下载大量数据，同时满足数据中心系统考虑的最大距离要求。可分离性（MDS），高速率和少量所谓的子带。在此设置下，据我们所知，在所有现有的显式解决方案中，搭载代码均实现了最小的平均数据访问量和重建期间的下载量。搭载框架还为构建各种其他设置的代码提供了丰富的设计空间。特别是，我们构建的代码需要最少的数据访问量，并为以下所有现有解决方案提供重建下载：1）具有两个以上奇偶校验的二进制MDS阵列代码，以及2）重建期间局部性最小的MDS代码。此外，我们展示了如何利用piggy带以仅解决系统节点重建的代码来实现奇偶校验节点的有效修复。 back带框架背后的基本思想是采用多个现有代码实例，并将经过精心设计的数据功能从一个实例添加到另一个实例。根据代码参数的选择，此框架可在重建期间平均减少25％到50％的数据访问和下载量。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号