Simple Quantitative Experiments with a Sparse Compiler

The complexity of writing sparse codes can be simplified enormously if the sparsity of matrices is dealt with at compilation level rather than at programming level. In this approach, a compiler automatically transforms a program operating 2-dimensional arrays into code that operates on sparse storage schemes.

[1]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

[2]  John G. Lewis,et al.  Algorithm 692: Model implementation and test package for the Sparse Basic Linear Algebra Subprograms , 1991, TOMS.

[3]  Youcef Saad,et al.  A Basic Tool Kit for Sparse Matrix Computations , 1990 .

[4]  Sergio Pissanetzky,et al.  Sparse Matrix Technology , 1984 .

[5]  Aart J. C. Bik,et al.  Compiler support for sparse matrix computations , 1996 .

[6]  Aart J. C. Bik,et al.  Advanced Compiler Optimizations for Sparse Computations , 1995, J. Parallel Distributed Comput..

[7]  Aart J. C. Bik,et al.  Simple Qualitative Experiments with a Sparse Compiler , 1996, LCPC.

[8]  Fred G. Gustavson,et al.  Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition , 1978, TOMS.

[9]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[10]  Z. Zlatev.  Computational Methods for General Sparse Matrices , 1991 .

[11]  Ken Kennedy,et al.  Procedure cloning , 1992, Proceedings of the 1992 International Conference on Computer Languages.

[12]  Yousef Saad,et al.  SPARK: a benchmark package for sparse computations , 1990, ICS '90.

[13]  Aart J. C. Bik,et al.  The Use of Iteration Space Partitioning to Construct Representative Simple Sections , 1996, J. Parallel Distributed Comput..

[14]  Aart J. C. Bik,et al.  On Automatic Data Structure Selection and Code Generation for Sparse Computations , 1993, LCPC.

[15]  Aart J. C. Bik,et al.  Automatic Data Structure Selection and Transformation for Sparse Matrix Computations , 1996, IEEE Trans. Parallel Distributed Syst..

[16]  Y. Saad,et al.  Krylov Subspace Methods on Supercomputers , 1989 .

[17]  John G. Lewis,et al.  Sparse extensions to the FORTRAN Basic Linear Algebra Subprograms , 1991, TOMS.