Performance of a structure-detecting SpMV using the CSR matrix representation

Proceedings - 2012 11th International Symposium on Parallel and Distributed Computing, ISPDC 2012

Volumn , Issue , 2012, Pages 3-10

  Pabst, Hans ^a   Bachmayer, Bev ^a   Klemm, Michael ^a  

^a INTEL CORPORATION   (United States)

Author keywords

CRS; CSR; runtime optimization; sparse matrix vector multiplication; SpMV; structure detection

Indexed keywords

CRS; CSR; RUNTIME OPTIMIZATION; SPARSE MATRIX-VECTOR MULTIPLICATION; SPMV; STRUCTURE DETECTION;

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS;

MATRIX ALGEBRA;

EID: 84870731723     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2012.9     Document Type: Conference Paper

References (20)

1. 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," EECS Department, University of Berkeley, Tech. Rep. UCB/EECS-2006-183, December 2006, available at http://www.eecs.berkeley.edu/ Pubs/TechRpts/2006/EECS-2006-183.html.
2. W. A. Wulf and S. A. McKee, "Hitting the Memory Wall: Implications of the Obvious," ACM SIGARCH Computer Architecture News, vol. 23, no. 1, pp. 20-24, March 1995.
3. Intel Corporation, "Intel® Xeon® Processor E5-2680," 2011, http://ark.intel.com/products/64583/Intel-Xeon-Processor-E5-2680-(20M- Cache-2 70-GHz-8-00-GTs-Intel-QPI), last accessed 2012-06-08.
4. S. Williams, L. Oliker, R. Vuduc, J. Shalf, K. Yelick, and J. Demmel, "Optimization of Sparse Matrix-vector Multiplication on Emerging Multicore Platforms," in Proc. of the 2007 ACM/IEEE Conf. on Supercomputing, Reno, NV, November 2007, pp. 38:1-38:12.
5. Intel Corporation, "Intel® Advanced Vector Extensions Programming Reference," June 2011, document number 319433-011.
6. E.-J. Im and K. A. Yelick, "Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY," in Proc. of the Intl. Conf. on Computational Sciences, Part I, vol. 2073, San Francisco, CA, May 2001, pp. 127-136.
7. E.-J. Im, K. Yelick, and R. Vuduc, "Sparsity: Optimization Framework for Sparse Matrix Kernels," Intl. Journal of High Performance Computing Applications, vol. 18, no. 1, pp. 135-158, February 2004.
8. R. W. Vuduc and H. J. Moon, "Fast Sparse Matrix-Vector Multiplication by Exploiting Variable Block Structure," in Proc. of the High-Performance Computing and Communications Conf., Sorrento, Italy, September 2005, pp. 807-816.
9. R. Nishtala, R. W. Vuduc, J. W. Demmel, and K. A. Yelick, "Performance Modeling and Analysis of Cache Blocking in Sparse Matrix Vector Multiply," EECS Department, University of California, Berkeley, Tech. Rep. UCB/CSD-04-1335, 2004, available at http://www.eecs.berkeley.edu/ Pubs/TechRpts/2004/5535.html.
10. M. Krotkiewski and M. Dabrowski, "Parallel symmetric sparse matrix-vector product on scalar multi-core cpus," Parallel Comput., vol. 36, no. 4, pp. 181-198, Apr. 2010. [Online]. Available: http://dx.doi.org/10. 1016/j.parco.2010.02.003
11. A. Pinar and M. T. Heath, "Improving Performance of Sparse Matrix-Vector Multiplication," in Proc. of the 1999 ACM/IEEE Conf. on Supercomputing, Portland, OR, November 1999, pp. 30:1-30:9.
12. K. Kourtis, V. Karakasis, G. Goumas, and N. Koziris, "CSX: an Extended Compression Format for SpMV on Shared Memory Systems," in Proc. of the 16th ACM Symp. on Principles and Practice of Parallel Programming, San Antonio, TX, April 2011, pp. 247-256.
13. M. Belgin, G. Back, and C. J. Ribbens, "Pattern-based Sparse Matrix Representation for Memory-efficient SMVM Kernels," in Proc. of the 23rd Intl. Conf. on Supercomputing, Yorktown Heights, NY, June 2009, pp. 100-109.
14. A. N. Yzelman, Rob, and H. Bisseling, "Cache-oblivious Sparse Matrix-vector Multiplication by Using Sparse Matrix Partitioning Methods," SIAM Journal on Scientific Computing, vol. 31, no. 4, July 2009.
15. S. Lee and R. Eigenmann, "Adaptive Runtime Tuning of Parallel Sparse Matrix-vector Multiplication on Distributed Memory Systems," in Proc. of the 22nd Intl. Conf. on Supercomputing, Island of Kos, Greece, June 2008, pp. 195- 204.
16. ISO/IEC, "Information Technology - Programming Languages - C++," 2011, ISO/IEC 14882-2011.
17. Intel Corporation, "Intel® C++ Composer XE 12.1 User and Reference Guides," 2011, document number 323272-121US.
18. A. Buluc, S. Williams, L. Oliker, and J. Demmel, "Reduced-bandwidth multithreaded algorithms for sparse matrix-vector multiplication," in Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium, ser. IPDPS '11. Washington, DC, USA: IEEE Computer Society, 2011, pp. 721-733. [Online]. Available: http://dx.doi.org/10.1109/IPDPS.2011.73
19. Intel Corporation, "Intel® Architecture Instruction Set Extensions Programming Reference," February 2012, document number 319433-012A.
20. T. Davis and Y. Hu, "The University of Florida Sparse Matrix Collection," ACM Transactions on Mathmatical Software, vol. 38, no. 11, pp. 1:1-1:25, December 2011.