华中科技大学学报（自然科学版）2011，Vol.39Issue(6)：54-57,4.
一种提高磁盘阵列重建效率的缓存替换算法
Cache replacement algorithm for improving RAID reconstruction efficiency
摘要
Abstract
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.关键词
存储系统/磁盘阵列/数据重建/缓存管理/替换算法Key words
storage system/ RAID/ data reconstruction/ cache management/ replacement algorithm分类
信息技术与安全科学引用本文复制引用
毛波,吴素贞,冯丹..一种提高磁盘阵列重建效率的缓存替换算法[J].华中科技大学学报（自然科学版）,2011,39(6):54-57,4.基金项目
国家高技术研究发展计划资助项目(2009AA01A402) （2009AA01A402）
国家重点基础研究发展计划资助项目(2011CB302300). （2011CB302300）
