• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2008, Vol. 30 ›› Issue (1): 113-118.

• 论文 • 上一篇    下一篇

基于简单常见模式编码(S-FPC)的压缩Cache层次设计

田新华 张民选   

  • 出版日期:2008-01-01 发布日期:2010-05-19

  • Online:2008-01-01 Published:2010-05-19

摘要:

本文基于简单常见模式压缩编码设计了一种新颖的片内压缩Cache层次结构。在该结构中,L1数据Cache和L2Cache都以压缩格式保存数据,但具有不同的布局。其中,L1数据Cache的布局能触发部分Cache行预取,同时又能避免普通预取技术可能导致的Cache污染增加以及带宽浪费的现象,而且没有预取缓冲开销。实验结果表明,与传统Cache结构相比,本文的设计方案可以显著增加L1数据Cache和L2Cache的有效容量,并且不会增加L1数据Cache的访存延迟,对L1数据Cache平均能增加33%的有效容量,减少L1数据Cach he失效率达21%,程序执行速度提高了13%。

关键词: 简单常见模式压缩 压缩Cache层次 部分Cache行预取

Abstract:

In this paper, we propose a novel compressed cache hierarchy that uses a unified compression algorithm called Simple Frequent Pattern Compression (S-  FPC), in both the L1 data cache and the L2 cache. Our scheme does not increase the L1 cache access latency, and still results in a significant increasee in the cache capacities of the L1 data cache and the L2 cache. The layout of the compressed data in the L1 data cache enables partial cache line prefetching in the L1 data cache, and does not introduce the prefetch buffer overhead,cache pollution and bandwith waste. In comparison to a baseline cache h ierarchy that does not support data compression in the cache, on average, our cache hierarchy design increases the average L1 cache capacity by about 33 %, reduces the data cache miss rate by 21%, and speeds up program execution by 13%.

Key words: S-FPC, compressed cache, partial cache line prefetching