In Situ Caching using Combined TTL-FIFO Algorithm

Gasydech Lergchinnaboot, Peraphon Sophatsathit, Saranya Maneeroj
{"title":"In Situ Caching using Combined TTL-FIFO Algorithm","authors":"Gasydech Lergchinnaboot, Peraphon Sophatsathit, Saranya Maneeroj","doi":"10.1109/ICCC47050.2019.9064459","DOIUrl":null,"url":null,"abstract":"This research proposes an algorithmic cache arrangement scheme to efficiently utilize existing hardware that are currently plagued with memory wall problem. The proposed scheme exploits straightforwardness of First-in, First-out (FIFO) scheduling algorithm and in situ placement technique. FIFO allows the proposed scheme a fair caching of processes. In situ replacement economically utilizes spaces by replacing the expired process with a new process in the same memory space without flushing. This combination helps reduce operating overheads, which in turn lower power consumption. The benefits of their simplicity and hardware implementable will accelerate operational speed that eventually closes the gap between processing speed and memory access/retrieval speed, thereby lessens the memory wall problem.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"41 1","pages":"437-441"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC47050.2019.9064459","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This research proposes an algorithmic cache arrangement scheme to efficiently utilize existing hardware that are currently plagued with memory wall problem. The proposed scheme exploits straightforwardness of First-in, First-out (FIFO) scheduling algorithm and in situ placement technique. FIFO allows the proposed scheme a fair caching of processes. In situ replacement economically utilizes spaces by replacing the expired process with a new process in the same memory space without flushing. This combination helps reduce operating overheads, which in turn lower power consumption. The benefits of their simplicity and hardware implementable will accelerate operational speed that eventually closes the gap between processing speed and memory access/retrieval speed, thereby lessens the memory wall problem.
结合TTL-FIFO算法的原位缓存
本研究提出一种演算法的快取排列方案,以有效利用现有硬体中存在的记忆墙问题。该方案利用了先进先出(FIFO)调度算法的直接性和原位放置技术。FIFO允许提议的方案公平地缓存进程。就地替换通过在同一内存空间中用新进程替换过期进程而不进行冲洗,从而经济地利用了空间。这种组合有助于降低操作开销,从而降低功耗。它们的简单性和硬件可实现的优点将加快操作速度,最终缩小处理速度和内存访问/检索速度之间的差距,从而减少内存墙问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信