{"title":"单信息磁盘故障恢复的磁盘读取下界和偶数的一种恢复方案(p, 3)","authors":"Shangyao Huang, Hanxu Hou, Xiangshou Yu","doi":"10.1109/IWSDA46143.2019.8966126","DOIUrl":null,"url":null,"abstract":"EVENODD(p, 3) are binary MDS array codes with p information columns and three parity columns. When an information column fails, we can recover the failed information bits by downloading some bits from p−1 surviving information columns and three parity columns. In this paper, we derive a lower bound on the total number of bits downloaded during the repair process. Moreover, we present an algorithm for the single information recovery of EVENODD(p, 3). The results show that the total number of bits downloaded during the repair process of our algorithm is less than that of the existing algorithm.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Lower Bound on Disk Reads for Single Information Disk Failure Recovery and One Recovery Scheme for EVENODD(p, 3)\",\"authors\":\"Shangyao Huang, Hanxu Hou, Xiangshou Yu\",\"doi\":\"10.1109/IWSDA46143.2019.8966126\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"EVENODD(p, 3) are binary MDS array codes with p information columns and three parity columns. When an information column fails, we can recover the failed information bits by downloading some bits from p−1 surviving information columns and three parity columns. In this paper, we derive a lower bound on the total number of bits downloaded during the repair process. Moreover, we present an algorithm for the single information recovery of EVENODD(p, 3). The results show that the total number of bits downloaded during the repair process of our algorithm is less than that of the existing algorithm.\",\"PeriodicalId\":326214,\"journal\":{\"name\":\"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWSDA46143.2019.8966126\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSDA46143.2019.8966126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Lower Bound on Disk Reads for Single Information Disk Failure Recovery and One Recovery Scheme for EVENODD(p, 3)
EVENODD(p, 3) are binary MDS array codes with p information columns and three parity columns. When an information column fails, we can recover the failed information bits by downloading some bits from p−1 surviving information columns and three parity columns. In this paper, we derive a lower bound on the total number of bits downloaded during the repair process. Moreover, we present an algorithm for the single information recovery of EVENODD(p, 3). The results show that the total number of bits downloaded during the repair process of our algorithm is less than that of the existing algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
