Optimal sparse matrix dense vector multiplication in the I/O-model

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2007, Pages 61-70

  Bender, Michael A ^a   Brodal, Gerth Stølting ^b   Fagerberg, Rolf ^c   Jacob, Riko ^d   Vicari, Elias ^d  

^a Stony Brook University   (United States)

^b AALBORG UNIVERSITY   (Denmark)

^c UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^d ETH ZURICH   (Switzerland)

Author keywords

External memory algorithms; I O model; Lower bound; Sparse matrix dense vector multiplication

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; INPUT OUTPUT PROGRAMS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING;

EXTERNAL MEMORY ALGORITHMS; I/O-MODEL; NONZEROS; SPARSE MATRIX DENSE VECTOR MULTIPLICATION;

VECTORS;

EID: 35248813384     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1248377.1248391     Document Type: Conference Paper

References (18)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Comm. ACM, 31(9):1116-1127, September 1988.
2. L. Arge and P. B. Miltersen. On showing lower bounds for external-memory computational geometry problems. In J. M. Abello and J. S. Vitter, editors, External Memory Algorithms, vol. 50 of DIMA CS Series in Discrete Mathematics and Theoretical Computer Science, pages 139-159. AMS Press 1999.
3. G. S. Brodal, R. Eagerberg, and G. Moruz. Cache-aware and cache-oblivious adaptive sorting. In Proc. 32nd International Colloquium on Automata, Languages, and Programming, vol. 3580 of Lecture Notes in Computer Science, pages 576-588. Springer Verlag, Berlin, 2005.
4. T. H. Cormen, T. Sundquist, and L. F. Wisniewski. Asymptotically tight bounds for performing BMMC permutations on parallel disk systems. SIAM J. Comput., 28(1):105-136, 1999.
5. J. Demmel, J. Dongarra, V. Eijkhout, E. Puentes, R. V. Antoine Petitet, R. C. Whaley, and K. Yelick. Self-adapting linear algebra algorithms and software. Proc. of the IEEE, Special Issue on Program Generation, Optimization, and Adaptation, 93(2), February 2005.
6. S. Filippone and M. Colajanni. PSBLAS: A library for parallel linear algebra computation on sparse matrices. ACM Trans. on Math. Software, 26(4):527-550, Dec. 2000.
7. M. Prigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proc. 40th Annual Symp. on Foundations of Computer Science (FOCS), pages 285-297, New York, NY, Oct. 17-19 1999.
8. R. Hartshorne. Algebraic Geometry. Springer, 1977.
9. T. Haveliwala. Efficient computation of pagerank. Technical Report 1999-31, Database Group, Computer Science Department, Stanford University, Feb. 1999. Available at http://dbpubs.stanford.edu/pub/1999-31.
10. E. J. Im. Optimizing the Performance of Sparse Matrix- Vector Multiplication. PhD thesis, University of California, Berkeley, May 2000.
11. H. Jia-Wei and H. T. Kung. I/O complexity: The red-blue pebble game. In STOC '81: Proc. 13th annual ACM symposium on Theory of computing, pages 326-333, New York, NY, USA, 1981. ACM Press.
12. R. Raz. Multi-linear formulas for permanent and determinant are of super-polynomial size. In Proc. 36th Annual ACM Symposium on Theory of Computing (STOC), pages 633-641, Chicago, IL, USA, June 2004.
13. K. Remington and R. Pozo. NIST sparse BLAS user's guide. Technical report, National Institute of Standards and Technology, Gaithersburg, Maryland, 1996.
14. Y. Saad. Sparsekit: a basic tool kit for sparse matrix computations. Technical report, Computer Science Department, University of Minnesota, June 1994.
15. S. Toledo. A survey of out-of-core algorithms in numerical linear algebra. In J. M. Abello and J. S. Vitter, editors, External Memory Algorithms, vol. 50 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 161-179. AMS Press 1999.
16. J. S. Vitter. External memory algorithms and data structures. In J. M. Abello and J. S. Vitter, editors, External Memory Algorithms, vol. 50 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 1-38. AMS Press 1999.
17. R. Vudac, J. W. Demmel, and K. A. Yelick. The Optimized Sparse Kernel Interface (OSKI) Library: User's Guide for Version 1.0.1b. Berkeley Benchmarking and Optimization (BeBOP) Group, March 15 2006.
18. R. W. Vuduc. Automatic Performance Tuning of Sparse Matrix Kernels. PhD thesis, University of California, Berkeley, Fall 2003.