In this paper, we discuss a loop transformation framework that is based on integer non-singular matrices. The transformations included in this framework are called $\Lambda$-transformations and include permutation, skewing and reversal, as well as a transformation called loop scaling. This framework is more general than the existing ones; however, it is also more difficult to generate code in our framework. This paper shows how integer lattice theory can be used to generate efficient code. An added advantage of our framework over existing ones is that there is a simple completion algorithm which, given a partial transformation matrix, produces a full transformation matrix that satisfies all dependences. This completion procedure h...
In this paper, we survey loop parallelization algorithms, analyzing the dependence representations t...
Supercompilers perform complex program transformations which often result in new loop bounds. This p...
Tiling or supernode transformation has been widely used to improve locality in multi-level memory hi...
In this paper, we discuss a loop transformation framework that is based on integer non-singular ma...
this paper, we describe a framework for loop transformations and code generation for NUMA (non-unifo...
In this paper we generalize the framework of linear loop transformations: we consider loop alignment...
A common feature of many scalable parallel machines is non-uniform memory access - a processor can ...
In this paper we generalize the framework of linear loop transformations in the sense that loop alig...
The paper extends the framework of linear loop transformations adding a new nonlinear step at the tr...
Loop transformations are becoming critical to exploiting parallelism and data locality in paralleli...
Linear programming methods, optimizations on polytopes, manipulations of integral matrices, are now ...
In this paper we present a new theory of linear loop transformations called Computation Decompositio...
The automatic detection of parallel loops is a well-known problem. Sophisticated polynomial algorith...
This paper presents a technique for finding good distributions of arrays and suitable loop restructu...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/18...
In this paper, we survey loop parallelization algorithms, analyzing the dependence representations t...
Supercompilers perform complex program transformations which often result in new loop bounds. This p...
Tiling or supernode transformation has been widely used to improve locality in multi-level memory hi...
In this paper, we discuss a loop transformation framework that is based on integer non-singular ma...
this paper, we describe a framework for loop transformations and code generation for NUMA (non-unifo...
In this paper we generalize the framework of linear loop transformations: we consider loop alignment...
A common feature of many scalable parallel machines is non-uniform memory access - a processor can ...
In this paper we generalize the framework of linear loop transformations in the sense that loop alig...
The paper extends the framework of linear loop transformations adding a new nonlinear step at the tr...
Loop transformations are becoming critical to exploiting parallelism and data locality in paralleli...
Linear programming methods, optimizations on polytopes, manipulations of integral matrices, are now ...
In this paper we present a new theory of linear loop transformations called Computation Decompositio...
The automatic detection of parallel loops is a well-known problem. Sophisticated polynomial algorith...
This paper presents a technique for finding good distributions of arrays and suitable loop restructu...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/18...
In this paper, we survey loop parallelization algorithms, analyzing the dependence representations t...
Supercompilers perform complex program transformations which often result in new loop bounds. This p...
Tiling or supernode transformation has been widely used to improve locality in multi-level memory hi...