分布式存储系统Hadamard最小存储再生码的新修复策略

2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2013-12-18 DOI:10.1109/IWSDA.2015.7458385

Xiaohu Tang, Bin Yang, Jie Li

{"title":"分布式存储系统Hadamard最小存储再生码的新修复策略","authors":"Xiaohu Tang, Bin Yang, Jie Li","doi":"10.1109/IWSDA.2015.7458385","DOIUrl":null,"url":null,"abstract":"To be considered for the Special Session celebrating Prof. Kumar's birthday. The newly presented (k + 2, k) Hadamard minimum storage regenerating (MSR) code is the first class of high rate storage code with optimal repair properly for all single node failures. In this paper, we propose a new simple repair strategy, which can considerably reduce the computation load of the node repair in contrast to the original one.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"New repair strategy of Hadamard minimum storage regenerating code for distributed storage system\",\"authors\":\"Xiaohu Tang, Bin Yang, Jie Li\",\"doi\":\"10.1109/IWSDA.2015.7458385\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To be considered for the Special Session celebrating Prof. Kumar's birthday. The newly presented (k + 2, k) Hadamard minimum storage regenerating (MSR) code is the first class of high rate storage code with optimal repair properly for all single node failures. In this paper, we propose a new simple repair strategy, which can considerably reduce the computation load of the node repair in contrast to the original one.\",\"PeriodicalId\":371829,\"journal\":{\"name\":\"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWSDA.2015.7458385\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSDA.2015.7458385","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

将在庆祝库马尔教授生日的特别会议上审议。新提出的(k + 2, k) Hadamard最小存储再生码(MSR)是一类对所有单节点故障都能进行最优修复的高速率存储码。在本文中，我们提出了一种新的简单修复策略，与原来的修复策略相比，它可以大大减少节点修复的计算量。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

New repair strategy of Hadamard minimum storage regenerating code for distributed storage system

To be considered for the Special Session celebrating Prof. Kumar's birthday. The newly presented (k + 2, k) Hadamard minimum storage regenerating (MSR) code is the first class of high rate storage code with optimal repair properly for all single node failures. In this paper, we propose a new simple repair strategy, which can considerably reduce the computation load of the node repair in contrast to the original one.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)

自引率

0.00%

发文量