Adaptive runtime tuning of parallel sparse matrix-vector multiplication on distributed memory systems

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2008, Pages 195-204

  Lee, Seyong ^a   Eigenmann, Rudolf ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Process mapping; Runtime tuning; Sparse matrix

Indexed keywords

ADAPTIVE ALGORITHMS; ALGORITHMS; COMPUTERS; CONFORMAL MAPPING; INTELLIGENT CONTROL; ONLINE SEARCHING; REAL TIME SYSTEMS; TUNING; VECTORS;

COMMUNICATION METHODS; COMPUTATIONAL LOADS; DATA DISTRIBUTIONS; DISTRIBUTED MEMORY SYSTEMS; DISTRIBUTED PARALLEL ALGORITHMS; DISTRIBUTED SYSTEMS; EXECUTION TIMES; MEMORY ACCESS PATTERNS; MULTIPLE LOOPS; PARALLEL PERFORMANCES; PARALLEL SPARSE MATRIXES; PERFORMANCE VARIABILITIES; PROCESS MAPPING; PROCESS MAPPINGS; RUNTIME TUNING; SCIENTIFIC APPLICATIONS; SELECTION ALGORITHMS; SPARSE MATRIX; SPARSE MATRIXES; STATIC PERFORMANCES; TUNING SYSTEMS; VECTOR MULTIPLICATIONS;

PARALLEL ALGORITHMS;

EID: 57349185547     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375527.1375558     Document Type: Conference Paper

References (22)

1. The message passing interface (MPI) standard [online]. available: http://www-unix.mcs.anl.gov/mpi/.
2. J. I. Aliaga and V. Hernandez. Symmetric sparse matrix-vector product on distributed memory multiprocessors. Conf. on Parallel Computing and Transputer Applications, 1992.
3. R. H. Bisseling and W. Meesen. Communication balancing in parallel sparse matrix-vector multiplication. Electronic Transactions on Numerical Analysis 21:47-65, 2005.
4. E. G. Boman and U. Catalyurek. Constrained fine-grain parallel sparse matrix distribution. SIAM Workshop on Combinatorial Scientific Computing, 2007.
5. U. V. Catalyurek and C. Aykanat. Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. on Parallel and Distributed systems, 10, July 1999.
6. T. Davis. University of Florida Sparse Matrix Collection [online]. available: http://www.cise.ufl.edu/research/sparse/matrices/.
7. G. E. Fagg, J. Pjesivac-Grbovic, G. Bosilca, T. Angskun, J. J. Dongarra, and E. Jeannot. Flexible collective communication tuning architecture applied to Open MPI. Euro PVM/MPI, 2006.
8. A. Faraj and X. Yuan. Automatic generation and tuning of MPI collective communication routines. Int. Conf. on Supercomputing, pages 393-402, 2005.
9. B. Hendrickson and T. G. Kolda. Partitioning rectangular and structurally unsymmetric sparse matrices for parallel processing. SIAM J. on Scientific Computing, 21(6):2048-2072, 2000.
10. E. J. Im, K. Yelick, and R. Vuduc. Sparsity: Optimization framework for sparse matrix kernels. International Journal of High Performance Computing Applicatins, 18(1):135-158, 2004.
11. D. Jin and S. G. Ziavras. A super-programming technique for large sparse matrix multiplication on PC clusters. IEICE Trans. Inf. & Syst., E87-D(7), July 2004.
12. S. G. Nastea and O. Frieder. Load-balancing in sparse matrix-vector multiplication. Proceedings of 8th IEEE Symposium on Parallel and Distributed Processing, page 218, 1996.
13. A. T. Ogielski and W. Aiello. Sparse matrix computations on parallel processor arrays. SIAM Journal on Scientific Computing, 14(3):519-530, 1993.
14. C.-W. Qu and S. Ranka. Parallel incremental graph partitioning. IEEE Trans. on Parallel and Distributed Systems, 8(8):884-896, 1997.
15. R. Rabenseifner. Automatic MPI counter profiling of all users: First results on a CRAY T3E 900-512. Euro PVM/MPI, pages 35-42, 1999.
16. E. Rothberg and R. Schreiber. Improved load balancing in parallel sparse Choleski factorization. Proceedings of Supercomputing (SC), 1994.
17. R. Shahnaz, A. Usman, and I. R. Chughtai. Implementation and evaluation of parallel sparse matrix-vector products on distributed memory parallel computers. IEEE Int. Conf. on Cluster Computing, pages 1-6, 2006.
18. J. Su and K. Yelick. Automatic support for irregular computations in a high-level language. Proc. of 19th IPDPS, page 53, 2005.
19. S. S. Vahdiyar, G. E. Fagg, and J. J. Dongarra. Automatically tuned collective communications. Proceedings of Supercomputing (SC), page 46, 2000.
20. B. Vastenhouw and R. H. Bisseling. A two-dimmensional data distribution method for parallel sparse matrix-vector multiplication. SIAM Review, 47(1):67-95, 2005.
21. S. Williams, L. Oliker, R. Vuduc, J. Shalf, K. Yelick, and J. Demmel. Optimization of sparse matrix-vector multiplication on emerging multicore platforms. Proceedings of Supercomputing (SC), 2007.
22. L. H. Ziantz, C. C. Ozturan, and B. K. Szymanski. Run-time optimization of sparse matrix-vector multiplication on SIMD machines. Int. Conf. Parallel Architecture and Languages, 817:313-322, July 1994.