Accelerating sparse matrix computations via data compression
暂无分享,去创建一个
[1] Guy E. Blelloch,et al. An Experimental Analysis of a Compact Graph Representation , 2004, ALENEX/ANALC.
[2] Guy E. Blelloch,et al. Index compression through document reordering , 2002, Proceedings DCC 2002. Data Compression Conference.
[3] Hugh E. Williams,et al. Compression of inverted indexes For fast query evaluation , 2002, SIGIR '02.
[4] John M. Mellor-Crummey,et al. Optimizing Sparse Matrix–Vector Product Computations Using Unroll and Jam , 2004, Int. J. High Perform. Comput. Appl..
[5] Hyun Jin Moon,et al. Fast Sparse Matrix-Vector Multiplication by Exploiting Variable Block Structure , 2005, HPCC.
[6] Sriram Raghavan,et al. Representing Web graphs , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).
[7] Fred G. Gustavson,et al. Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations , 1970, JACM.
[8] Tien-Fu Chen,et al. Inverted file compression through document identifier reassignment , 2003, Inf. Process. Manag..
[9] Sivan Toledo,et al. Improving the memory-system performance of sparse-matrix vector multiplication , 1997, IBM J. Res. Dev..
[10] Fabrizio Silvestri,et al. Assigning document identifiers to enhance compressibility of Web Search Engines indexes , 2004, SAC '04.
[11] Torsten Suel,et al. Compressing the graph structure of the Web , 2001, Proceedings DCC 2001. Data Compression Conference.
[12] P. Sadayappan,et al. On improving the performance of sparse matrix-vector multiplication , 1997, Proceedings Fourth International Conference on High-Performance Computing.
[13] Richard F. Barrett,et al. Matrix Market: a web resource for test matrix collections , 1996, Quality of Numerical Software.
[14] David E. Keyes,et al. Towards Realistic Performance Bounds for Implicit CFD Codes , 2000 .
[15] Andrew Trotman,et al. Compressing Inverted Files , 2004, Information Retrieval.
[16] Alistair Moffat,et al. Compressed inverted files with reduced decoding overheads , 1998, SIGIR '98.
[17] Guy E. Blelloch,et al. Compact representations of separable graphs , 2003, SODA '03.
[18] Jack Dongarra,et al. Templates for the Solution of Algebraic Eigenvalue Problems , 2000, Software, environments, tools.
[19] Ramesh C. Agarwal,et al. A high performance algorithm using pre-processing for the sparse matrix-vector multiplication , 1992, Proceedings Supercomputing '92.
[20] Si-Qing Zheng,et al. An efficient algorithm for sparse matrix computations , 1992, SAC '92.
[21] Richard W. Vuduc,et al. Sparsity: Optimization Framework for Sparse Matrix Kernels , 2004, Int. J. High Perform. Comput. Appl..
[22] David E. Keyes,et al. Four Horizons for Enhancing the Performance of Parallel Simulations Based on Partial Differential Equations , 2000, Euro-Par.
[23] Sebastiano Vigna,et al. The webgraph framework I: compression techniques , 2004, WWW '04.
[24] Yoshinari Fukui,et al. Supercomputing of circuits simulation , 1989, Supercomputing '89.
[25] Eduardo F. D'Azevedo,et al. Vectorized Sparse Matrix Multiply for Compressed Row Storage Format , 2005, International Conference on Computational Science.
[26] Rajeev Motwani,et al. The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.
[27] Micah Adler,et al. Towards compressing Web graphs , 2001, Proceedings DCC 2001. Data Compression Conference.