Predicting the cache miss ratio of loop-nested array references
Harper, J.S., Kerbyson, D.J. and Nudd, G.R. (1997) Predicting the cache miss ratio of loop-nested array references. Technical Report. Department of Computer Science, Coventry, UK.
- Published Version
The time a program takes to execute can be massively affected by the efficiency with which it utilizes cache memory. Moreover the cache-miss behavior of a program can be highly unpredictable, in that small changes to input parameters can cause large changes in the number of misses. In this paper we present novel analytical models of the cache behavior of programs consisting mainly of array operations inside nested loops, for direct-mapped caches. The models are used to predict the miss-ratios of three example loop nests; the results are shown to be largely within ten percent of simulated values. A significant advantage is that the calculation time is proportional to the number of array references in the program, typically several orders of magnitude faster than traditional cache simulation methods.
|Item Type:||Monograph (Technical Report)|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Science > Computer Science|
|Depositing User:||Mr Ebrahim Ardeshir|
|Date Deposited:||04 Jan 2012 09:20|
|Last Modified:||01 Nov 2012 18:06|
Actions (login required)