Accelerating sparse matrix-vector multiplication on GPUs using bit-representation-optimized schemes

International Conference for High Performance Computing, Networking, Storage and Analysis, SC

Volumn , Issue , 2013, Pages

  Tang, Wai Teng ^a   Tan, Wen Jun ^a   Ray, Rajarshi ^b   Wong, Yi Wen ^b   Chen, Weiguang ^b   Kuo, Shyh Hao ^c   Goh, Rick Siow Mong ^c   Turner, Stephen John ^a   Wong, Weng Fai ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c INSTITUTE OF HIGH PERFORMANCE COMPUTING   (Singapore)

Author keywords

Data compression; GPU; Matrix vector multiplication; Memory bandwidth; Parallelism; Sparse matrix format

Indexed keywords

CLUSTERING ALGORITHMS; DIGITAL STORAGE; MATRIX ALGEBRA; MULTIPROCESSING SYSTEMS; OPTIMIZATION; PROGRAM PROCESSORS;

GPU; MATRIX VECTOR MULTIPLICATION; MEMORY BANDWIDTHS; PARALLELISM; SPARSE MATRIX FORMATS;

DATA COMPRESSION;

EID: 84899694907     PISSN: 21674329     EISSN: 21674337     Source Type: Conference Proceeding    
DOI: 10.1145/2503210.2503234     Document Type: Conference Paper

References (27)

1. P. R. Amestoy, T. A. Davis, and I. S. Du-. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl., 17(4):886-905, Oct. 1996.
2. M. M. Baskaran and R. Bordawekar. Optimizing sparse matrix-vector multiplication on GPUs. Technical report, RC24704, IBM T. J. Watson, 2009.
3. M. Belgin, G. Back, and C. J. Ribbens. Pattern-based sparse matrix representation for memory-efficient SMVM kernels. In Proceedings of the 23rd international conference on Supercomputing, ICS'09, pages 100-109, New York, NY, USA, 2009.
4. N. Bell and M. Garland. Implementing sparse matrix-vector multiplication on throughput-oriented processors. In Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, SC'09, pages 18:1-18:11, New York, NY, USA, 2009.
5. N. Bell and M. Garland. Cusp library, 2012. http://cusp-library. googlecode. com.
6. J. W. Choi, A. Singh, and R. W. Vuduc. Model-driven autotuning of sparse matrix-vector multiply on GPUs. In Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP'10, pages 115-126, New York, NY, USA, 2010.
7. T. A. Davis and Y. Hu. The University of Florida sparse matrix collection. ACM Trans. Math. Softw., 38(1):1:1-1:25, Dec. 2011. http://www. cise. u. edu/research/sparse/matrices/.
8. E. F. D'Azevedo, M. R. Fahey, and R. T. Mills. Vectorized sparse matrix multiply for compressed row storage format. In Proceedings of the 5th international conference on Computational Science-Volume Part I, ICCS'05, pages 99-106, Berlin, Heidelberg, 2005.
9. A. George and J. W. Liu. Computer Solution of Large Sparse Positive Denite Systems. Prentice Hall Professional Technical Reference, 1981.
10. J. Godwin, J. Holewinski, and P. Sadayappan. High-performance sparse matrix-vector multiplication on GPUs for structured grid computations. In Proceedings of the 5th Annual Workshop on General Purpose Processing with Graphics Processing Units, GPGPU-5, pages 47-56, New York, NY, USA, 2012.
11. D. Grewe and A. Lokhmotov. Automatically generating and tuning GPU code for sparse matrix-vector multiplication from a high-level representation. In Proceedings of the Fourth Workshop on General Purpose Processing on Graphics Processing Units, GPGPU-4, pages 12:1-12:8, New York, NY, USA, 2011.
12. E.-J. Im. Optimizing the performance of sparse matrix-vector multiplication. PhD thesis, University of California Berkeley, 2000.
13. E.-J. Im and K. A. Yelick. Optimizing sparse matrix computations for register reuse in SPARSITY. In Proceedings of the International Conference on Computational Sciences-Part I, ICCS'01, pages 127-136, London, UK, 2001.
14. A. K. Jain. Data clustering: 50 years beyond k-means. Pattern Recogn. Lett., 31(8):651-666, June 2010.
15. D. R. Kincaid, T. C. Oppe, and D. M. Young. ITPACKV 2D User Guide, CNA-232, 1989. http://rene. ma. utexas. edu/CNA/ITPACK/manuals /userv2d/.
16. K. Kourtis, G. Goumas, and N. Koziris. Optimizing sparse matrix-vector multiplication using index and value compression. In Proceedings of the 5th Conference on Computing frontiers, CF'08, pages 87-96, New York, NY, USA, 2008.
17. J. Mellor-Crummey and J. Garvin. Optimizing sparse matrix-vector product computations using unroll and jam. Int. J. High Perform. Comput. Appl., 18(2):225-236, May 2004.
18. A. Monakov, A. Lokhmotov, and A. Avetisyan. Automatically tuning sparse matrix-vector multiplication for GPU architectures. In Proceedings of the 5th international conference on High Performance Embedded Architectures and Compilers, HiPEAC'10, pages 111-125, Berlin, Heidelberg, 2010.
19. Nvidia Compute Unied Device Architecture (CUDA). http://www. nvidia. com/object/cuda home new. html.
20. A. Pinar and M. T. Heath. Improving performance of sparse matrix-vector multiplication. In Proceedings of the 1999 ACM/IEEE conference on Supercomputing, Supercomputing'99, New York, NY, USA, 1999.
21. Y. Saad. Iterative Methods for Sparse Linear Systems. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2nd edition, 2003.
22. B.-Y. Su and K. Keutzer. clSpMV: A cross-platform OpenCL SpMV framework on GPUs. In Proceedings of the 26th ACM international conference on Supercomputing, ICS'12, pages 353-364, New York, NY, USA, 2012.
23. F. Vazquez, J. J. Fernandez, and E. M. Garzon. A new approach for sparse matrix vector product on NVIDIA GPUs. Concurr. Comput.: Pract. Exper., 23(8):815-826, June 2011.
24. R. Vuduc, J. W. Demmel, and K. A. Yelick. OSKI: A library of automatically tuned sparse matrix kernels. In Proc. SciDAC, J. Physics: Conf. Ser., volume 16, pages 521-530, 2005.
25. R. W. Vuduc and H.-J. Moon. Fast sparse matrix-vector multiplication by exploiting variable block structure. In Proceedings of the First international conference on High Performance Computing and Communications, HPCC'05, pages 807-816, Berlin, Heidelberg, 2005.
26. J. Willcock and A. Lumsdaine. Accelerating sparse matrix computations via data compression. In Proceedings of the 20th annual international conference on Supercomputing, ICS'06, pages 307-316, New York, NY, USA, 2006.
27. S. Williams, L. Oliker, R. Vuduc, J. Shalf, K. Yelick, and J. Demmel. Optimization of sparse matrix-vector multiplication on emerging multicore platforms. In Proceedings of the 2007 ACM/IEEE conference on Supercomputing, SC'07, pages 38:1-38:12, New York, NY, USA, 2007.