Efficient Strategies of Compressing Three-Dimensional Sparse Arrays Based on Intel XEON and Intel XEON Phi Environments
暂无分享,去创建一个
[1] Chun-Yuan Lin,et al. Efficient strategy for compressing sparse matrices on Graphics Processing Units , 2013, 2013 International Conference on Computational Problem-Solving (ICCP).
[2] Wei Li,et al. Unifying data and control transformations for distributed shared-memory machines , 1995, PLDI '95.
[3] Chun-Yuan Lin,et al. Efficient Data Distribution Scheme for Multi-Dimensional Sparse Arrays , 2007, J. Inf. Sci. Eng..
[4] Chun-Yuan Lin,et al. Efficient Data Compression Methods for Multidimensional Sparse Array Operations Based on the EKMR Scheme , 2003, IEEE Trans. Computers.
[5] John G. Lewis,et al. Sparse matrix test problems , 1982, SGNM.
[6] Yongchao Liu,et al. CUDASW++: optimizing Smith-Waterman sequence database searches for CUDA-enabled graphics processing units , 2009, BMC Research Notes.
[7] J. Cullum,et al. Lanczos algorithms for large symmetric eigenvalue computations , 1985 .
[8] Robert H. Halstead,et al. Matrix Computations , 2011, Encyclopedia of Parallel Computing.
[9] Chun-Yuan Lin,et al. Efficient Data Parallel Algorithms for Multidimensional Array Operations Based on the EKMR Scheme for Distributed Memory Multicomputers , 2003, IEEE Trans. Parallel Distributed Syst..
[10] Richard Barrett,et al. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.
[11] Chun-Yuan Lin,et al. Efficient Representation Scheme for Multidimensional Array Operations , 2002, IEEE Trans. Computers.