We present a framework for unifying iteration reordering transformations such as loop interchange, loop distribution, skewing, tiling, index set splitting and statement reordering. The framework is based on the idea that a transformation can be represented as a mapping from the original iteration space to a new iteration space. The framework is designed to provide a uniform way to represent and reason about transformations. We also provide algorithms to test the legality of mappings, and to generate optimized code for mappings. (Also cross-referenced as UMIACS-TR-95-30
Loop-nests in most scientific applications perform repetitive operations on array(s) and account for...
International Conference on Embedded and Ubiquitous Computing, EUC 2005, Nagasaki, 6-9 December 2005...
Nested loops are the most critical sections in many scientific and Digital Signal Processing (DSP)ap...
We present a framework for unifying iteration reordering transformations such as loop intercha...
There has been a great amount of recent work toward unifying iteration reordering transformations. ...
In previous work, we presented a framework for unifying iteration reordering transformations su...
In this paper we present a new theory of linear loop transformations called Computation Decompositio...
grantor: University of TorontoRestructuring compilers have been effective in tailoring nes...
We wish to extend the effectiveness of loop-restructuring compilers by improving the robustness of l...
In this paper we present a new loop transformation technique called Computation Decomposition and Al...
In this paper we generalize the framework of linear loop transformations: we consider loop alignment...
In this tutorial, we address the problem of restructuring a (possibly sequential) program to improve...
Scheduling transformations reorder a program’s operations to improve locality and/or parallelism. Th...
We prove theorems that show that if we can reorder a program's memory refer-ence stream such th...
Abstract. This paper presents a system, Loopy, for programming loop transformations. Manual loop tra...
Loop-nests in most scientific applications perform repetitive operations on array(s) and account for...
International Conference on Embedded and Ubiquitous Computing, EUC 2005, Nagasaki, 6-9 December 2005...
Nested loops are the most critical sections in many scientific and Digital Signal Processing (DSP)ap...
We present a framework for unifying iteration reordering transformations such as loop intercha...
There has been a great amount of recent work toward unifying iteration reordering transformations. ...
In previous work, we presented a framework for unifying iteration reordering transformations su...
In this paper we present a new theory of linear loop transformations called Computation Decompositio...
grantor: University of TorontoRestructuring compilers have been effective in tailoring nes...
We wish to extend the effectiveness of loop-restructuring compilers by improving the robustness of l...
In this paper we present a new loop transformation technique called Computation Decomposition and Al...
In this paper we generalize the framework of linear loop transformations: we consider loop alignment...
In this tutorial, we address the problem of restructuring a (possibly sequential) program to improve...
Scheduling transformations reorder a program’s operations to improve locality and/or parallelism. Th...
We prove theorems that show that if we can reorder a program's memory refer-ence stream such th...
Abstract. This paper presents a system, Loopy, for programming loop transformations. Manual loop tra...
Loop-nests in most scientific applications perform repetitive operations on array(s) and account for...
International Conference on Embedded and Ubiquitous Computing, EUC 2005, Nagasaki, 6-9 December 2005...
Nested loops are the most critical sections in many scientific and Digital Signal Processing (DSP)ap...