摘要
1 背景随着大容量存储系统需求的不断增加,RAID技术得到了越来越广泛的应用。对于使用简单的奇偶校验(RAID5)的RAID系统,平均无故障时间与磁盘数和修复时间成反比,因此当系统规模较大时,可靠性就会大大降低。为解决此问题,Muntz 和Lui提出了校验散布(parity declustering)思想:设置条纹大小小于磁盘总数,将重构负载均匀分布到所有磁盘,这就降低了故障状态下单个磁盘负载增加的比率,提高了重构性能,减少了重构时间,从而提高了阵列的可靠性。Holland和Gibson对校验散布思想进行了较为系统的研究,提出了理想布局的6条标准和采用不完全区组设计(BIBD)的布局构造方法。之后此领域的研究工作集中于设计更优的布局构造方法,主要成果有随机排列法,基于环的BIBD,DATUM,PRIME,RELPR,PDDL等。
Declustered data layouts have been proposed to improve reconstruction performance of raid system. But there has been no published work about data layout of network based raid. In this paper we present an algorithm, for optimizing data layout of network based raid. Compared with the old algorithm for optimizing data layout of host based raid, the layout generated by new algorithm has better reconstruction performance under network based raid circumstance. Finally, we discuss the implementation issue.
出处
《计算机科学》
CSCD
北大核心
2002年第5期11-13,88,共4页
Computer Science
基金
国家"八六三"高科技研究发展计划资助(项目编号863-306-ZD01-02-6)