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

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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信