The Automatic Generation of Sparse Primitives

ACM Transactions on Mathematical Software

Volumn 24, Issue 2, 1998, Pages 190-225

  Bik, Aart J C ^a   Brinkhaus, Peter J H ^a   Knijnenburg, Peter M W ^a   Wijshoff, Harry A G ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Compilers; D.1.2 Programming Techniques : Automatic Programming; D.3.4 Programming Languages ; Data structure transformations; E.2 Data : Data Storage Representations; G.1.3 Numerical Analysis : Numerical Linear Algebra; Processors compilers

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA STORAGE EQUIPMENT; DATA STRUCTURES; LINEAR ALGEBRA; MATRIX ALGEBRA; PERFORMANCE; PROGRAM COMPILERS;

SPARSE MATRIX;

COMPUTER PROGRAMMING;

EID: 0032083929     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/290200.287636     Document Type: Article

References (34)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley Longman Publ. Co., Inc., Reading, MA.
2. BANERJEE, U. 1990. Unimodular transformations of double loops. In Proceedings of the 3rd Workshop on Languages and Compilers for Parallel Computing (Urbana, IL, Aug. 1-3, 1989), D. Gelernter, A. Nicolau, and D. Padua, Eds. Pitman Publishing, London, UK.
3. BANERJEE, U. 1993. Loop Transformations for Restructuring Compilers: The Foundations. Kluwer Academic Publishers, Hingham, MA.
4. BIK, A. J. C. 1996. Compiler support for sparse matrix computations. Ph.D. Dissertation. Department of Computer Science, Leiden University.
5. BIK, A. J. C. AND WIJSHOFF, H. A. G. 1994. On automatic data structure selection and code generation for sparse computations. In Languages and Compilers for Parallel Computing, Banerjee, U., Gelernter, D., Nicolau, A., and Padua, D., Eds. Springer Lecture Notes in Computer Science, vol. 768. Springer-Verlag, Berlin, Germany, 57-75.
6. BIK, A. J. C. AND WIJSHOFF, H. A. G. 1995. Advanced compiler optimizations for sparse computations. J. Parallel Distrib. Comput. 31, 1 (Nov.), 14-24.
7. BIK, A. J. C. AND WIJSHOFF, H. A. G. 1996a. Automatic data structure selection and transformation for sparse matrix computations. IEEE Trans. Parallel Distrib. Syst. 7, 2, 109-126.
8. BIK, A. J. C. AND WIJSHOFF, H. A. G. 1996b. The use of iteration space partitioning to construct representative simple sections. J. Parallel Distrib. Comput. 34, 95-110.
9. BOYLE, J. M., CLINT, M., FITZPATRICK, S., AND HARMER, T. J. 1992. The construction of numerical mathematical software for the AMT DAP by program transformation. In Parallel Processing: COVAPPV, L. Bouge, M. Cosnard, Y. Robert, and D. Trystram, Eds. Lecture Notes in Computer Science, vol. 634. Springer-Verlag, Berlin, Germany, 761-767.
10. COOPER, K. D., HALL, M. W., AND KENNEDY, K. 1992. Procedure cloning. In Proceedings of the IEEE International Conference on Computer Languages. IEEE Press, Piscataway, NJ, 96-105.
11. COOPER, K. D., KENNEDY, K., AND TORCZON, L. 1986. The impact of interprocedural analysis and optimization in the Rn programming environment. ACM Trans. Program. Lang. Syst. 8, 4 (Oct.), 491-523.
12. DODSON, D. S., GRIMES, R. G., AND LEWIS, J. G. 1991a. Algorithm 692: Model implementation and test package for the Sparse Basic Linear Algebra Subprograms. ACM Trans. Math. Softw. 17, 2 (June), 264-272.
13. DODSON, D. S., GRIMES, R. G., AND LEWIS, J. G. 1991b. Sparse extensions to the FORTRAN Basic Linear Algebra Subprograms. ACM Trans. Math. Softw. 17, 2 (June), 253-263.
14. DONGARRA, J. J., DU CROZ, J., HAMMARLING, S., AND DUFF, I. 1990a. A set of level 3 Basic Linear Algebra Subprograms. ACM Trans. Math. Softw. 16, 1 (Mar.), 1-17.
15. DONGARRA, J. J., DU CROZ, J., HAMMARLING, S., AND DUFF, I. 1990b. A set of level 3 basic linear algebra subprograms: Model implementation and test programs. ACM Trans. Math. Softw. 16, 1 (Mar.), 18-28.
16. DONGARRA, J. J., DU CROZ, J., HAMMARLING, S., AND HANSON, R. J. 1988a. An extended set of FORTRAN Basic Linear Algebra Subprograms. ACM Trans. Math. Softw. 14, 1 (Mar.), 1-17.
17. DONGARRA, J. J., DU CROZ, J., HAMMARLING, S., AND HANSON, R. J. 1988b. An extended set of FORTRAN basic linear algebra subprograms: Model implementation and test programs. ACM Trans. Math. Softw. 14, 1 (Mar.), 18-32.
18. DONGARRA, J. J., DUFF, I. S., SORENSEN, D. C., AND VAN DER VORST, H. A. 1991. Solving Linear Systems on Vector and Shared Memory Computers. SIAM, Philadelphia, PA.
19. DUFF, I. S., ERISMAN, A. M., AND REID, J. K. 1990. Direct Method for Sparse Matrices. Oxford Science Publications, Kingston, Ontario, Canada.
20. DUFF, I. S., GRIMES, R. G., AND LEWIS, J. G. 1989. Sparse matrix test problems. ACM Trans. Math. Softw. 15, 1 (Mar.), 1-14.
21. DUFF, I. S., MARRONE, M., RADICATI, G., AND VITTOLI, C. 1997. Level 3 basic linear algebra subprograms for sparse matrices: A user level interface. ACM Trans. Math. Softw. 23, 3 (Sept.).
22. FITZPATRICK, S., CLINT, M., AND KILPATRICK, P. 1995. The automated derivation of sparse implementations of numerical algorithms through program transformation. Tech. Rep. Apr-SF.MC.PLK. Deparment of Computer Science, The Queen's University of Belfast, Belfast, Ireland, UK.
23. FITZPATRICK, S., HARMER, T. J., AND BOYLE, J. M. 1994. Deriving efficient parallel implementations of algorithms operating on general sparse matrices using automatic program transformation. In Parallel Processing: ConPar 94 - VAPP VI, B. Buchberger and J. Volkert, Eds. Lecture Notes in Computer Science, vol. 854. Springer-Verlag, Berlin, Germany, 148-159.
24. GEORGE, A. AND LIU, J. W. H. 1981. Computer Solution of Large Sparse Positive Definite Systems. Prentice Hall Press, Upper Saddle River, NJ.
25. KUMAR, V., GRAMA, A., GUPTA, A., AND KARYPIS, G. 1994. Introduction to Parallel Programming. Benjamin-Cummings Publ. Co., Inc., Redwood City, CA.
26. LAWSON, C. L., HANSON, R. J., KINCAID, D. R., AND KROGH, F. T. 1979a. Algorithm 539: Basic linear algebra subprograms for FORTRAN usage. ACM Trans. Math. Softw. 5, 3, 324-325.
27. LAWSON, C. L., HANSON, R. J., KINCAID, D. R., AND KROGH, F. T. 1979b. Basic linear algebra subprograms for Fortran usage. ACM Trans. Math. Softw. 5, 3, 308-323.
28. ØSTERBY, O. AND ZLATEV, Z. 1983. Direct Methods for Sparse Matrices. Springer Lecture Notes in Computer Science, vol. 157. Springer-Verlag, Berlin, Germany.
29. PISSANETSKY, S. 1984. Sparse Matrix Technology. Academic Press Ltd., London, UK.
30. SAAD, Y. 1990. SPARSKIT: A basic tool for sparse matrix computations. Tech. Rep. 90-20. RIACS, NASA Ames Research Center, Moffett Field, CA.
31. SAAD, Y. AND WIJSHOFF, H. A. G. 1990. Spark: A benchmark package for sparse computations. In Proceedings of the 1990 International Conference on Supercomputing (ICS '90, Amsterdam, The Netherlands, June 11-15). ACM Press, New York, NY, 239-253.
32. WIJSHOFF, H. A. G. 1993. Implementing sparse BLAS primitives on concurrent/vector processors: A case study. In Lectures on Parallel Computation, Gibbons, A. and Spirakis, P., Eds. Cambridge International Series on Parallel Computation. Cambridge University Press, New York, NY, 405-437.
33. ZIMA, H. AND CHAPMAN, B. 1991. Supercompilers for Parallel and Vector Computers. ACM Press Frontier Series. ACM Press, New York, NY.
34. ZLATEV, Z. 1991. Computational Methods for General Sparse Matrices. Kluwer B.V., Deventer, The Netherlands.