An improved adaptive cache prefetch algorithm
I/O scheduling algorithm has a crucial impact on the performance of disk arrays. In the disk array system, how to improve I/O transfer rate has been a critical issue. This paper presents an improved adaptive cache prefetch algorithm to solve low prefetch performance problem of multi-user access, caused by the memory address dispersion. Using sliding window algorithm based on the queue to get a stable hit rate, and using capacity dual-cache structure to shorten vacated cache time. In case of multi-user request, the improved adaptive cache prefetch algorithm can get a stable hit rate and reduce the parallel access cache time to achieve high performance prefetch,and fast adaptive response. The experimental analysis shows that the I/O data transmission rate for improved adaptive algorithm system is higher than the basic adaptive prefetch algorithm by 60％, while the average response time is reduced by 60％. To solve the low performance of adaptive algorithm for multi-user prefetch, improved adaptive cache prefetch algorithm is ideal for multiuser environments I/O performance optimization.
disk array the cache prefetch sequence
Limei Tang Suxia Xing Tianhua Chen
College of Computer and Information Engineering Beijing Technology and Business University Beijing 100048, China
国际会议
杭州
英文
833-836
2012-10-28（万方平台首次上网日期，不代表论文的发表时间）