Efficient strategy for compressing sparse matrices on Graphics Processing Units

Sparse matrix is used in a large number of important application codes, such as molecular dynamics, finite element methods, path problems, and etc. Much research has proposed several techniques to improve the performance for the sparse matrix operations based on the Graphic Processing Unit (GPU). However, there is no efficient method for compressing sparse matrix on GPU. Hence, in this paper, we design a strategy to efficiently compress sparse matrices based on the concept of GPU. Moreover, we discover the compressing sparse matrix problem that runs on the GPU could encounter some prefix sum problems under the SIMT architecture. We further propose two other types of prefix sum, horizontal prefix sum (HPS) and vertical prefix sum (VPS) in order to solve the compressing sparse matrix problem on GPU.

[1]  Guy E. Blelloch,et al.  Prefix sums and their applications , 1990 .

[2]  C. K. Michael Tse,et al.  Application of complex-network theories to the design of short-length low-density-paritycheck codes , 2009, IET Commun..

[3]  Chun-Yuan Lin,et al.  Efficient Data Distribution Schemes for EKMR-Based Sparse Arrays on Distributed Memory Multicomputers , 2005, The Journal of Supercomputing.

[4]  W. Marsden.  I and J , 2012 .

[5]  Chun-Yuan Lin,et al.  Efficient Data Distribution Scheme for Multi-Dimensional Sparse Arrays , 2007, J. Inf. Sci. Eng..

[6]  Anantha Chandrakasan,et al.  Energy-scalable algorithms and protocols for wireless microsensor networks , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[7]  A. Barabasi,et al.  Hierarchical Organization of Modularity in Metabolic Networks , 2002, Science.

[8]  Joel H. Saltz,et al.  Parallelization Techniques for Sparse Matrix Applications , 1996, J. Parallel Distributed Comput..

[9]  Gene H. Golub,et al.  Matrix computations , 1983 .

[10]  Jae-Young Ahn,et al.  Adaptive modulation for MIMO systems with V-BLAST detection , 2003, The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring..

[11]  Wendi Heinzelman,et al.  Proceedings of the 33rd Hawaii International Conference on System Sciences- 2000 Energy-Efficient Communication Protocol for Wireless Microsensor Networks , 2022 .

[12]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[13]  Chun-Yuan Lin,et al.  Data distribution schemes of sparse arrays on distributed memory multicomputers , 2007, The Journal of Supercomputing.

[14]  J. Cullum,et al.  Lanczos algorithms for large symmetric eigenvalue computations , 1985 .

[15]  S. Havlin,et al.  Self-similarity of complex networks , 2005, Nature.

[16]  Richard Barrett,et al.  Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

[17]  S. Havlin,et al.  How to calculate the fractal dimension of a complex network: the box covering algorithm , 2007, cond-mat/0701216.