Performance optimization of irregular codes based on the combination of reordering and blocking techniques

Parallel Computing

Volumn 31, Issue 8-9, 2005, Pages 858-876

  Pichel, J C ^a   Heras, D B ^a   Cabaleiro, J C ^a   Rivera, F F ^a  

^a UNIVERSITY OF SANTIAGO DE COMPOSTELA   (Spain)

Author keywords

Blocking; Data locality; Irregular codes; Multiprocessors; Reordering

Indexed keywords

DATA PROCESSING; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS; LINEAR ALGEBRA; MATRIX ALGEBRA; MULTIPROCESSING PROGRAMS; OPTIMIZATION; PROBLEM SOLVING; VECTORS;

BLOCKING; DATA LOCALITY; IRREGULAR CODES; MULTIPROCESSORS; REORDERING;

CODES (SYMBOLS);

EID: 25644439819     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2005.04.012     Document Type: Article

References (23)

1. D. Applegate, R. Bixby, V. Chvátval, W. Cook. Finding tours in the TSP. 1998. Draft Available from: 〈http://www.math.princeton.edu/tsp〉.
2. R. Barret, M. Berry, T. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. van der Vorst Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods 1994 SIAM Press
3. S. Chaterjee, E. Parker, J. Hanlon, A.R. Lebeck, Exact analysis of the cache behavior of nested loops, in: Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, June 2001, pp. 286-297.
4. T. Davis University of Florida Sparse Matrix Collection NA Digest 97 23 1997 Available from: 〈http://www.cise.ufl.edu/research/sparse/ matrices〉
5. B.B. Fraguela, R. Doallo, and E.L. Zapata Memory hierarchy performance prediction for blocked sparse algorithms Parallel Processing Letters 9 3 1999 347 360
6. D.B. Heras, V. Blanco, J.C. Cabaleiro, and F.F. Rivera Modelling and improving locality for the sparse matrix-vector product on cache memories Future Generation Computer Systems 18 1 2001 55 67 (Special Issue on High Performance Numerical Methods and Application)
7. D.B. Heras, J.C. Cabaleiro, and F.F. Rivera Modeling data locality for the sparse matrix-vector product using distance measures Journal of Parallel Computing 27 2001 897 912
8. D.B. Heras, J.C. Cabaleiro, and F.F. Rivera Analysis and improvement of data locality for the transposition of a sparse matrix F.J. Peters G.R. Joubert A. Murli M. Vanneschi Proceedings of the ParCo2001. Parallel Computing: Advances and Current Issues 2002 Imperial College Press 457 464
9. D.B. Heras, F.F. Rivera, J.C. Cabaleiro, Analytical description of locality for the product of a sparse matrix by a dense matrix, in: Proceedings of the International Conference of Parallel and Distributed Processing Techniques and Applications, PDPTA'02, 2002, pp. 178-184.
10. E.J. Im, K. Yelick, Optimizing sparse matrix vector multiplication on SMPs, in: Proceedings of the 10th SIAM Conference on Parallel Processing for Scientific Computing, March 1999.
11. E.J. Im, K.A. Yelick, and R. Vuduc SPARSITY: framework for optimizing sparse matrix-vector multiply International Journal of High Performance Computing Applications 18 1 2004 135 158
12. K.S. McKinley, S. Carr, and C.-W. Tseng Improving data locality with loop transformations ACM Transactions on Programming Languages and Systems 18 4 1996 424 453
13. K.S. McKinley, O. Temam, A quantitative analysis of loop nest locality, in: Proceedings of the 7th International Conference on Architectural Support for Programming Languages and Operating Systems, October 1996.
14. J.J. Navarro, E. García, J.L. Larriba-Pey, T. Juan, Block algorithms for sparse matrix computations on high performance workstations, in: Proceedings of the IEEE International Conference on Supercomputing, ICS'96, 1996, pp. 301-309.
15. D.A. Patterson, and J.L. Hennesy Computer Architecture: A Quantitative Approach 1996 Morgan Kaufmann Publishers
16. J.C. Pichel, D.B. Heras, J.C. Cabaleiro, and F.F. Rivera Improving the locality of the sparse matrix-vector product on shared memory muliprocessors Euromicro Conference on Parallel, Distributed and Network-based Processing, PDP2004 2004 IEEE Computer 66 71
17. A. Pinar, M. Heath, Improving performance of sparse matrix-vector multiplication, in: Proceedings of Supercomputing, 1999.
18. S. Plimpton Fast parallel algorithms for short-range molecular dynamics Journal of Computational Physics 117 1 1995 1 19
19. Corporate SPARC International, Inc., The SPARC Architecture Manual (version 9). Prentice-Hall, Inc., 1994.
20. O. Temam, W. Jalby, Characterizing the behavior of sparse algorithms on caches, in: IEEE International Conference on Supercomputing, ICS'92, 1992, pp. 578-587.
21. S. Toledo, Improving memory-system performance of sparse matrix-vector multiplication, in: Proceedings of the 8th SIAM Conference on Parallel Processing for Scientific Computing, March 1997.
22. R. Vuduc, J.W. Demmel, K.A. Yelick, S. Kamil, R. Nishtala, B. Lee, Performance optimizations and bounds for sparse matrix vector multiply, in: Proceedings of Supercomputing, Baltimore, MD, USA, November 2002.
23. M.E. Wolf, M.S. Lam, A data locality optimization algorithm, in: Proceedings of the SIGPLAN'91 Conference on Programming Language Design and Implementation, June 1991.