Now showing items 1-7 of 7

    • The Bernoulli Generic Matrix Library 

      Mateev, Nikolay; Pingali, Keshav; Stodghill, Paul (Cornell University, 2000-07-27)
      We have implemented the Bernoulli generic programming system for sparse matrix computations. What distinguishes it from existing generic sparse matrix libraries is that we use (i) a high-level matrix abstraction for writing ...
    • Compiling Imperfectly-nested Sparse Matrix Codes with Dependences 

      Ahmed, Nawaaz; Mateev, Nikolay; Pingali, Keshav; Stodghill, Paul (Cornell University, 2000-03-07)
      We present compiler technology for generating sparse matrix code from (i) dense matrix code and (ii) a description of the indexing structure of the sparse matrices. This technology embeds statement instances into a Cartesian ...
    • Fractal Symbolic Analysis for Program Transformations (*new file*) 

      Mateev, Nikolay; Menon, Vijay; Pingali, Keshav (Cornell University, 2000-02-02)
      Restructuring compilers use dependence analysis to prove that the meaning of a program is not changed by a transformation. A well-known limitation of dependence analysis is that it examines only the memory locations ...
    • A Generic Programming System for Sparse Matrix Computations 

      Mateev, Nikolay; Kotlyar, Vladimir; Pingali, Keshav; Stodghill, Paul (Cornell University, 1999-07)
      Sparse matrices are stored in compressed formats in which zeros are not stored explicitly. Writing high-performance sparse matrix libraries is a difficult and tedious job because there are many compressed formats in use ...
    • Left-looking to Right-looking and vice versa: An Application of FractalSymbolic Analysis to Linear Algebra Code Restructuring 

      Mateev, Nikolay; Menon, Vijay; Pingali, Keshav (Cornell University, 2000-08-01)
      We have recently developed a new program analysis strategy called fractal symbolic analysis that addresses some of limitations of techniques such as dependence analysis. In this paper, we show how fractal symbolic analysis ...
    • Tiling Imperfectly-nested Loop Nests (REVISED) 

      Ahmed, Nawaaz; Mateev, Nikolay; Pingali, Keshav (Cornell University, 2000-01-31)
      Tiling is one of the more important transformations for enhancing locality of reference in programs. Tiling of perfectly-nested loop nests (which are loop nests in which all assignment statements are contained in the ...
    • Tiling Imperfectly-nested Loops 

      Ahmed, Nawaaz; Mateev, Nikolay; Pingali, Keshav (Cornell University, 1999-09)
      Tiling is one of the more important transformations for enhancing locality of reference in programs. Intuitively, tiling a set of loops achieves the effect of interleaving iterations of these loops. Tiling has been applied ...