CSX: An extended compression format for SpMV on shared memory systems

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2011, Pages 247-256

  Kourtis, Kornilios ^a   Karakasis, Vasileios ^a   Goumas, Georgios ^a   Koziris, Nectarios ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Compression; Shared memory; SMP; Sparse matrix vector multiplication; SpMV

Indexed keywords

COMPRESSION; SHARED MEMORIES; SMP; SPARSE MATRIX-VECTOR MULTIPLICATION; SPMV;

COMPUTER PROGRAMMING LANGUAGES; METADATA; PARALLEL PROGRAMMING;

MATRIX ALGEBRA;

EID: 79952786461     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1941553.1941587     Document Type: Conference Paper

References (27)

1. R. C. Agarwal, F. G. Gustavson, and M. Zubair. A high performance algorithm using pre-processing for the sparse matrix-vector multiplication. In Supercomputing'92, pages 32-41, Minn., MN, November 1992. IEEE.
2. W. K. Anderson, W. D. Gropp, D. K. Kaushik, D. E. Keyes, and B. F. Smith. Achieving high sustained performance in an unstructured mesh CFD application. In SC'99: Proceedings of the 1999 ACM/IEEE Conference on Supercomputing, page 69, New York, NY, USA, 1999. ACM.
3. K. Asanovic, R. Bodik, B. C. Catanzaro, J. J. Gebis, P. Husbands, K. Keutzer, D. A. Patterson, W. L. Plishker, J. Shalf, S. W. Williams, and K. A. Yelick. The landscape of parallel computing research: A view from berkeley. Technical Report UCB/EECS-2006-183, EECS Department, University of California, Berkeley, December 18 2006.
4. R. Barrett, M. Berry, T. F. Chan, J. Demmel, J. M. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. V. der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia, 1994.
5. M. Belgin, G. Back, and C. J. Ribbens. Pattern-based sparse matrix representation for memory-efficient smvm kernels. In ICS'09: Proceedings of the 23rd international conference on Supercomputing, pages 100-109, New York, NY, USA, 2009. ACM.
6. U. V. Catalyuerek and C. Aykanat. Decomposing irregularly sparse matrices for parallel matrix-vector multiplication. Lecture Notes In Computer Science, 1117:75-86, 1996. (Pubitemid 126107937)
7. T. Davis. University of Florida sparse matrix collection. NA Digest, 97(23):7, 1997.
8. R. Geus and S. Röllin. Towards a fast parallel sparse matrix-vector multiplication. In Parallel Computing: Fundamentals and Applications, International Conference ParCo, pages 308-315. Imperial College Press, 1999.
9. G. Goumas, K. Kourtis, N. Anastopoulos, V. Karakasis, and N. Koziris. Performance evaluation of the sparse matrix-vector multiplication on modern architectures. The Journal of Supercomputing, 2008.
10. E. Im and K. Yelick. Optimizing sparse matrix-vector multiplication on SMPs. In 9th SIAM Conference on Parallel Processing for Scientific Computing. SIAM, March 1999.
11. E. Im and K. Yelick. Optimizing sparse matrix computations for register reuse in SPARSITY. Lecture Notes in Computer Science, 2073:127-136, 2001. (Pubitemid 33285441)
12. V. Karakasis, G. Goumas, and N. Koziris. A comparative study of blocking storage methods for sparse matrices on multicore architectures. In 12th IEEE International Conference on Computational Science and Engineering (CSE-09), Vancouver, Canada, 2009. IEEE Computer Society.
13. D. Keppel, S. J. Eggers, and R. R. Henry. A case for runtime code generation. Technical Report UWCSE 91-11-04, University of Washington Department of Computer Science and Engineering, November 1991.
14. K. Kourtis, G. Goumas, and N. Koziris. Improving the performance of multithreaded sparse matrix-vector multiplication using index and value compression. In 37th International Conference on Parallel Processing (ICPP'08), pages 511-519, Sept. 2008.
15. K. Kourtis, G. Goumas, and N. Koziris. Optimizing sparse matrixvector multiplication using index and value compression. In CF'08: Proceedings of the 2008 conference on Computing frontiers, pages 87-96, New York, NY, USA, 2008. ACM.
16. C. Lattner and V. Adve. LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In Proceedings of the Analysis & Transformation 2004 International Symposium on Code Generation and Optimization (CGO'04), Palo Alto, California, Mar 2004.
17. J. Mellor-Crummey and J. Garvin. Optimizing sparse matrix-vector product computations using unroll and jam. International Journal of High Performance Computing Applications, 18(2):225, 2004.
18. 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 multiprocessors. In PDP, pages 66-71. IEEE Computer Society, 2004.
19. A. Pinar and M. T. Heath. Improving performance of sparse matrix-vector multiplication. In Supercomputing'99, Portland, OR, November 1999. ACM SIGARCH and IEEE.
20. Y. Saad. SPARSKIT: A basic tool kit for sparse matrix computations. Technical report, Computer Science Department, University of Minnesota, Minneapolis, MN 55455, June 1994. Version 2.
21. Y. Saad. Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia, PA, USA, 2003.
22. S. Toledo. Improving the memory-system performance of sparse-matrix vector multiplication. IBM Journal of Research and Development, 41(6):711-725, 1997. (Pubitemid 127557044)
23. R. Vuduc, J. Demmel, K. Yelick, S. Kamil, R. Nishtala, and B. Lee. Performance optimizations and bounds for sparse matrix-vector multiply. In Supercomputing, Baltimore, MD, November 2002.
24. R. W. Vuduc and H. Moon. Fast sparse matrix-vector multiplication by exploiting variable block structure. In High Performance Computing and Communications, volume 3726 of Lecture Notes in Computer Science, pages 807-816. Springer, 2005.
25. J. White and P. Sadayappan. On improving the performance of sparse matrix-vector multiplication. In HiPC'97: 4th International Conference on High Performance Computing, 1997.
26. J. Willcock and A. Lumsdaine. Accelerating sparse matrix computations via data compression. In ICS'06: Proceedings of the 20th annual International Conference on Supercomputing, pages 307-316, New York, NY, USA, 2006. ACM Press. (Pubitemid 47168517)
27. S. Williams, L. Oilker, R. Vuduc, J. Shalf, K. Yelick, and J. Demmel. Optimization of sparse matrix-vector multiplication on emerging multicore platforms. In SC'07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing, Reno, NV, November 2007.