Title :
An Improved Adaptive Cache Prefetch Algorithm
Author :
Limei Tang ; Suxia Xing ; Tianhua Chen
Author_Institution :
Coll. of Comput. & Inf. Eng., Beijing Technol. & Bus. Univ., Beijing, China
Abstract :
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 multi-user environment´s I/O performance optimization.
Keywords :
cache storage; I-O data transmission rate; I-O scheduling algorithm; I-O transfer rate; adaptive cache prefetch algorithm; capacity dual-cache structure; disk array performance; memory address dispersion; multiuser access; multiuser environment I-O performance optimization; prefetch performance problem; sliding window algorithm; Adaptive algorithms; Algorithm design and analysis; Heuristic algorithms; Nickel; Prefetching; Reliability; Time factors; disk array; prefetch; sequence; the cache;
Conference_Titel :
Computational Intelligence and Design (ISCID), 2012 Fifth International Symposium on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-4673-2646-9
DOI :
10.1109/ISCID.2012.215