Results 1  10
of
648
The program dependence graph and its use in optimization
 ACM Transactions on Programming Languages and Systems
, 1987
"... In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program. ..."
Abstract

Cited by 996 (3 self)
 Add to MetaCart
. Control dependence5 are introduced to analogously represent only the essential control flow relationships of a program. Control dependences are derived from the usual control flow graph. Many traditional optimizations operate more efficiently on the PDG. Since dependences in the PDG connect
Generation of Efficient Nested Loops from Polyhedra
 International Journal of Parallel Programming
, 2000
"... Automatic parallelization in the polyhedral model is based on affine transformations from an original computation domain (iteration space) to a target spacetime domain, often with a different transformation for each variable. Code generation is an often ignored step in this process that has a signi ..."
Abstract

Cited by 89 (5 self)
 Add to MetaCart
Automatic parallelization in the polyhedral model is based on affine transformations from an original computation domain (iteration space) to a target spacetime domain, often with a different transformation for each variable. Code generation is an often ignored step in this process that has a
Software Pipelining of Nested Loops
 PROCEEDINGS OF THE INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM
, 1994
"... This paper presents an approach to software pipelining of nested loops. While several papers have addressed software pipelining of inner loops, little work has been done in the area of extending it to nested loops. This paper solves the problem of finding the minimum iteration initiation interval (i ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
dependent statement reordering and multidimensional loop unrolling in the same framework. Unlike most work in scheduling nested loops, we treat each statement in the body as a unit of scheduling. Thus, the schedules derived allow for instances of statements from different iterations to be scheduled at the same time
Nonunimodular Transformations of Nested Loops
 IN PROC. SUPERCOMPUTING 92
, 1992
"... This paper presents a linear algebraic approach to modeling loop transformations. The approach unifies apparently unrelated recent developments in supercompiler technology. Specifically we show the relationship between the dependence abstraction called dependence cones, and fully permutable loop nes ..."
Abstract

Cited by 46 (12 self)
 Add to MetaCart
in order to "step aside from these holes" when traversing the transformed iteration space. For the class of nonunimodular loop transformations, we present algorithms for deriving the loop bounds, the array access expressions and step sizes of loops in the nest. The algorithms are based
Efficient Discovery of Loop Nests in Execution Traces
"... Abstract—Execution and communication traces are central to performance modeling and analysis. Since the traces can be very long, meaningful compression and extraction of representative behavior is important. Commonly used compression procedures identify repeating patterns in sections of the input st ..."
Abstract
 Add to MetaCart
string and replace each instance with a representative symbol. This can prevent the identification of long repeating sequences corresponding to outer loops in a trace. This paper introduces and analyzes a framework for identifying the maximal loop nest from a trace. The discovery of loop nests makes
Polyhedralmodel guided loopnest autovectorization
 in PACT ’09: Proceedings of the 2009 18th International Conference on Parallel Architectures and Compilation Techniques
"... Abstract—Optimizing compilers apply numerous interdependent optimizations, leading to the notoriously difficult phaseordering problem — that of deciding which transformations to apply and in which order. Fortunately, new infrastructures such as the polyhedral compilation framework host a variety of ..."
Abstract

Cited by 22 (10 self)
 Add to MetaCart
excluded it from being part of the polyhedral framework. In this paper we examine the interactions between loop transformations of the polyhedral framework and subsequent vectorization. We model the performance impact of the different loop transformations and vectorization strategies, and then show how
Nesting and dressing
"... We compute the anomalous dimensions of field strength operators Tr F L in N = 4 SYM from an asymptotic nested Bethe ansatz to allloop order. Starting from the exact solution of the oneloop problem at arbitrary L, we derive a single effective integral equation for the thermodynamic L → ∞ limit of ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
We compute the anomalous dimensions of field strength operators Tr F L in N = 4 SYM from an asymptotic nested Bethe ansatz to allloop order. Starting from the exact solution of the oneloop problem at arbitrary L, we derive a single effective integral equation for the thermodynamic L → ∞ limit
Compaan: Deriving Process Networks from Matlab for Embedded Signal Processing Architectures
 IN PROCEEDINGS OF THE 8TH INTERNATIONAL WORKSHOP ON HARDWARE/SOFTWARE CODESIGN (CODES
, 2000
"... This paper presents the Compaan tool that automatically transforms a nested loop program written in Matlab into a processnetwork specification. The process ..."
Abstract

Cited by 67 (13 self)
 Add to MetaCart
This paper presents the Compaan tool that automatically transforms a nested loop program written in Matlab into a processnetwork specification. The process
A new approach to Parallelizing nested Loops using the wavefront method
, 1992
"... This paper presents a novel approach to the problem of parallelizing nested loops using the wavefront method. Though not as powerful as some existing loop transformation theories, the approach has the advantage of not requiring knowledge of either the loop bounds or the direct dependences (distance ..."
Abstract
 Add to MetaCart
This paper presents a novel approach to the problem of parallelizing nested loops using the wavefront method. Though not as powerful as some existing loop transformation theories, the approach has the advantage of not requiring knowledge of either the loop bounds or the direct dependences (distance
Transformations of Nested Loops with NonConvex Iteration Spaces
, 1996
"... When compiling for parallel machines, it is often necessary to generate a loop nest to scan a region of index points in lexicographic order. One wellknown application example is the use of loop transformations to restructure loop nests. Previous work shows how to generate code to scan a convex poly ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
polyhedron (possibly intersected with a lattice), a region derived from an application of a nonsingular transformation to a convex iteration space. The driving force behind this work is to investigate how to generate code for nonsingular transformations of nested loops with nonconvex iteration spaces
Results 1  10
of
648