The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
暂无分享,去创建一个
[1] J. M. Landsberg,et al. Geometry and the complexity of matrix multiplication , 2007, ArXiv.
[2] Josep-Lluís Larriba-Pey,et al. Block algorithms for sparse matrix computations on high performance workstations , 1996, ICS '96.
[3] John R. Gilbert,et al. Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication , 2008, 2008 37th International Conference on Parallel Processing.
[4] Alok Aggarwal,et al. The input/output complexity of sorting and related problems , 1988, CACM.
[5] H. T. Kung,et al. I/O complexity: The red-blue pebble game , 1981, STOC '81.
[6] Michael A. Bender,et al. Optimal sparse matrix dense vector multiplication in the I/O-model , 2007, SPAA.
[7] A. Heinecke,et al. Cache Oblivious Dense and Sparse Matrix Multiplication Based on Peano Curves , 2008 .
[8] Markus Kowarschik,et al. An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms , 2002, Algorithms for Memory Hierarchies.