Abstract
Understanding and improving the memory hierarchy behavior is one of the most important challenges in current architectures. Analytical models are a good approach for this, but they have been traditionally limited by either their restricted scope of application or their lack of accuracy. Most models can only predict the cache behavior of codes that generate regular access patterns. The Probabilistic Miss Equation(PME) model is able nevertheless to model accurately the cache behavior for codes with irregular access patterns due to data-dependent conditionals or indirections. Its main limitation is that it only considers irregular access patterns that exhibit an uniform distribution of the accesses. In this work, we extend the PME model to enable to analyze more realistic and complex irregular accesses. Namely, we consider indirections due to the compressed storage of most real banded matrices.
This work has been supported in part by the Ministry of Science and Technology of Spain under contract TIN 2004-07797-C02-02 and Xunta de Galicia under contract PGIDIT 03TIC10502PR.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Uhlig, R., Mudge, T.N.: Trace-driven memory simulation: A survey. ACM Comput. Surv. 29(2), 128–170 (1997)
Ammons, G., Ball, T., Larus, J.R.: Exploiting Hardware Performance Counters with Flow and Context Sensitive Profiling. In: SIGPLAN Conf. on Programming Language Design and Implementation, pp. 85–96 (1997)
Ghosh, S., Martonosi, M., Malik, S.: Cache Miss Equations: A Compiler Framework for Analyzing and Tuning Memory Behavior. ACM Transactions on Programming Languages and Systems 21(4), 702–745 (1999)
Chatterjee, S., et al.: Exact Analysis of the Cache Behavior of Nested Loops. In: Proceedings of the ACM SIGPLAN’01 Conf. on Programming Language Design and Implementation, June 2001, pp. 286–297. ACM Press, New York (2001)
Doallo, R., Fraguela, B.B., Zapata, E.L.: Cache probabilistic modeling for basic sparse algebra kernels involving matrices with a non uniform distribution. In: Proceedings of EUROMICRO Conference, Engineering Systems and Software for the Next Decade, August, pp. 345–348 (1998)
Cascaval, C.: Compile-time Performance Prediction of Scientific Programs. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign (2000)
Andrade, D., Fraguela, B.B., Doallo, R.: Analytical modeling of codes with arbitrary data-dependent conditional structures. Journal of Systems Architecture 52, 394–410 (2006)
Andrade, D., Fraguela, B.B., Doallo, R.: Precise automatable analytical modeling of the cache behavior of codes with indirections. ACM Transactions on Architecture and Code Optimization (Accepted for publication, 2006)
Andrade, D., et al.: Automated and accurate cache behavior analysis for codes with irregular access patterns. In: Proceedings of Workshop on Compilers for Parallel Computers, A Coruña, Spain, pp. 179–193 (2006)
Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Oxford Science Publications, Oxford (1986)
Barrett, R., et al.: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. Society for Industrial and Applied Mathematics, Philadalphia (1994), citeseer.ist.psu.edu/article/barrett93templates.html
Chow, E., Saad, Y.: Tools and Libraries for Parallel Sparse Matrix Computations (1995)
Lin, Y., Padua, D.A.: On the automatic parallelization of sparse and irregular fortran programs. In: Languages, Compilers, and Run-Time Systems for Scalable Computers, Pittsburgh, pp. 41–56 (1998)
Duff, I.S., Grimes, R.G., Lewis, J.G.: Users’ guide for the Harwell-Boeing sparse matrix collection (Release I). Technical Report CERFACS TR-PA-92-96 (1992)
Bai, Z., Day, D., Demmel, J., Dongarra, J.: A test matrix collection for non-Hermitian eigenvalue problems, release 1.0 (1996)
Vera, X., Xue, J.: Efficient and accurate analytical modeling of whole-program data cache behavior. IEEE Transactions on Computers 53(5), 547–566 (2004)
Ladner, R.E., Fix, J.D., LaMarca, A.: Cache performance analysis of traversals and random accesses. In: Proceeding of the annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, Maryland, United States, pp. 613–622. Society for Industrial and Applied Mathematics, Philadelphia (1999)
Mitchell, N., Carter, L., Ferrante, J.: A modal model of memory. In: Alexandrov, V.N., et al. (eds.) Computational Science - ICCS 2001. LNCS, vol. 2073, pp. 81–96. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Andrade, D., Fraguela, B.B., Doallo, R. (2007). Cache Behavior Modelling for Codes Involving Banded Matrices. In: Almási, G., Caşcaval, C., Wu, P. (eds) Languages and Compilers for Parallel Computing. LCPC 2006. Lecture Notes in Computer Science, vol 4382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72521-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-72521-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72520-6
Online ISBN: 978-3-540-72521-3
eBook Packages: Computer ScienceComputer Science (R0)