一种新的基于动态集的cache分区缓存映射方案

Tsung Lee, Hsiang-Hua Tsou
{"title":"一种新的基于动态集的cache分区缓存映射方案","authors":"Tsung Lee, Hsiang-Hua Tsou","doi":"10.1109/YCICT.2009.5382458","DOIUrl":null,"url":null,"abstract":"In this research, we designed a novel cache mapping scheme for dynamic set-based cache partitioning. The cache mapping scheme facilitates allocation of any non-power-of-2 number of physical cache segments as a private cache to each process. An efficient near-optimal cache partitioning algorithm was designed for capturing working sets of running processes. Transparent cache reconfiguration was designed to enable immediately continuing process execution after cache repartitioning is computed. Experimental results validate its effectiveness in improving the overall hit ratio, the total number of memory accesses, and overall program performance with small number of communications.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"265 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A novel cache mapping scheme for dynamic set-based cache partitioning\",\"authors\":\"Tsung Lee, Hsiang-Hua Tsou\",\"doi\":\"10.1109/YCICT.2009.5382458\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this research, we designed a novel cache mapping scheme for dynamic set-based cache partitioning. The cache mapping scheme facilitates allocation of any non-power-of-2 number of physical cache segments as a private cache to each process. An efficient near-optimal cache partitioning algorithm was designed for capturing working sets of running processes. Transparent cache reconfiguration was designed to enable immediately continuing process execution after cache repartitioning is computed. Experimental results validate its effectiveness in improving the overall hit ratio, the total number of memory accesses, and overall program performance with small number of communications.\",\"PeriodicalId\":138803,\"journal\":{\"name\":\"2009 IEEE Youth Conference on Information, Computing and Telecommunication\",\"volume\":\"265 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE Youth Conference on Information, Computing and Telecommunication\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/YCICT.2009.5382458\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YCICT.2009.5382458","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在本研究中,我们设计了一种新的基于动态集的缓存分区缓存映射方案。缓存映射方案有助于将任何非2次幂的物理缓存段作为私有缓存分配给每个进程。设计了一种高效的近乎最优的缓存分区算法,用于捕获运行进程的工作集。透明缓存重新配置的目的是在计算缓存重新分区后立即继续执行进程。实验结果验证了该方法在提高整体命中率、总内存访问数和整体程序性能方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A novel cache mapping scheme for dynamic set-based cache partitioning
In this research, we designed a novel cache mapping scheme for dynamic set-based cache partitioning. The cache mapping scheme facilitates allocation of any non-power-of-2 number of physical cache segments as a private cache to each process. An efficient near-optimal cache partitioning algorithm was designed for capturing working sets of running processes. Transparent cache reconfiguration was designed to enable immediately continuing process execution after cache repartitioning is computed. Experimental results validate its effectiveness in improving the overall hit ratio, the total number of memory accesses, and overall program performance with small number of communications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信