期刊文献+

Managing Data-Objects in Dynamically Reconfigurable Caches

Managing Data-Objects in Dynamically Reconfigurable Caches
原文传递
导出
摘要 The widening gap between processor and memory speeds makes cache an important issue in the computer system design. Compared with work set of programs, cache resource is often rare. Therefore, it is very important for a computer system to use cache efficiently. Toward a dynamically reconfigurable cache proposed recently, DOOC (Data- Object Oriented Cache), this paper proposes a quantitative framework for analyzing the cache requirement of data-objects, which includes cache capacity, block size, associativity and coherence protocol. And a kind of graph coloring algorithm dealing with the competition between data-objects in the DOOC is proposed as well. Finally, we apply our approaches to the compiler management of DOOC. We test our approaches on both a single-core platform and a four-core platform. Compared with the traditional caches, the DOOC in both platforms achieves an average reduction of 44.98% and 49.69% in miss rate respectively. And its performance is very close to the ideal optimal cache. The widening gap between processor and memory speeds makes cache an important issue in the computer system design. Compared with work set of programs, cache resource is often rare. Therefore, it is very important for a computer system to use cache efficiently. Toward a dynamically reconfigurable cache proposed recently, DOOC (Data- Object Oriented Cache), this paper proposes a quantitative framework for analyzing the cache requirement of data-objects, which includes cache capacity, block size, associativity and coherence protocol. And a kind of graph coloring algorithm dealing with the competition between data-objects in the DOOC is proposed as well. Finally, we apply our approaches to the compiler management of DOOC. We test our approaches on both a single-core platform and a four-core platform. Compared with the traditional caches, the DOOC in both platforms achieves an average reduction of 44.98% and 49.69% in miss rate respectively. And its performance is very close to the ideal optimal cache.
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2010年第2期232-245,共14页 计算机科学技术学报(英文版)
基金 supported in part by the National Natural Science Foundation of China under Grant Nos.60621003,60873014.
关键词 CACHE data-object data reuse data-object oriented cache (DOOC) graph coloring cache, data-object, data reuse, data-object oriented cache (DOOC), graph coloring
  • 相关文献

参考文献1

二级参考文献29

  • 1McKinley Kathryn S, Carr Steve, Tseng Chau-Wen. Improving data locality with loop transformations [J]. ACM Trans on Programming Languages and Systems, 1996, 18 (4) : 424-453.
  • 2Seznec Andre. A case for two-way skewed-associative caches [C] //Proc of the 20th Annual Int Syrup on Computer Architecture (ISCA'93). New York: ACM, 1993: 169-178.
  • 3Abella Jaume, Gonzalez Antonio. Heterogeneous way-size cache [C] //Proc of the 20th Annual Int Conf on Supercomputing (ICS'06). New York: ACM, 2006: 239- 248.
  • 4Qureshi Moinuddin K, Thompson David, Patt Yale N. The v-way cache: Demand based assoeiativity via global replacement [C] //Proe of the 32nd Annual Int Syrup on Computer Architecture (ISCA'05). Washington, DC: IEEE Computer Society, 2005:544-555.
  • 5Varadarajan Keshavan, Nandy S K, Sharda Vishal, et al.Molecular caches: A caching structure for dynamic creation of application-specific heterogeneous cache regions [C]//Proc of the 39th Annual IEEE/ACM Int Symp on Microarchitecture (MICRO'06). Washington, DC: IEEE Computer Society, 2006:433-442.
  • 6Qureshi Moinuddin K, Jaleel Aamer, Patt Yale N, et al. Adaptive insertion policies for high performance caching [C] //Proc of the 34th Annual Int Syrup on Computer Architecture (ISCA'07). New York: ACM, 2007:381-391.
  • 7Witchel E, Asanovic K. The span cache: Software controlled tag checks and cache line size [C] //Proc of the 28th Workshop on Complexity Effective Design ( ISCA ). Washington, DC: IEEE Computer Society, 2001:1-12.
  • 8Gonzalez Antonio, Aliagas Carlos, Valero Mateo. A data cache with multiple caching strategies tuned to different types of locality [C] //Proc of the 9th Int Conf on Supercomputing (ICS'95). New York: ACM, 1995:338-347.
  • 9Kim S, Vijaykrishnan N, Kandemir M, et al. Power-aware partitioned cache architectures [C] //Proc of the 2001 Int Symp on Low Power Electronics and Design (ISLPED'01). New York: ACM, 2001:64-67.
  • 10Lee Hsien-Hsin S, Smelyanskiy Mikhail, Tyson Gary S, et al. Stack value file: Custom microarchitecture for the stack [C] //Proc of the 7th Int Symp on High Performance Computer Architecture ( HPCA'01 ). Washington, DC: IEEE Computer Society, 2001:5.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部