{"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}
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.