Abstract
A probabilistic model to estimate the number of misses on a set associative cache with an LRU replacement algorithm is introduced. Such type of modeling has been done by our group in previous works for sparse matrices with an uniform distribution of the non zero elements. In this paper we present new results focusing in different types of distributions that usually appear in some well-known real matrices suites, such as Harwell-Boeing or NEP.