• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Parallel and Distributed Systems >Data Locality Exploitation in Cache Compression
【24h】

Data Locality Exploitation in Cache Compression

机译：缓存压缩中的数据位置利用

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

State-of-the-art cache compression methods compress multiple neighboring blocks often called as a sector into a single 64-byte block to effectively enlarge the cache capacity. A compressed block is created by storing 4-byte data patterns as dictionary entries and pointers to them for compressing multiple blocks. Furthermore, sector-based tag array maintains one-to-one mapping between tag and data arrays in order to preserve conventional cache access mechanism. We present a dual-block compression method which uses an entire uncompressed block as dictionary and compresses multiple neighboring blocks in a separate companion block to provide a larger dictionary for better compression ratios. Furthermore, we introduce the concept of buddy-set which expands the compressible candidate blocks across two adjacent cache sets to enlarge the scope of compression. Performance evaluations for the last-level cache show that the proposed dual-block compression with expansion of compressible candidates in the buddy-set can enlarge the cache by an average of 60% while current state-of-art compression proposal has only 29% improvement. The proposed scheme demonstrates 8.9% speedup over caches without compression.
机译：最先进的缓存压缩方法压缩多个相邻块通常称为扇区，进入单个64字节块以有效地放大高速缓存容量。通过将4字节数据模式存储为字典条目和指向它们来创建压缩块，用于压缩多个块。此外，基于扇区的标签阵列在标签和数据阵列之间保持一对一的映射，以便保留传统的高速缓存访​​问机制。我们介绍了一种双块压缩方法，该方法使用整个未压缩块作为字典，并在单独的伴随块中压缩多个相邻块，以提供更好的压缩比的较大词典。此外，我们介绍了Buddy-Set的概念，它在两个相邻的缓存集中扩展了可压缩候选块，以放大压缩的范围。最后级别缓存的性能评估表明，建议的双块压缩通过伙伴集中的可压缩候选的扩展可以平均扩大缓存，而当前的最先进的压缩建议只有29 ％ 改进。该方案展示了8.9 ％的加速在没有压缩的缓存上。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号