Improving performance of sparse matrix-vector multiplication

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Improving performance of sparse matrix-vector multiplication

Full text

Pdf (82 KB)

Source

Conference on High Performance Networking and Computing archive
Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM) table of contents

Portland, Oregon, United States

Article No. 30

Year of Publication: 1999

ISBN:1-58113-091-0

Authors

Ali Pinar	Department of Computer Science and Center of Simulation of Advanced Rockets, University of Illinois at Urbana-Champaign
Michael T. Heath	Department of Computer Science and Center of Simulation of Advanced Rockets, University of Illinois at Urbana-Champaign

Sponsors

IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 14, Downloads (12 Months): 83, Citation Count: 13

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/331532.331562 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	R. C. Agarwal , F. G. Gustavson , M. Zubair, A high performance algorithm using pre-processing for the sparse matrix-vector multiplication, Proceedings of the 1992 ACM/IEEE conference on Supercomputing, p.32-41, November 16-20, 1992, Minneapolis, Minnesota, United States
	2	D. A. Burgess and M. B. Giles, "Renumbering unstructured grids to improve the performance of codes on hierarchical memory machines", Tech. Rep. 95/06, Numerical Analysis Group, Oxford University Computing laboratory, May 1995.
	3	R. Das, D. J. Mavriplis, J. Saltz, S. Gupta, and R. Ponnusamy, "The design and implementation of a parallel unstructured Euler solver using software primitives", AIAA Journal, No: 32, pp. 489-496, 1994.
	4	J. Perttunen, "The traveling salesman problem: the significance of initial solutions in composite heuristics", Vaasan Korkeakoulun julkaisuja, 0358-9080; no. 139, 1989.
	5	G. Reinelt The traveling salesman: computational solutions for TSP applications, Lecture Notes in Computer Science, Vol: 840, Springer-Verlag, 1994.
	6	O. Temam , W. Jalby, Characterizing the behavior of sparse algorithms on caches, Proceedings of the 1992 ACM/IEEE conference on Supercomputing, p.578-587, November 16-20, 1992, Minneapolis, Minnesota, United States
	7	S. Toledo, "Improving Memory-System Performance of Sparse Matrix-Vector Multiplication", Proceedings of the 8th SIAM Conference on Parallel Processing for Scientific Computing, March 1997.

CITED BY 13

	Richard Vuduc , James W. Demmel , Katherine A. Yelick , Shoaib Kamil , Rajesh Nishtala , Benjamin Lee, Performance optimizations and bounds for sparse matrix-vector multiply, Proceedings of the 2002 ACM/IEEE conference on Supercomputing, p.1-35, November 16, 2002, Baltimore, Maryland
	Zizhong Chen , Jack Dongarra , Piotr Luszczek , Kenneth Roche, Self-adapting software for numerical linear algebra and LAPACK for clusters, Parallel Computing, v.29 n.11-12, p.1723-1743, November/December 2003
	Ling Zhuo , Viktor K. Prasanna, Sparse Matrix-Vector multiplication on FPGAs, Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays, February 20-22, 2005, Monterey, California, USA
	Robert Niewiadomski , José Nelson Amaral , Robert C. Holte, A performance study of data layout techniques for improving data locality in refinement-based pathfinding, Journal of Experimental Algorithmics (JEA), v.9 n.es, 2004
	Eun-Jin Im , Katherine Yelick , Richard Vuduc, Sparsity: Optimization Framework for Sparse Matrix Kernels, International Journal of High Performance Computing Applications, v.18 n.1, p.135-158, February 2004
	J. C. Pichel , D. B. Heras , J. C. Cabaleiro , F. F. Rivera, Performance optimization of irregular codes based on the combination of reordering and blocking techniques, Parallel Computing, v.31 n.8+9, p.858-876, August 2005
	Jeremiah Willcock , Andrew Lumsdaine, Accelerating sparse matrix computations via data compression, Proceedings of the 20th annual international conference on Supercomputing, June 28-July 01, 2006, Cairns, Queensland, Australia
	Mehmet Belgin , Calvin J. Ribbens , Godmar Back, An operation stacking framework for large ensemble computations, Proceedings of the 21st annual international conference on Supercomputing, June 17-21, 2007, Seattle, Washington
	Samuel Williams , Leonid Oliker , Richard Vuduc , John Shalf , Katherine Yelick , James Demmel, Optimization of sparse matrix-vector multiplication on emerging multicore platforms, Proceedings of the 2007 ACM/IEEE conference on Supercomputing, November 10-16, 2007, Reno, Nevada
	Alfredo Buttari , Victor Eijkhout , Julien Langou , Salvatore Filippone, Performance Optimization and Modeling of Blocked Sparse Kernels, International Journal of High Performance Computing Applications, v.21 n.4, p.467-484, November 2007
	Kornilios Kourtis , Georgios Goumas , Nectarios Koziris, Optimizing sparse matrix-vector multiplication using index and value compression, Proceedings of the 2008 conference on Computing frontiers, May 05-07, 2008, Ischia, Italy
	Mehmet Belgin , Godmar Back , Calvin J. Ribbens, Pattern-based sparse matrix representation for memory-efficient SMVM kernels, Proceedings of the 23rd international conference on Supercomputing, June 08-12, 2009, Yorktown Heights, NY, USA
	Samuel Williams , Leonid Oliker , Richard Vuduc , John Shalf , Katherine Yelick , James Demmel, Optimization of sparse matrix-vector multiplication on emerging multicore platforms, Parallel Computing, v.35 n.3, p.178-194, March, 2009