A relational approach to the compilation of sparse matrix programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1300 LNCS, Issue , 1997, Pages 318-327

  Kotlyax, Vladimir ^a   Pingali, Keshav ^a   Stodghill, Paul ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL KERNELS; RELATIONAL ALGEBRA; SPARSE MATRICES;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

PROGRAM COMPILERS;

EID: 78249236370     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. Corinne Ancourt and Pranois Irigoin. Scanning polyhedra with, do loops. In Principle and Practice of Parallel Programming, pages 39-50, April 1991.
2. Argonne National Laboratory. PETSc, the Portable, Extensible Toolkit for Scientific Computation, http://www.mcs.anl.gov/petsc/petsc.html.
3. Aart J.C. Bik and Harry A.G. Wijshoff. Advanced compiler optimizations for sparse computations. Journal of Parallel and Distributed Computing, 31:14-24, 1995.
4. Aart J.C. Bik and Harry A.G. Wijshoff. Automatic data structure selection and transformation for sparse matrix computations. IEEE Transactions on Parallel and Distributed Systems, 7(2): 109-126, 1996.
5. Henri Cohen. A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics. Springer-Verlag, 1995.
6. Alan George and Joseph W-H Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice Hall, Inc., 1981.
7. Mark T. Jones and Paul E. Plassmann. BlockSolve95 users manual: Scalable library software for the parallel solution of sparse linear systems. Technical Report ANL-95/48, Argonne National Laboratory, December 1995.
8. Vladimir Kotlyar, Keshav Pingali, and Paul Stodghill. Compiling parallel sparse code for user-defined data structures. In Proceedings of Eights SIAM Conference on Parallel Processing for Scientific Computing, March 1997. Available as Cornell Computer Science Technical Report from http://cs-tr.cs. cornell.edu.
9. Wei Li and Keshav Pingali. Access Normalization: Loop restructuring for NUMA compilers. ACM Transactions on Computer Systems, 11(4):353-375, November 1993.
10. Sergio Pissantezky. Sparse Matrix Technology. Academic Press, London, 1984.
11. Raghu Ramakrishnan. Database Management Systems. College Custom Series. McGraw-Hill, Inc, beta edition, 1996.
12. Gilbert Strang. Introduction to applied mathematics. Wellesley-Cambridge Press, 1986.
13. Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, v. I and II. Computer Science Press, 1988.