Now showing items 1-4 of 4

    • 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 ...
    • Locality Enhancement Of Imperfectly-nested Loop Nests 

      Ahmed, Nawaaz (Cornell University, 2000-08-23)
      Most numerical applications using arrays require extensive program transformation in order to perform well on current machine architectures with deep memory hierarchies. These transformations ensure that an execution of ...
    • 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 ...