Abstract
A blocking method is a popular optimization technique for sparse matrix-vector multiplication (SpMxV). In this paper, a new blocking method which generalizes the conventional two blocking methods and its application to the parallel environment are proposed. This paper also proposes a dynamic parameter selection method for blocked parallel SpMxV which automatically selects the parameter set according to the characteristics of the target matrix and machine in order to achieve high performance on various computational environments. The performance with dynamically selected parameter set is compared with the performance with generally-used fixed parameter sets for 12 types of sparse matrices on four parallel machines: including PentiumIII, Sparc II, MIPS R12000 and Itanium. The result shows that the performance with dynamically selected parameter set is the best in most cases.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
William, G., Lusk, E.: (User’s guide for mpich, a portable implementation of mpi)
Davis, T.: University of florida sparse matrix collection (1997) NA Digest, vol. 97., Jun 1997. http://www.cise.ufl.edu/~davis/sparse/.
White, J., Sadayappan, P.: On improving the performance of parallel sparse matrix-vector multiplication. In: Proceedings of Supercomputing’97, San Jose, CA (1997)
Im, E.: Optimizing the Performance of Sparse Matrix-Vector Multiplication. PhD thesis, University of California at Berkeley (2000)
Barrett, R., Berry, M., Chan, T.F., Demmel, J., Donato, J., Dongarra, J., Eijkhout, V., Pozo, R., Romine, C., der Vorst, H.V.: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1994)
Geus, S.R.R.: Towards a fast parallel sparse matrix-vector multiplication. In: Parallel Computing: Fundamentals & Applications, Proceedings of the International Conference ParCo’99, 17–20 August 1999, Delft, The Netherlands. (2000) 308–315
Pinar, A., Heath, M.T.: Improving performance of sparse matrix-vector multiplication. In: Proceedings of Supercomputing’99. (1999)
Toledo, S.: Improving the memory-system performance of sparse-matrix vector multiplication. IBM Journal of Research and Development 41 (1997) 711–725
Vuduc, R., Demmel, J.W., Yelick, K.A., Kamil, S., Nishtala, R., Lee, B.: Performance optimizations and bounds for sparse matrix-vector multiply. In: Proceedings of Supercomputing 2002. (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kudo, M., Kuroda, H., Kanada, Y. (2003). Parallel Blocked Sparse Matrix-Vector Multiplication with Dynamic Parameter Selection Method. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J.J., Zomaya, A.Y. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44863-2_57
Download citation
DOI: https://doi.org/10.1007/3-540-44863-2_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40196-4
Online ISBN: 978-3-540-44863-1
eBook Packages: Springer Book Archive