Analytical modelling of linear codes
Authors: Ivan Šimeček, P. Kordík

High-performance,  cache hierarchy, analytical cache model.


It is really difficult to predict the cache behavior even for a simple program because every modern CPU use a complex memory hierarchy, which consists of levels of cache memories. One challenging task is to predict the exact number of cache misses during the sparse matrix-vector multiplication (shortly SpMV). Due to matrix sparsity, the memory access patterns are irregular and the utilization of a cache suffers from low spatial and temporal locality. It is really difficult to predict the cache behavior for all cases of input parameters. The cache misses data were also analyzed by means of data mining methods. This is the main topic of this paper and we will discuss the data mining analysis bellow in the more detailed form.


final version (in .PDF format)

BibTex entry:
author ="{\v S}ime{\v c}ek, I. and Kord{\'\i}k, P.",
title ="Cache Misses Prediction by Means of Data Mining Methods",
journal ="Proceedings of Workshop 2007",
publisher = {CTU},
address = {Prague},
year ="2007",
isbn ="978-80-01-03667-9",
Address ="Prague, Czech Republic"