Exploiting compression opportunities to improve spmxv performance on shared memory systems

Transactions on Architecture and Code Optimization

Volumn 7, Issue 3, 2010, Pages

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

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Data compression; Memory bandwidth; Shared memory systems; Sparse matrix

Indexed keywords

COARSE-GRAINED; COMPRESSION SCHEME; EXPERIMENTAL EVALUATION; ITS DATA; MATRIX; MEMORY BANDWIDTHS; MEMORY CONTENTIONS; MULTITHREADED; SHARED MEMORY SYSTEM; SPARSE MATRICES; SPARSE MATRIX-VECTOR MULTIPLICATION; STATE-OF-THE-ART APPROACH; STRUCTURAL DATA;

BANDWIDTH COMPRESSION; MATRIX ALGEBRA;

DATA COMPRESSION;

EID: 78651410164     PISSN: 15443566     EISSN: 15443973     Source Type: Journal    
DOI: 10.1145/1880037.1880041     Document Type: Article

References (35)

1. ANDERSON, W. K., GROPP, W. D., KAUSHIK, D. K., KEYES, D. E., AND SMITH, B. F. 1999. Achieving high sustained performance in an unstructured mesh cfd application. In Proceedings of the ACM/IEEE Conference on Supercomputing (SC'99). ACM, New York, NY, 69.
2. ASANOVIC, K., BODIK, R., CATANZARO, B. C., GEBIS, J. J., HUSBANDS, P., KEUTZER, K., PATTERSON, D. A., PLISHKER, W. L., SHALF, J., WILLIAMS, S. W., AND YELICK, K. A. 2006. The landscape of parallel computing research: a view from Berkeley. Tech. rep. UCB/EECS-2006-183, EECS Department, University of California, Berkeley.
3. BARKER, K., DAVIS, K., HOISIE, A., KERBYSON, D. J., LANG, M., PAKIN, S., AND SANCHO, J. C. 2008. A performance evaluation of the Nehalem quad-core processor for scientific computing. Parall. Process. Lett.
4. BARRETT, R., BERRY, M., CHAN, T. F., DEMMEL, J., DONATO, J. M., DONGARRA, J., EIJKHOUT, V., POZO, R., ROMINE, C., AND DER VORST, H. V. 1994. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia, PA.
5. BELGIN, M., BACK, G., AND RIBBENS, C. J. 2009. Pattern-based sparse matrix representation for memory-efficient smvm kernels. In Proceedings of the 23rd International Conference on Supercomputing (ICS'09). ACM, New York, NY, 100-109.
6. BURTSCHER, M. AND RATANAWORABHAN, P. 2007. High throughput compression of double-precision floating-point data. In Proceedings of the Data Compression Conference (DCC'07). IEEE Computer Society, Los Alamitos, CA, 293-302.
7. CATALYUEREK, U. V. AND AYKANAT, C. 1996. Decomposing irregularly sparse matrices for parallel matrix-vector multiplication. Lecture Notes in Computer Science, vol. 1117, 75-86.
8. CULLER, D. AND SINGH, J. 1999. Parallel Computer Architecture. Morgan Kaufmann Publishers San Francisco, CA.
9. DAVIS, T. 1997. University of Florida sparse matrix collection. NA Digest 97, 23, 7.
10. GEER, D. 2005. Chip makers turn to multicore processors. IEEE Comput. 38, 5, 11-13.
11. GEUS, R. AND RÖLLIN, S. 1999. Towards a fast parallel sparse matrix-vector multiplication. In Proceedings of the International Conference on Fundamentals and Applications of Parallel Computing (ParCo). Imperial College Press, 308-315.
12. GOUMAS, G., KOURTIS, K., ANASTOPOULOS, N., KARAKASIS, V., AND KOZIRIS, N. 2008. Performance evaluation of the sparse matrix-vector multiplication on modern architectures. J. Supercomput.
13. GSCHWIND, M., HOFSTEE, H. P., FLACHS, B. K., HOPKINS, M., WATANABE, Y., AND YAMAZAKI, T. 2006. Synergistic processing in cell's multicore architecture. IEEE Micro 26, 2, 10-24.
14. HENNESSY, J. AND PATTERSON, D. 2007. Computer Architecture: A Quantitative Approach. Morgan Kaufmann.
15. HSU, L., IYER, R., MAKINENI, S., REINHARDT, S., AND NEWELL, D. 2005. Exploring the cache design space for large scale CMPs. ACM SIGARCH Comput. Architect. News 33, 4, 24-33.
16. IM, E. AND YELICK, K. 1999. Optimizing sparse matrix-vector multiplication on SMPs. In Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing.
17. IM, E. AND YELICK, K. 2001. Optimizing sparse matrix computations for register reuse in SPARSITY. Lecture Notes in Computer Science, vol. 2073, 127-136.
18. KEYES, D. 2000. Four horizons for enhancing the performance of parallel simulations based on partial differential equations. In Proceedings of the 6th International Conference on Parallel Processing (Euro-Par'00).
19. KOURTIS, K., GOUMAS, G., AND KOZIRIS, N. 2008a. Improving the performance of multithreaded sparse matrix-vector multiplication using index and value compression. In Proceedings of the 37th International Conference on Parallel Processing (ICPP'08), 511-519.
20. KOURTIS, K., GOUMAS, G., AND KOZIRIS, N. 2008b. Optimizing sparse matrix-vector multiplication using index and value compression. In Proceedings of the Conference on Computing Frontiers (CF'08). ACM, New York, NY, 87-96.
21. LANGOU, J.,LANGOU, J.,LUSZCZEK, P.,KURZAK, J.,BUTTARI, A., AND DONGARRA, J. 2006. Exploiting the performance of 32 bit floating point arithmetic in obtaining 64 bit accuracy (revisiting iterative refinement for linear systems). In Proceedings of the ACM/IEEE Conference on Supercomputing (SC'06). ACM, New York, NY, 113.
22. LEE, B., VUDUC, R., DEMMEL, J., AND YELICK, K. 15-18 Aug. 2004. Performance models for evaluation and automatic tuning of symmetric sparse matrix-vector multiply. In Proceedings of the International Conference on Parallel Processing (ICPP'04). 169-176, vol. 1.
23. MELLOR-CRUMMEY, J. AND GARVIN, J. 2004. Optimizing sparse matrix-vector product computations using unroll and jam. Int. J. High Perform. Comput. Appl. 18, 2, 225.
24. MOLONEY, D., GERAGHTY, D., MCSWEENEY, C., AND MCELROY, C. 2005. Streaming sparse matrix compression/decompression. In Proceedings of the High Performance Embedded Architectures and Compilers, 1st International Conference (HiPEAC'05). 116-129.
25. PICHEL, J. C., HERAS, D. B., CABALEIRO, J. C., AND RIVERA, F. F. 2004. Improving the locality of the sparse matrix-vector product on shared memory multiprocessors. In Proceedings of theEconomics Conference on Parallel, Distributed, and Network-Based Processing. 66.
26. PINAR, A. AND HEATH, M. 1999. Improving performance of sparse matrix-vector multiplication. In Proceedings of the Supercomputing'99 Conference. ACM SIGARCH and IEEE.
27. SAAD, Y. 1994. SPARSKIT: A basic tool kit for sparse matrix computations. Tech. rep., Computer Science Department, University of Minnesota, Minneapolis, MN.
28. SAAD, Y. 2003. Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia, PA.
29. TEMAM, O. AND JALBY, W. 1992. Characterizing the behavior of sparse algorithms on caches. In Proceedings of the Supercomputing'92 Conference. IEEE, 578-587.
30. TOLEDO, S. 1997. Improving the memory-system performance of sparse-matrix vector multiplication. IBM J. Resear. Devel. 41, 6, 711-725.
31. VUDUC, R., DEMMEL, J., YELICK, K., KAMIL, S., NISHTALA, R., AND LEE, B. 2002. Performance optimizations and bounds for sparse matrix-vector multiply. In Proceedings of the Supercomputing Conference'02. 26-26.
32. VUDUC, R. W. AND MOON, H. 2005. Fast sparse matrix-vector multiplication by exploiting variable block structure. In Proceedings of the Conference on High Performance Computing and Communications. Lecture Notes in Computer Science, vol. 3726. Springer, 807-816.
33. WHITE, J. AND SADAYAPPAN, P. 1997. On improving the performance of sparse matrix-vector multiplication. In Proceedings of the 4th International Conference on High Performance Computing (HiPC'97).
34. WILLCOCK, J. AND LUMSDAINE, A. 2006. Accelerating sparse matrix computations via data compression. In Proceedings of the 20th Annual International Conference on Supercomputing (ICS'06). ACM Press, New York, NY, 307-316.
35. WILLIAMS, S., OILKER, L., VUDUC, R., SHALF, J., YELICK, K., AND DEMMEL, J. 2007. Optimization of sparse matrix-vector multiplication on emerging multicore platforms. In Proceedings of the ACM/IEEE Conference on Supercomputing.