Loading...
Please wait, while we are loading the content...
Similar Documents
Modeling Set Associative Caches Behavior for Irregular Computations (1998)
| Content Provider | CiteSeerX |
|---|---|
| Author | Fraguela, Basilio B. Fraguela, B. B. Doallo, R. Zapata, E. L. Zapata, Emilio L. |
| Abstract | While much work has been devoted to the study of cache behavior during the execution of codes with regular access patterns, little attention has been paid to irregular codes. An important portion of these codes are scientific applications that handle compressed sparse matrices. In this work a probabilistic model for the prediction of the number of misses on a K-way associative cache memory considering sparse matrices with a uniform or banded distribution is presented. Two different irregular kernels are considered: the sparse matrix-vector product and the transposition of a sparse matrix. The model was validated with simulations on synthetic uniform matrices and banded matrices from the Harwell-Boeing collection. Keywords: Sparse matrix, irregular computation, cache performance, probabilistic model. 1 Introduction Sparse matrices are in the kernel of many numerical applications. Their compressed storage [2], which permits both operations and memory savings, generates irregular access ... |
| File Format | |
| Journal | ACM Performance Evaluation Review (Proc. SIGMETRICS/PERFORMANCE'98 |
| Publisher Date | 1998-01-01 |
| Access Restriction | Open |
| Subject Keyword | Compressed Sparse Matrix Irregular Computation K-way Associative Cache Memory Regular Access Pattern Important Portion Little Attention Harwell-boeing Collection Synthetic Uniform Matrix Compressed Storage Cache Behavior Memory Saving Much Work Sparse Matrix-vector Product Scientific Application Cache Performance Many Numerical Application Generates Irregular Access Different Irregular Kernel Introduction Sparse Matrix Set Associative Cache Behavior Probabilistic Model Sparse Matrix |
| Content Type | Text |
