Cache Probabilistic Modeling for Basic Sparse Algebra Kernels Involving Matrices with a Non Uniform Distribution

Authors:
Ramón Doallo;Basilio B. Fraguela;Emilio L. Zapata
Affiliations:
-;-;-
Venue:
EUROMICRO '98 Proceedings of the 24th Conference on EUROMICRO - Volume 1
Year:
1998

Citing 0
Cited 5

Efficient Representation Scheme for Multidimensional Array Operations

IEEE Transactions on Computers
Efficient Data Parallel Algorithms for Multidimensional Array Operations Based on the EKMR Scheme for Distributed Memory Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Efficient Data Compression Methods for Multidimensional Sparse Array Operations Based on the EKMR Scheme

IEEE Transactions on Computers
Efficient Data Distribution Schemes for EKMR-Based Sparse Arrays on Distributed Memory Multicomputers

The Journal of Supercomputing
Cache behavior modelling for codes involving banded matrices

LCPC'06 Proceedings of the 19th international conference on Languages and compilers for parallel computing

Quantified Score

Hi-index	0.02

Visualization

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.