Two-dimensional cache-oblivious sparse matrix-vector multiplication

Parallel Computing

Volumn 37, Issue 12, 2011, Pages 806-819

  Yzelman, A N ^a   Bisseling, Rob H ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Cache oblivious; Fine grain; Matrix vector multiplication; Parallel computing; Recursive bipartitioning; Sparse matrix

Indexed keywords

CACHE-OBLIVIOUS; FINE-GRAIN; MATRIX VECTOR MULTIPLICATION; RECURSIVE BIPARTITIONING; SPARSE MATRICES;

CACHE MEMORY; DATA STRUCTURES; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS; TWO DIMENSIONAL;

MATRIX ALGEBRA;

EID: 81355148805     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2011.08.004     Document Type: Conference Paper

References (20)

1. A. Bulu, J.T. Fineman, M. Frigo, J.R. Gilbert, and C.E. Leiserson Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, New York, NY, USA 2009 ACM 233 244
2. U.V. atalyürek, and C. Aykanat Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication IEEE Trans. Parallel Distrib. Syst. 10 1999 673 693 (Pubitemid 30500688)
3. Ü.V. atalyürek, C. Aykanat, A fine-grain hypergraph model for 2D decomposition of sparse matrices, in: Proceedings 8th International Workshop on Solving Irregularly Structured Problems in Parallel, IEEE Press, Los Alamitos, CA, 2001, p. 118.
4. T.A. Davis, Y. Hu, The University of Florida Sparse Matrix Collection, ACM Transactions on Mathematical Software 38 (2011), in press.
5. M. Frigo, C.E. Leiserson, H. Prokop, and S. Ramachandran Cache-oblivious algorithms Proceedings 40th Annual Symposium on Foundations of Computer Science 1999 IEEE Press Washington, DC 285
6. K. Goto, R. van de Geijn, On reducing TLB misses in matrix multiplication, Tech. Rep. TR-2002-55, University of Texas at Austin, Department of Computer Sciences, 2002. FLAME Working Note #9.
7. G. Haase, M. Liebmann, and G. Plank A Hilbert-order multiplication scheme for unstructured sparse matrices Int. J. Parallel Emer. Distrib. Syst. 22 2007 213 220 (Pubitemid 46925815)
8. E.-J. Im, K. Yelick, Optimizing sparse matrix computations for register reuse in SPARSITY, in: Proceedings International Conference on Computational Science, Part I, Lecture Notes in Computer Science, vol. 2073, 2001, pp. 127-136. (Pubitemid 33285441)
9. J. Koster, Parallel templates for numerical linear algebra, a high-performance computation library, Master's thesis, Utrecht University, Department of Mathematics, July 2002.
10. K.P. Lorton, and D.S. Wise Analyzing block locality in Morton-order and Morton-hybrid matrices SIGARCH Comput. Archit. News 35 2007 6 12
11. G. Morton, A computer oriented geodetic data base and a new technique in file sequencing, Tech. Rep., IBM, Ottawa, Canada, March 1966.
12. R. Nishtala, R.W. Vuduc, J.W. Demmel, and K.A. Yelick When cache blocking of sparse matrix vector multiply works and why Appl. Algebr. Eng. Commun. Comput. 18 2007 297 311 (Pubitemid 47224626)
13. S. Toledo Improving the memory-system performance of sparse-matrix vector multiplication IBM J. Res. Dev. 41 1997 711 725 (Pubitemid 127557044)
14. V. Valsalam, and A. Skjellum A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels Concurrency Comput.: Practice Exp. 14 2002 805 839 (Pubitemid 34965359)
15. R. van der Pas, Memory hierarchy in cache-based systems, Tech. Rep. 817-0742-10, Sun Microsystems, Inc., Santa Clara, CA, Nov. 2002.
16. B. Vastenhouw, and R.H. Bisseling A two-dimensional data distribution method for parallel sparse matrix-vector multiplication SIAM Rev. 47 2005 67 95 (Pubitemid 40535972)
17. R. Vuduc, J.W. Demmel, and K.A. Yelick OSKI: A library of automatically tuned sparse matrix kernels J. Phys. Conf. Ser. 16 2005 521 530 (Pubitemid 41259393)
18. R.C. Whaley, A. Petitet, and J.J. Dongarra Automated empirical optimizations of software and the ATLAS project Parallel Comput. 27 2001 3 35 (Pubitemid 32264775)
19. A.N. Yzelman, R.H. Bisseling, A cache-oblivious sparse matrix-vector multiplication scheme based on the Hilbert curve, in Progress in Industrial Mathematics at ECMI 2010, Springer, in press.
20. A.N. Yzelman, and R.H. Bisseling Cache-oblivious sparse matrix-vector multiplication by using sparse matrix partitioning methods SIAM J. Scientif. Comput. 31 2009 3128 3154