检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张燕[1,2] 朱云峰[1,2] 牛芳[1,2] 许胤龙[1,2]
机构地区:[1]中国科学技术大学计算机科学与技术学院,安徽合肥230027 [2]安徽省高性能计算重点实验室,安徽合肥230027
出 处:《计算机应用与软件》2015年第6期104-108,共5页Computer Applications and Software
摘 要:实际的分布式存储系统面临着频繁的磁盘故障。为了保障数据可靠性,纠删码被广泛地部署在大规模存储系统中。在基于纠删码的存储系统中,快速有效地修复故障磁盘上的数据对于维护数据可靠性有重要意义。研究最重要的容两错纠删码——RDP(Row-diagonal parity)编码的磁盘故障修复问题,优化修复过程中磁盘访问的连续性。提出的单磁盘故障修复方案在保证读取数据量最小的前提下,最大程度避免了磁盘数据的随机读取,保持数据读取的连续性。通过在实际的分布式存储系统中实验,验证了该修复方案的实际性能,证实该算法可以很好地改善混合修复方案的随机读取引起的修复速度下降问题,最终提高了修复效率。Real distributed storage systems face frequent disk failures.In order to ensure data reliability,erasure codes are widely deployed to large-scale storage systems.In an erasure coded-based storage system,to quickly and efficiently recover the lost data in failed disk has great significance to maintaining the data reliability.In this paper,we study the disk failure recovery problem for storage systems with RDP,one of the most important double-fault tolerant erasure codes,and seek to optimise the disk access sequentiality during the failure recovery.The recovery scheme for single disk failure we proposed avoids to the greatest extent the random reads of disk data on the premise of ensuring the minimum amount of data being read,and also preserve the sequentiality of data reads.Through the experiments in a real distributed storage system we validate the practical performance of the proposed recovery scheme,it approves that our recovery algorithm can well meliorate the problem of recovery speed slowing down in hybrid recovery scheme caused by random disk accesses and eventually improves recovery efficiency.
分 类 号:TP302[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3