acrp (Adaptive cache replacement policy):用于缓存管理的动态替换策略

O. Olakanmi
{"title":"acrp (Adaptive cache replacement policy):用于缓存管理的动态替换策略","authors":"O. Olakanmi","doi":"10.17781/P0017","DOIUrl":null,"url":null,"abstract":"The discovery of memory access time as one of the major design issues in the processor has increased effort in the development of different cache replacement policies to manage what to be the content of caches in both uniprocessor and multiprocessor. This is to improve the overall performance of the processor. Most time the potential benefits of these policies are not instantaneous due to the varying nature of the workloads. Therefore, it is difficult to identify which particular policy to apply during cache’s content replacement. In this paper, an adaptive replacement technique using the minimum threshold value of the improvement factor of cache, which was analytically obtained, is proposed in order to explore the combine merits of fundamental replacement policies and strikes a minimum balance with their demerits. ACRP approach uses the threshold values of improvement factor obtained from the analytic modeling to determine when the current replacement policy’s performance becomes or getting worse, the ACRP switches to another replacement policy from the pool of replacement policy. Specifically, the ACRP approach solves the problem associated with wrong usage of replacement policy and reduces processor cache miss rate caused by wrong evictions.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ADAPTIVE CACHE REPLACEMENT POLICY (ACRP): A DYNAMIC REPLACEMENT POLICY FOR CACHE MANAGEMENT\",\"authors\":\"O. Olakanmi\",\"doi\":\"10.17781/P0017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The discovery of memory access time as one of the major design issues in the processor has increased effort in the development of different cache replacement policies to manage what to be the content of caches in both uniprocessor and multiprocessor. This is to improve the overall performance of the processor. Most time the potential benefits of these policies are not instantaneous due to the varying nature of the workloads. Therefore, it is difficult to identify which particular policy to apply during cache’s content replacement. In this paper, an adaptive replacement technique using the minimum threshold value of the improvement factor of cache, which was analytically obtained, is proposed in order to explore the combine merits of fundamental replacement policies and strikes a minimum balance with their demerits. ACRP approach uses the threshold values of improvement factor obtained from the analytic modeling to determine when the current replacement policy’s performance becomes or getting worse, the ACRP switches to another replacement policy from the pool of replacement policy. Specifically, the ACRP approach solves the problem associated with wrong usage of replacement policy and reduces processor cache miss rate caused by wrong evictions.\",\"PeriodicalId\":211757,\"journal\":{\"name\":\"International journal of new computer architectures and their applications\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of new computer architectures and their applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17781/P0017\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of new computer architectures and their applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17781/P0017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

内存访问时间是处理器的主要设计问题之一,这增加了开发不同缓存替换策略的工作量,以管理单处理器和多处理器中缓存的内容。这是为了提高处理器的整体性能。大多数情况下,由于工作负载的性质不同,这些策略的潜在好处并不是即时的。因此,很难确定在缓存内容替换期间应用哪个特定策略。本文提出了一种利用解析得到的缓存改进因子最小阈值的自适应替换技术,以探索基本替换策略的综合优点,并与它们的缺点取得最小平衡。ACRP方法利用分析建模得到的改进因子阈值来确定当前替换策略的性能变差或变差时,ACRP从替换策略池中切换到另一个替换策略。具体来说,ACRP方法解决了错误使用替换策略的问题,降低了错误驱逐导致的处理器缓存丢失率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
ADAPTIVE CACHE REPLACEMENT POLICY (ACRP): A DYNAMIC REPLACEMENT POLICY FOR CACHE MANAGEMENT
The discovery of memory access time as one of the major design issues in the processor has increased effort in the development of different cache replacement policies to manage what to be the content of caches in both uniprocessor and multiprocessor. This is to improve the overall performance of the processor. Most time the potential benefits of these policies are not instantaneous due to the varying nature of the workloads. Therefore, it is difficult to identify which particular policy to apply during cache’s content replacement. In this paper, an adaptive replacement technique using the minimum threshold value of the improvement factor of cache, which was analytically obtained, is proposed in order to explore the combine merits of fundamental replacement policies and strikes a minimum balance with their demerits. ACRP approach uses the threshold values of improvement factor obtained from the analytic modeling to determine when the current replacement policy’s performance becomes or getting worse, the ACRP switches to another replacement policy from the pool of replacement policy. Specifically, the ACRP approach solves the problem associated with wrong usage of replacement policy and reduces processor cache miss rate caused by wrong evictions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Introduction to Sociology of Online Social Networks in Morocco. Data Acquisition Process: Results and Connectivity Analysis SLA-BASED RESOURCE ALLOCATION WITHIN CLOUD NETWORKING ENVIRONMENT Proportional Weighted Round Robin: A Proportional Share CPU Scheduler inTime Sharing Systems Variation Effect of Silicon Film Thickness on Electrical Properties of NANOMOSFET CAUSALITY ISSUES IN ORIENTATION CONTROL OF AN UNDER-ACTUATED DRILL MACHINE
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1