检索规则说明: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] Gao Shuai;Liang Jie;Wu Si;Xu Yinlong(School of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, Anhui, China;Key Laboratory of High Performance Computing,Anhui Province, Hefei 230027, Anhui, China)
机构地区:[1]中国科学技术大学计算机科学与技术学院,安徽合肥230027 [2]安徽省高性能计算重点实验室,安徽合肥230027
出 处:《计算机应用与软件》2016年第8期121-125,189,共6页Computer Applications and Software
摘 要:随着用户数据和新型应用的爆炸式增长,存储系统需要更大的存储空间和更好的I/O性能,导致对原有存储系统进行扩容。研究基于RDP编码的存储系统的扩容问题。已有的扩容方案RS6、SDM等没有考虑到校验块的轮转部署与负载均衡等因素,导致扩容后的系统中各磁盘的负载不平衡。在基于校验块轮转部署的基础上,提出一种新型RDP扩容方案RSR。基于RSR的扩容方案,扩容后的系统中各磁盘上的数据块与校验块的分布都是均衡的。通过在Disksim上的一系列模拟实验证明,RSR的数据块和校验块迁移量上达到了最优,并且在扩容后的系统访问性能也接近于最优。With the explosive growth of user data and new applications, storage system requires bigger storage space and better I/Operformance, which leads to the expansion of original system. In the paper we study the RDP code-based storage system expansion. Existingexpansion schemes of RS6 and SDM, etc. do not take into account the rotation-based deployment and load balance of the parity blocks, thisresult in the unbalance of the load in each disk after the expansion of system. We propose a new RDP expansion approach called RSR basedon the rotation-based deployment of parity blocks. The system expanded by RSR will have a balanced distribution of data and parity blocks ineach disk. After a series of simulation experiments on Disksim, we prove that the RSR minimises the migration of the data and parity blocks.Furthermore, the expanded system has a near optimal performance on access performance.
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38