{"title":"一种改进的自适应预取算法","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":"{\"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}","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}
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.