Michelle Mills Strout, Larry Carter, Jeanne Ferrante  Home/Search
Context
Related
| ucsd.edu/users/mstrout/techreport.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsd.edu/users/mstrout/paper (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Gauss-Seidel is an iterative computation used for solving a set of simultaneous linear equations, A~u = ~ f . If the matrix A uses a sparse matrix representation, storing only nonzeros, then the data dependences in the computation arise from A's nonzero structure. We use this structure to schedule the computation at runtime using a technique called full sparse tiling. The sparse tiled computation exhibits better data locality and therefore improved performance. This paper gives a complete... (Update)
Similar documents (at the sentence level):
6.0%: Proof of Correctness for Sparse Tiling of Gauss-Seidel - Strout, Carter, Ferrante (Correct)
Active bibliography (related documents): More All
0.7: Compile-time Composition of Run-time Data and Iteration.. - Strout, Carter, Ferrante (2003) (Correct)
0.6: Combining Performance Aspects of Irregular.. - Strout, Carter.. (2002) (Correct)
0.4: Michelle Strout's Research Statement - My Research Cuts (Correct)
Similar documents based on text: More All
1.1: Cv - Strout (Correct)
0.7: Rescheduling for Locality in Sparse Matrix Computations - Strout, Carter, Ferrante (Correct)
0.5: Using Sparse Tiling with Symmetric Multigrid - Strout, Carter, Ferrante (2002) (Correct)
BibTeX entry: (Update)
@misc{ strout-proof,
author = "Michelle Mills Strout and Larry Carter and Jeanne Ferrante",
title = "Proof of Correctness for Sparse Tiling of Gauss-Seidel",
url = "citeseer.ist.psu.edu/strout03proof.html" }
Citations (may not include all citations):474 A data locality optimizing algorithm (context) - Wolf, Lam - 1991
216 Strategies for cache and local memory management by global p.. (context) - Gannon, Jalby et al. - 1988
186 way partitioning scheme for irregular graphs (context) - Karypis, Kumar - 1998
178 Supernode partitioning (context) - Irigoin, Triolet - 1988
162 Improving data locality with loop transformations - McKinley, Carr et al. - 1996
111 More iteration space tiling (context) - Wolfe - 1989
48 New tiling techniques to improve cache temporal locality - Song, Li - 1999
32 Cache Optimization for Structured and Unstructured Grid Mult.. - Douglas, Hu et al. - 2000
30 Some simpli ed NP-complete graph problems (context) - Garey, Johnson et al. - 1976
23 Optimizing the Performance of Sparse Matrix-Vector Multiply (context) - Im - 2000
21 Finding legal reordering transformations using mappings - Kelly, Pugh - 1994
20 Iteration space tiling for memory hierarchies (context) - Wolfe - 1987
19 Synthesizing transformations for locality enhancement of imp.. - Ahmed, Mateev et al. - 2000
15 Architecture-cognizant divide and conquer algorithms - Gatlin, Carter - 1999
13 A unifying framework for iteration reordering transformation.. - Kelly, Pugh - 1995
7 Improving memory hierarchy performance for irregular applica.. - Mellor-Crummey, Whalley et al. - 2001
7 Rescheduling for locality in sparse matrix computations - Strout, Carter et al. - 2001
6 Compiler blockability of numerical algorithms (context) - Carr, Kennedy - 1992
3 Optimizing sparse matrix computations for register reuse in .. (context) - Im, Yelick - 2001
3 Localizing non-ane array references (context) - Mitchell, Carter et al. - 1999
3 Tiling optimizations for 3D scienti c computations (context) - Rivera, Tseng - 2000
3 Ecient compiler and run-time support for parallel irregular .. (context) - Han, Tseng - 2000
3 Combining performance aspects of irregular gauss-seidel via .. - Strout, Carter et al. - 2002
2 Cache-ecient multigrid algorithms (context) - Sellappa, Chatterjee - 2001
1 A multicolour sor method for the nite-element method (context) - Wu - 1990
Documents on the same site (http://www-cse.ucsd.edu/users/mstrout/paper.html): More
Schedule-Independent Storage Mapping for Loops - Strout, Carter, Ferrante, Simon (1998) (Correct)
Asynchronous Dynamic Load Balancing of Tiles - Nguyen, Strout, Carter, Ferrante (Correct)
Rescheduling for Locality in Sparse Matrix Computations - Strout, Carter, Ferrante (2001) (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