| 一种提高磁盘阵列重建效率的缓存替换算法; Cache replacement algorithm for improving RAID reconstruction efficiency | |
| 毛波 ; 吴素贞 ; 冯丹 | |
| 2011 | |
| 关键词 | 存储系统 磁盘阵列 数据重建 缓存管理 替换算法 storage system RAID data reconstruction cache management replacement algorithm |
| 英文摘要 | 磁盘的高故障率导致磁盘阵列重建成为数据处理中心一个经常性发生的事件.为了提高磁盘阵列的重建效率,提出了一种新的磁盘阵列缓存替换策略,即分支刷新算法,从缓存管理的角度加快磁盘阵列的重建过程.分支刷新算法淘汰脏数据到后备磁盘阵列时,优先淘汰重建区域附近的脏数据块,从而减少了磁头在重建区域和淘汰区域之间的移动开销,尽可能地保证重建过程的顺序性.仿真实验结果表明:对比传统的最近最少使用缓存淘汰算法,分支刷新算法显著地提高了磁盘阵列的重建效率.通过对4种负载的回放测试,分支刷新算法平均减少了41.6%的磁盘阵列重建时间和16.1%磁盘阵列重建过程的平均用户响应时间.; High failure rate of disks often leads to RAID(redundant array of independent disks) reconstruction a common case in large-scale data centers.To improve the efficiency of RAID reconstruction process from the perspective of the cache management,a new cache replacement algorithm,i.e.,branch destage algorithm,was proposed.The branch destage algorithm updated the dirty data that was close to the reconstruction region to the disks firstly,thus reducing the moving overhead of the disk head between the reconstruction region and the region that services the user request,and making the reconstruction process more sequential in disks.The simulation results show that the branch destage algorithm outperforms LRU(least recently used) significantly.By four real traces evaluations,the branch destage shortens the RAID reconstruction time by 41.6% and the average user response time during reconstruction by 16.1%,respectively.; 国家高技术研究发展计划资助项目(2009AA01A402);国家重点基础研究发展计划资助项目(2011CB302300) |
| 语种 | zh_CN |
| 内容类型 | 期刊论文 |
| 源URL | [http://dspace.xmu.edu.cn/handle/2288/122824]  |
| 专题 | 信息技术－已发表论文 |
| 推荐引用方式 GB/T 7714 | 毛波,吴素贞,冯丹. 一种提高磁盘阵列重建效率的缓存替换算法, Cache replacement algorithm for improving RAID reconstruction efficiency[J],2011. |
| APA | 毛波,吴素贞,&冯丹.(2011).一种提高磁盘阵列重建效率的缓存替换算法.. |
| MLA | 毛波,et al."一种提高磁盘阵列重建效率的缓存替换算法".(2011). |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论