See this document in CiteSeerX!

Rescheduling for Locality in Sparse Matrix Computations  (Make Corrections)  (7 citations)
Michelle Mills Strout, Larry Carter, Jeanne Ferrante
Lecture Notes in Computer Science



  Home/Search   Context   Related

 
View or download:
ucsd.edu/users/carter/P...icscShelly.ps
ucsd.edu/~mstrout/myschedalg.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ucsd.edu/users/ferrante/papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . In modern computer architecture the use of memory hierarchies causes a program's data locality to directly affect performance. Data locality occurs when a piece of data is still in a cache upon reuse. For dense matrix computations, loop transformations can be used to improve data locality. However, sparse matrix computations have non-affine loop bounds and indirect memory references which prohibit the use of compile time loop transformations. This paper describes an algorithm to tile... (Update)

Context of citations to this paper:   More

...Figure 3. A visual comparison of the two sparse tiling techniques. There are two known sparse tiling techniques. Our previous work [33] developed a sparse tiling technique which in this paper we call full sparse tiling. Douglas et al. 12] described another sparse tiling...

.... which include consecutive packing [6] graph partitioning [9] bucket tiling [18] lexicographical grouping [6] full sparse tiling [26], and cache blocking [7] We show how the symbolic e#ect of a run time transformation can be propagated to relevant data mappings and...

Cited by:   More
Michelle Strout's Research Statement - My Research Cuts   (Correct)
Combining Performance Aspects of Irregular.. - Strout, Carter.. (2002)   (Correct)
Proof of Correctness for Sparse Tiling of Gauss-Seidel - Strout, Carter, Ferrante (2003)   (Correct)

Similar documents (at the sentence level):
6.2%:   Tiling of Iterative Sparse Matrix Computations - Strout, Carter, Ferrante..   (Correct)

Active bibliography (related documents):   More   All
0.4:   Rescheduling for Locality in Sparse Matrix Computations - Strout, Carter, Ferrante (2001)   (Correct)
0.3:   Using Sparse Tiling with Symmetric Multigrid - Strout, Carter, Ferrante (2002)   (Correct)
0.3:   Statistical Models for Automatic Performance Tuning - Vuduc, Demmel, Bilmes (2001)   (Correct)

Similar documents based on text:   More   All
0.5:   Cv - Strout   (Correct)
0.4:   Compile-time Composition of Run-time Data and Iteration.. - Strout, Carter, Ferrante (2003)   (Correct)
0.2:   Algorithms + Data Structures + Transformations = Portable Program .. - Strout (2000)   (Correct)

Related documents from co-citation:   More   All
6:   Cache Optimization for Structured and Unstructured Grid Multigrid - Douglas, Hu et al. - 1999
5:   New tiling techniques to improve cache temporal locality - Song, Li - 1999
5:   Iteration Space Tiling for Memory Hierarchies (context) - Wolfe - 1987

BibTeX entry:   (Update)

Michelle Mills Strout, Larry Carter, and Jeanne Ferrante. Rescheduling for locality in sparse matrix computations. In V.N.Alexandrov, J.J. Dongarra, and C.J.K.Tan, editors, Proceedings of the http://citeseer.ist.psu.edu/444150.html   More

@article{ strout01rescheduling,
    author = "Michelle Mills Strout and Larry Carter and Jeanne Ferrante",
    title = "Rescheduling for Locality in Sparse Matrix Computations",
    journal = "Lecture Notes in Computer Science",
    volume = "2073",
    pages = "137--??",
    year = "2001",
    url = "citeseer.ist.psu.edu/444150.html" }
Citations (may not include all citations):
225   Some simplified NP- complete graph problems (context) - Garey, Johnson et al. - 1976
186   way partitioning scheme for irregular graphs (context) - Karypis, Kumar - 1998
157   Automatically tuned linear algebra software - Whaley, Dongarra - 1998
124   Fftw: An adaptive software architecture for the fft - Frigo, Johnson - 1998
123   Optimizing matrix multiply using PHiPAC: a Portable - Bilmes, Asanovi'c et al. - 1997
98   High Performance Compilers for Parallel Computing (context) - Wolfe - 1996
57   Improving cache performance in dynamic applications through .. - Ding, Kennedy - 1999
47   Metis: A Software Package for Partitioning Unstructured Grap.. (context) - Karypis, Kumar - 1998
32   Cache Optimization for Structured and Unstructured Grid Mult.. - Douglas, Hu et al. - 2000
30   Improving memory hierarchy performance for irregular applica.. (context) - Mellor-Crummey, Whalley et al. - 1999
23   Localizing non-affine array references - Mitchell, Carter et al. - 1999
23   Optimizing the Performance of Sparse Matrix-Vector Multiply (context) - Im - 2000
14   A supernodal approach to sparse partial pivoting (context) - Demmel, Eisenstat et al. - 1999
4   Efficient compiler and run-time support for parallel irregul.. - Han, Tseng - 2000
3   Guiding Program Transformations with Modal Performance Model - Mitchell - 2000
1   the finite element toolkit (context) - Holst
1   Portable High Performance Programming via ArchitectureCogniz.. - Gatlin - 2000



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www-cse.ucsd.edu/users/ferrante/papers.html):   More
Selecting Tile Shape for Minimal Execution Time - Karin Hogstedt (1999)   (Correct)
Analyzing Asynchronous Pipeline Schedules - Donaldson, Ferrante (1997)   (Correct)
Localizing Non-affine Array References - Mitchell, Carter, Ferrante (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC