Open this publication in new window or tab >>2022 (English)Report (Other academic)
Abstract [en]
Smarts-like sampled hardware simulation techniques achieve good accuracy by simulating many small portions of an application in detail. However, while this reduces the detailed simulation time, it results in extensive cache warming times, as each of the many simulation points requires warming the whole memory hierarchy. Adaptive Cache Warming reduces this time by iteratively increasing warming until achieving sufficient accuracy. Unfortunately, each time the warming increases, the previous warming must be redone, nearly doubling the required warming. We address re-warming by developing a technique to merge the cache states from the previous and additional warming iterations.
We address re-warming by developing a technique to merge the cache states from the previous and additional warming iterations. We demonstrate our merging approach on multi-level LRU cache hierarchy and evaluate and address the introduced errors. By removing warming redundancy, we expect an ideal 2× warming speedup when using our Cache Merging solution together with Adaptive Cache Warming. Experiments show that Cache Merging delivers an average speedup of 1.44×, 1.84×, and 1.87× for 128kB, 2MB, and 8MB L2 caches, respectively, with 95-percentile absolute IPC errors of only 0.029, 0.015, and 0.006, respectively. These results demonstrate that Cache Merging yields significantly higher simulation speed with minimal losses.
Publisher
p. 22
Keywords
functional warming, cache warming, cache merging
National Category
Computer Sciences
Research subject
Computer Systems Sciences
Identifiers
urn:nbn:se:uu:diva-484367 (URN)2022-007 (ISRN)
Funder
Knut and Alice Wallenberg Foundation, 2015.0153EU, Horizon 2020, 715283National Supercomputer Centre (NSC), Sweden, 2021/22-435Swedish National Infrastructure for Computing (SNIC), 2021/23-626Swedish Research Council, 2018-05973
2022-09-102022-09-102022-12-16Bibliographically approved