A data locality optimizing algorithm
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Cache miss equations: an analytical representation of cache misses
ICS '97 Proceedings of the 11th international conference on Supercomputing
Precise miss analysis for program transformations with caches of arbitrary associativity
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
An efficient solver for Cache Miss Equations
ISPASS '00 Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software
Data Caches in Multitasking Hard Real-Time Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Line Size Adaptivity Analysis of Parameterized Loop Nests for Direct Mapped Data Cache
IEEE Transactions on Computers
Tightening the bounds on feasible preemptions
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.00 |
In this work, we propose a fast and accurate approach to estimate the solution of Cache Miss Equations (CMEs), which is based on the use of sampling techniques. The results show that only a few seconds are required to analyze most of the SPECfp benchmarks with an error smaller than 0.01.