返回
Composition-based Cache simulation for structure reorganization
DOI:10.1016/j.sysarc.2010.01.002.png)
摘要
En 中文
Finding the best data layout has been an ultimate goal of memory optimization. Even with data access profile, heuristic algorithms are needed to reorganize data layout for better locality. The best layout could be found by running the given application with all possible data layouts and selecting the best performing layout. This approach, however, can incur too much overhead, particulary when the number of possible layouts are too many. In this paper, we present a composition-based cache simulation for structure reorganization. Instead of running all possible layouts, we simulate only the primary subsets of layouts and compose the cache misses for all layouts by summing up the cache misses of component subsets. Our experiment with the composition-based cache simulation shows that the differences in the cache misses are within 10% of the full cache simulation for 4-way and 8-way set associative caches. In addition to the cache miss estimation, our heuristic algorithm takes account of the extra instruction overhead incurred by structure reorganization. Our experiment with several structure intensive benchmarks shows the 37% reduction in the LID read misses and the 28% reduction in the L2 read misses. As a result, the execution times are also reduced by 19% on average. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Field reorganization
Performance prediction
Cache simulation
Compiler optimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
3.0K
被引数:
4.2K
机构
引用论文
Rodent ultrasonic vocal interaction resolved with millimeter precision using hybrid beamforming
eLife
IF0

