An Improved Adaptive Cache Prefetch Algorithm

Limei Tang, Suxia Xing, Tianhua Chen
{"title":"An Improved Adaptive Cache Prefetch Algorithm","authors":"Limei Tang, Suxia Xing, Tianhua Chen","doi":"10.1109/ISCID.2012.215","DOIUrl":null,"url":null,"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.","PeriodicalId":246432,"journal":{"name":"2012 Fifth International Symposium on Computational Intelligence and Design","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fifth International Symposium on Computational Intelligence and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID.2012.215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

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.
一种改进的自适应预取算法
I/O调度算法对磁盘阵列的性能有着至关重要的影响。在磁盘阵列系统中,如何提高I/O传输速率一直是一个关键问题。本文提出了一种改进的自适应缓存预取算法,以解决由于内存地址分散而导致的多用户访问预取性能低的问题。采用基于队列的滑动窗口算法获得稳定的命中率,采用容量双缓存结构缩短空缓存时间。在多用户请求的情况下,改进的自适应缓存预取算法可以获得稳定的命中率,减少并行访问缓存时间,实现高性能预取和快速自适应响应。实验分析表明,改进后的自适应预取算法系统的I/O数据传输率比基本自适应预取算法提高了60%,平均响应时间减少了60%。针对多用户自适应预取算法性能不佳的问题,改进的自适应缓存预取算法是多用户环境下I/O性能优化的理想算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信