{"title":"加速特殊映射的集群RAID重构","authors":"Svetlana Lazareva, G. Petrunin","doi":"10.1145/3579370.3594761","DOIUrl":null,"url":null,"abstract":"It is known that ZFS dRAID [2] provides random data blocks permutation and reconstruction speed up is getting its boost with this initial condition. The question we tried to answer is if there some special permutation that would optimize reconstruction speed at theoretical maximum. We introduce our solution with the usage of cyclic matrices of data layout as currently the best found way to get maximum benefit out from initial declustered RAID configuration.","PeriodicalId":180024,"journal":{"name":"Proceedings of the 16th ACM International Conference on Systems and Storage","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Speeding up reconstruction of declustered RAID with special mapping\",\"authors\":\"Svetlana Lazareva, G. Petrunin\",\"doi\":\"10.1145/3579370.3594761\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is known that ZFS dRAID [2] provides random data blocks permutation and reconstruction speed up is getting its boost with this initial condition. The question we tried to answer is if there some special permutation that would optimize reconstruction speed at theoretical maximum. We introduce our solution with the usage of cyclic matrices of data layout as currently the best found way to get maximum benefit out from initial declustered RAID configuration.\",\"PeriodicalId\":180024,\"journal\":{\"name\":\"Proceedings of the 16th ACM International Conference on Systems and Storage\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 16th ACM International Conference on Systems and Storage\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3579370.3594761\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 16th ACM International Conference on Systems and Storage","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3579370.3594761","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Speeding up reconstruction of declustered RAID with special mapping
It is known that ZFS dRAID [2] provides random data blocks permutation and reconstruction speed up is getting its boost with this initial condition. The question we tried to answer is if there some special permutation that would optimize reconstruction speed at theoretical maximum. We introduce our solution with the usage of cyclic matrices of data layout as currently the best found way to get maximum benefit out from initial declustered RAID configuration.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
