Set-associative cache simulation using generalized binomial trees

Abstract

Set-associative caches are widely used in CPU memory hierarchies, I/O subsystems, and file systems to reduce average access times. This article proposes an efficient simulation technique for simulating a group of set-associative caches in a single pass through the address trace, where all caches have the same line size but varying associativities and varying number of sets. The article also introduces a generalization of the ordinary binomial tree and presents a representation of caches in this class using the Generalized Binomial Tree (gbt). The tree representation permits efficient search and update of the caches. Theoretically, the new algorithm, GBF_LS, based on the gbt structure, always takes fewer comparisons than the two earlier algorithms for the same class of caches: all-associativity and generalized forest simulation. Experimentally, the new algorithm shows performance gains in the range of 1.2 to 3.8 over the earlier algorithms on address traces of the SPEC benchmarks. A related algorithm for simulating multiple alternative direct-mapped caches with fixed cache size, but varying line size, is also presented.

A new memory monitoring scheme for memory-aware scheduling and partitioning

“…In cache simulations, it has been shown that different cache sizes can be simulated in a single pass [15]. We emulate this technique in hardware to obtain multiple marginal gains while executing a process with a fixed cache configuration.…”

Workload Modeling for Computer Systems Performance Evaluation

“…The simplest approach is to perform a linear search. More efficient tree-based structures reduce the complexity from O(n m) to O(n log m) [666,22], where n is the length of the reference stream and m is the number of different addresses (note, however, that due to locality the cost of the simple algorithm is typically significantly lower than n m). Ding and Zhong give an approximate algorithm that reduces the time to O(n log log m) and the space to O(log m) [182].…”

A performance and power co-optimization approach for modern processors

“…These ratios can also be estimated with additional analytical cache models [7]. Alternatively, a single-pass, multiple configuration cache simulation [18] such as the Cheetah cache simulator that comes with SimpleScalar simulator can be used to facilitate the collection of cache miss ratios over a broader range of cache configurations in a single simulation. We further assumed Ô Ö ÔÖØ is equivalent to Ô Ò× Ñ ×× .…”