Back to Search
Start Over
Memory Hierarchy Performance Prediction for Blocked Sparse Algorithms.
- Source :
-
Parallel Processing Letters . Sep99, Vol. 9 Issue 3, p347. 14p. - Publication Year :
- 1999
-
Abstract
- Nowadays the performance gap between processors and main memory makes an efficient usage of the memory hierarchy necessary for good program performance. Several techniques have been proposed for this purpose. Nevertheless most of them consider only regular access patterns, while many scientific and numerical applications give place to irregular patterns. A typical case is that of indirect accesses due to the use of compressed storage formats for sparse matrices. This paper describes an analytic approach to model both regular and irregular access patterns. The application modeled is an optimized sparse matrix-dense matrix product algorithm with several levels of blocking. Our model can be directly applied to any memory hierarchy consisting of K-way associative caches. Results are shown for several current microprocessor architectures. [ABSTRACT FROM AUTHOR]
- Subjects :
- *ALGORITHMS
*SPARSE matrices
Subjects
Details
- Language :
- English
- ISSN :
- 01296264
- Volume :
- 9
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Parallel Processing Letters
- Publication Type :
- Academic Journal
- Accession number :
- 9624450
- Full Text :
- https://doi.org/10.1142/S0129626499000323