期刊文献+

一种高效的RAID6在线扩容机制 被引量:1

An efficient online expansion mechanism based on RAID6
下载PDF
导出
摘要 RAID存储系统具有良好的存取性能、优秀的可扩展性及相对低廉的成本,因而被广泛应用在各大企业的存储服务器中。文中基于RAID6的HS6扩容方案,设计一种HS6-O在线扩容优化方案,以提升HS6在线扩容时的效率。通过HS6-O分析在线扩容过程中用户访问I/O和扩容迁移I/O之间相互影响问题,设计并实现优先迁移访问度高的数据、读写I/O顺序排序和删除重复的写I/O操作三个方案,从而有效提升在线扩容时的效率。实验结果表明,相比于HS6,HS6-O在整体扩容效率上提升7.89%~19.15%,用户平均响应时间优化5.69%~22.12%,有着更好的在线扩容表现。 RAID storage system has good access performance,excellent scalability,and lower cost,so it is widely used in storage servers in major enterprises. An HS6-O online expansion optimization scheme is designed on the basis of HS6 expansion plan of RAID6 to improve the efficiency of HS6 online expansion. HS6-O is used to analyze the influence of mutual interaction between user access I/O and expansion migration I/O in the online expansion process,and three schemes of priority migration of highly accessible data,read/write I/O sequencing,and deletion of duplicate write I/O operation are designed and implemented,so as to effectively improve the efficiency of online expansion. The experimental results show that,in comparison with HS6,the overall expansion efficiency of HS6-O is increased by 7.89%~19.15%,and the average user response time of HS6-O is optimized by 5.69%~22.12%,which has better online expansion performance.
作者 李牧原 谢平 高原 LI Muyuan;XIE Ping;GAO Yuan(College of Computer,Qinghai Normal University,Xining 810016,China;State Key Laboratory of Tibetan Intelligent Information Processing and Application,Xining 810008,China;Key Laboratory of Internet of Things of Qinghai Province,Xining 810016,China;Academy of Plateau Science and Sustainability,Xining 810016,China)
出处 《现代电子技术》 2022年第18期31-36,共6页 Modern Electronics Technique
基金 青海省自然科学基金面上项目(2020-ZJ-926) 国家自然科学基金项目(61762075)。
关键词 RAID6 在线扩容 问题分析 方案设计 数据迁移 I/O调度 实验测试 RAID6 online expansion problem analysis scheme design data migration I/O scheduling experimental testing
  • 相关文献

参考文献2

二级参考文献13

共引文献9

同被引文献7

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部