In this work we present a methodology to build analytical models for codes with regular access patterns. These models can be applied to caches with an arbitrary ...

In this work we present a methodology to build analytical models for codes with regular access patterns. These models can be applied to caches with an arbitrary ...

In this work we present a methodology to build analytical models for codes with regular access patterns. These models can be applied to caches with an arbitrary ...

Automatic analytical modeling for the estimation of cache misses ; ISSN · 1089-795X ; Year of publication · 1999 ; Pages · 221-231 ; Type · Article.

Haystack is an analytical cache model that given a program computes the number of cache misses. The tool aims at providing the programmer with a better ...

This solution can enable program transformation choice at compile time to optimize cache misses. A tool implementing the approach has been developed and used ...

Since a cache miss takes more time than a cache hit, this can be used to estimate the number of hits/misses. This approach has the advantage of being ...

By representing the factors that affect cache performance, we develop an analytical model that gives miss rates for a given trace as a function of cache size, ...

Our ultimate goal is to automate the analysis of the equations to build an efficient code opti- mizer. We have implemented our algorithm to automatically.

In this paper a methodology to characterize the influence of cache misses on the performance of parallel applications is presented.