M. M. Strout, L. Carter, and J. Ferrante. Rescheduling for locality in sparse matrix computations. In V.N.Alexandrov, J.J. Dongarra, Computer Science. Springer, May 28-30, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Cache Behavior Analysis without Profiling - Beyls, D'Hollander (Correct)
....cache misses, the programmer needs to do it itself, possibly by changing the algorithms. Clearly, it is desirable that the compiler can optimize a programs cache behavior maximally, without programmer intervention. A large number of program transformations have been proposed to reduce cache misses[9, 8, 13, 15, 1, 2]. However, before the compiler can decide which transformations are pro table, it needs to know the cache behavior of the program region it would apply them to. In this paper, a method is devised which calculates the cache behavior of sequences of loop regions in the program. 1.2 Cache ....
M. M. Strout, L. Carter, and J. Ferrante. Rescheduling for locality in sparse matrix computations. In V.N.Alexandrov, J. Dongarra, and C.J.K.Tan, editors, Proceedings of the 2001.
Cache Behavior Analysis without Profiling - Beyls, D'Hollander (Correct)
....cache misses, the programmer needs to do it itself, possibly by changing the algorithms. Clearly, it is desirable that the compiler can optimize a programs cache behavior maximally, without programmer intervention. A large number of program transformations have been proposed to reduce cache misses[9, 8, 13, 15, 1, 2]. However, before the compiler can decide which transformations are profitable, it needs to know the cache behavior of the program region it would apply them to. In this paper, a method is devised which calculates the cache behavior of sequences of loop regions in the program exactly. 1.2 Cache ....
M. M. Strout, L. Carter, and J. Ferrante. Rescheduling for locality in sparse matrix computations. In V.N.Alexandrov, J. Dongarra, and C.J.K.Tan, editors, Proceedings of the 2001.
Compile-time Composition of Run-time Data and Iteration.. - Strout, Carter, Ferrante (2003) (4 citations) Self-citation (Strout Carter Ferrante) (Correct)
....between loop iterations, when non a#ne memory references are involved. We can also express run time data and iteration reordering transformations for locality, which include consecutive packing [7] graph partitioning [12] bucket tiling [21] lexicographical grouping [7] full sparse tiling [29], and cache blocking [9] Describing the e#ect of run time data and iteration reorderings in a compile time framework has several advantages. First, both run time and compile time transformations are uniformly described. Secondly, the transformation legality checks provide constraints on the ....
....this paper always use lexGroup for reordering the iteration of the j loop. fx1 fx4 fx2 fx5 fx6 fx3 fx 1 2 3 4 5 6 7 8 j Figure 4: Example of Figure 2 mapping after the CPACK data reordering followed by a lexGroup iteration reordering. Sparse tiling programming techniques, full sparse tiling [29] and cache blocking [9] were developed for an important kernel used in Finite Element Methods, Gauss Seidel. Sparse tiling results in run time generated tiles or iteration slices [24] that cut between loops or across an outer loop and that only access a subset of the total data. By performing ....
M. M. Strout, L. Carter, and J. Ferrante. Rescheduling for locality in sparse matrix computations. In V.N.Alexandrov, J.J. Dongarra, Computer Science. Springer, May 28-30, 2001.
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