The SPARAMAT approach to automatic comprehension of sparse matrix computations

Proceedings - 7th International Workshop on Program Comprehension, IWPC 1999

Volumn , Issue , 1999, Pages 200-207

  Keßler, Christoph W ^a   Smith, Craig H ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BAR CODES; CODES (SYMBOLS); MATRIX ALGEBRA;

AUTOMATIC PROGRAMS; SPARSE MATRICES; SPARSE MATRIX COMPUTATIONS; STORAGE FORMATS;

COMPUTER PROGRAMMING;

EID: 84863051745     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WPC.1999.777759     Document Type: Conference Paper

References (39)

1. Z. Ammarguellat and W. Harrison III. Automatic Recognition of Induction Variables and Recurrence Relations by Abstract Interpretation. Proc. Conf. on Progr. Language Design and Implementation, pp. 283-295. ACM, June 1990.
2. R. Barrett et al. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, 1994.
3. S. Bhansali et al. Parallelizing sequential programs by algorithm-level transformations. In V. Rajlich and A. Cimitile, eds., Proc. 3rd IEEE Workshop on Program Comprehension, pp. 100-107. IEEE CS Press, Nov. 1994.
4. A. J. Bik and H. A. Wijshoff. Automatic Data Structure Selection and Transformation for Sparse Matrix Computations. IEEE Trans. on Parallel and Distributed Systems, 7(2):109-126, Feb. 1996.
5. A. J. C. Bik. Compiler support for sparse matrix computations. PhD thesis, Leiden University, 1996.
6. W. Blume et al. Polaris: The next generation in parallelizing compilers,. Proc. 7th Wksh. on Languages and Compilers for Parallel Computing, 1994.
7. R. Boisvert et al. Matrix-market: a web resource for test matrix collections. In The Quality of Numerical Software: Assessment and Enhancement, pp. 125-137. Chapman and Hall, 1997.
8. P. Bose. Interactive Program Improvement via EAVE: An Expert Adviser for Vectorization. Proc. Int. Conf. on Supercomputing, pp. 119-130, July 1988.
9. T. Brandes, M. Sommer. A Knowledge-Based Parallelization Tool in a Programming Environment. 16th Int. Conf. on Par. Processing, 446-448, 1987.
10. D. Callahan. Recognizing and parallelizing bounded recurrences. Proc. 4th Workshop on Languages and Compilers for Parallel Computing, 1991.
11. M. I. Cole. Algorithmic Skeletons: Structured Management of Parallel Computation. Pitman and MIT Press, 1989.
12. B. DiMartino and C.W. Keßler. Program comprehension engines for automatic parallelization: A comparative study. In I. Jelly, I. Gorton, and P. Croll, eds., Proc. 1st Int. Wksh. on Software Eng. for Par. and Distr. Systems, pp. 146-157. London: Chapman & Hall, Mar. 1996.
13. I. S. Duff. MA28 - a set of Fortran subroutines for sparse unsymmetric linear equations. Tech. rept. AERE R8730, HMSO, London. Sources at [26], 1977.
14. M. Gerlek, E. Stoltz, and M. Wolfe. Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA form. ACM Trans. Prog. Lang. Syst., 17(1):85-122, Jan. 1995.
15. R. Grimes. SPARSE-BLAS basic linear algebra subroutines for sparse matrices, written in Fortran77. Source code available via netlib [26], 1984.
16. M. Harandi and J. Ning. Knowledge-based program analysis. IEEE Software, pp. 74-81, January 1990.
17. C. W. Keßler. Pattern-driven Automatic Parallelization. Scientific Programming, 5:251-274, 1996.
18. C.W. Keßler. Applicability of Program Comprehension to SparseMatrix Computations. Proc. 3rd Int. Euro-Par Conference. Springer LNCS, Aug. 1997.
19. C. W. Keßler, H. Seidl, and C. H. Smith. The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations. Technical Report 99-?, Universität Trier, FB IV - Mathematik/Informatik, 54286 Trier, Germany, 1999.
20. E. Koutsofios and S. North. Drawing graphs with dot. Technical Report 910904-59113-08TM, AT&T Bell Laboratories, Murray Hill, NJ, Sept. 1991.
21. W. Kozaczynski, J. Ning, and T. Sarver. Program concept recognition. Proc. KBSE'92 7th Knowledge-Based Software Eng. Conf., pp. 216-225, 1992.
22. K. Kundert. SPARSE 1.3 package of routines for sparse matrix LU factorization, written in C. Source code available via netlib [26], 1988.
23. B. D. Martino and G. Iannello. Pap Recognizer: a Tool for Automatic Recognition of Parallelizable Patterns. Proc. 4th Wksh. on Program Comprehension. IEEE CS Press, Mar. 1996.
24. R. Metzger. Automated Recognition of Parallel Algorithms in Scientific Applications. IJCAI-95 Workshop Program Working Notes: "The Next Generation of Plan Recognition Systems", Aug. 1995.
25. R. Mirchandaney, J. Saltz, R. Smith, D. Nicol, and K. Crowley. Principles of run-time support for parallel processors. In Proc. 2nd ACM Int. Conf. on Supercomputing, pp. 140-152. ACM Press, July 1988.
26. NETLIB. Collection of free scientific software. Accessible by anonymous ftp to netlib2.cs.utk.edu or netlib.no or e-mail "send index" to netlib@netlib.no.
27. S. Paul and A. Prakash. A Framework for Source Code Search using Program Patterns. IEEE Trans. on Software Engineering, 20(6):463-475, 1994.
28. S. S. Pinter and R. Y. Pinter. Program Optimization and Parallelization Using Idioms. Proc. ACM Symp. on Principles of Progr. Languages, pp. 79-92, 1991.
29. B. Pottenger and R. Eigenmann. Idiom Recognition in the Polaris Parallelizing Compiler. In Proc. 9th ACM Int. Conf. on Supercomputing, pp. 444-448, 1995.
30. X. Redon and P. Feautrier. Detection of Recurrences in Sequential Programs with Loops. In PARLE 93, Springer LNCS vol. 694, pp. 132-145, 1993.
31. C. Rich and L. M. Wills. Recognizing a Program's Design: A Graph-Parsing Approach. IEEE Software, pp. 82-89, Jan. 1990.
32. Y. Saad. SPARSKIT: a basic tool kit for sparse matrix computations, Version 2. Research report, U. of Minnesota, Minneapolis, MN 55455, June 1994.
33. G. Sabot and S. Wholey. Cmax: a Fortran Translator for the Connection Machine System. Proc. 7th ACM Int. Conf. on Supercomputing, 147-156, 1993.
34. M. K. Seager and A. Greenbaum. Slap: Sparse Linear Algebra Package, Version 2. Source code available via netlib [26], 1989.
35. L. Snyder. Recognition and Selection of Idioms for Code Optimization. Acta Informatica, 17:327-348, 1982.
36. M. Ujaldon, E. Zapata, S. Sharma, and J. Saltz. Parallelization Techniques for Sparse Matrix Applications. J. of Parallel and Distr. Computing, 38(2), 1996.
37. H. Zima and B. Chapman. Supercompilers for Parallel and Vector Computers. ACM Press Frontier Series. Addison-Wesley, 1990.
38. Z. Zlatev. Computational Methods for General Sparse Matrices. Kluwer 1991.
39. Z. Zlatev, J. Wasniewsky, and K. Schaumburg. Y12M - Solution of Large and Sparse Systems of Linear Algebraic Equations. Springer LNCS vol. 121, 1981.