Efficient Data Distribution Scheme for Multi-Dimensional Sparse Arrays

Array operations are useful in a large number of important scientific codes, such as molecular dynamics, finite-element methods, climate modeling, etc. It is a challenging problem to provide an efficient data distribution for irregular problems. Multi-dimensional (MD) sparse array operations can be used in atmosphere and ocean sciences, image processing, etc., and have been an extensively investigated problem. In our previous work, a data distribution scheme, Encoding-Decoding (ED), was proposed for twodimensional (2D) sparse arrays. In this paper, ED is extended to be useful for MD sparse arrays first. Then, the performance of ED is compared with that of Send Followed Compress (SFC) and Compress Followed Send (CFS). Both theoretical analysis and experimental tests were conducted and then shown that ED is superior to SFC and CFS for all of evaluated criteria.

[1]  Chun-Yuan Lin,et al.  Performance evaluation of data distributions with load-balancing for sparse arrays , 2004, 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings..

[2]  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..

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

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

[5]  John G. Lewis,et al.  Sparse matrix test problems , 1982, SGNM.

[6]  Chun-Yuan Lin,et al.  Efficient Data Compression Methods for Multidimensional Sparse Array Operations Based on the EKMR Scheme , 2003, IEEE Trans. Computers.

[7]  Mahmut T. Kandemir,et al.  Improving Cache Locality by a Combination of Loop and Data Transformation , 1999, IEEE Trans. Computers.

[8]  Message Passing Interface Forum.  MPI: A message - passing interface standard , 1994 .

[9]  Jenq Kuen Lee,et al.  Parallel Sparse Supports for Array Intrinsic Functions of Fortran 90 , 2001, The Journal of Supercomputing.

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

[11]  Don-Lin Yang,et al.  Parallel Volume Rendering with Sparse Data Structures , 2005, J. Inf. Sci. Eng..

[12]  Shahid H. Bokhari,et al.  A Partitioning Strategy for Nonuniform Problems on Multiprocessors , 1987, IEEE Transactions on Computers.

[13]  Emilio L. Zapata,et al.  Cache probabilistic modeling for basic sparse algebra kernels involving matrices with a non-uniform distribution , 1998, Proceedings. 24th EUROMICRO Conference (Cat. No.98EX204).

[14]  Chris H. Q. Ding,et al.  An Optimal Index Reshuffle Algorithm for Multidimensional Arrays and Its Applications for Parallel Architectures , 2001, IEEE Trans. Parallel Distributed Syst..

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

[16]  Boleslaw K. Szymanski,et al.  Run-Time Optimization of Sparse Matrix-Vector Multiplication on SIMD Machines , 1994, PARLE.

[17]  Barbara M. Chapman,et al.  Vienna-Fortran/HPF Extensions for Sparse and Irregular Problems and Their Compilation , 1997, IEEE Trans. Parallel Distributed Syst..