In order to produce efficient parallel programs, optimizing compilers need to include an analysis of the initial sequential code. When analyzing loops with affine loop bounds, many computations are relevant to the same general problem: counting the number of integer solutions of selected free variables in a set of linear and/or nonlinear parameterized constraints. For example, computing the number of flops executed by a loop, of memory locations touched by a loop, of cache lines touched by a loop, or of array elements that need to be transmitted from a processor to another during the execution of a loop, is useful to determine if a loop is load balanced, evaluate message traffic and allocate message buffers. The objective of the presented m...
The polytope model is widely used in compiler analysis for representing a certain class of programs....
An important problem in automatic parallelization of scientific programs is to generate loops from a...
A fundamental problem that arises frequently in quantita-tive program analysis (e.g., resource usage...
Optimizing parallel compilers need to be able to analyze nested loop programs with parametric affine...
Many optimization techniques, including several targeted specifically at embedded systems, depend on...
We present ABC, a software tool for automatically computing symbolic upper bounds on the number of i...
Many compiler optimization techniques depend on the ability to calculate the number of elements that...
ABSTRACT V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes ofthe...
International audienceEhrhart polynomials are amazing mathematical objects that I discovered in the ...
We describe methods that are able to count the number of integer solutions to selected free varia...
Le modèle polyédrique est un formalisme utilisé en optimisation automatique de programmes. Il permet...
This paper describes an inter-procedural technique for computing symbolic bounds on the number of st...
Several scientific problems are represented as sets of linear (or affine) con-straints over a set of...
Supercompilers perform complex program transformations which often result in new loop bounds. This p...
We present a fast an extensible algorithm for computing upper and lower bounds on the number of solu...
The polytope model is widely used in compiler analysis for representing a certain class of programs....
An important problem in automatic parallelization of scientific programs is to generate loops from a...
A fundamental problem that arises frequently in quantita-tive program analysis (e.g., resource usage...
Optimizing parallel compilers need to be able to analyze nested loop programs with parametric affine...
Many optimization techniques, including several targeted specifically at embedded systems, depend on...
We present ABC, a software tool for automatically computing symbolic upper bounds on the number of i...
Many compiler optimization techniques depend on the ability to calculate the number of elements that...
ABSTRACT V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes ofthe...
International audienceEhrhart polynomials are amazing mathematical objects that I discovered in the ...
We describe methods that are able to count the number of integer solutions to selected free varia...
Le modèle polyédrique est un formalisme utilisé en optimisation automatique de programmes. Il permet...
This paper describes an inter-procedural technique for computing symbolic bounds on the number of st...
Several scientific problems are represented as sets of linear (or affine) con-straints over a set of...
Supercompilers perform complex program transformations which often result in new loop bounds. This p...
We present a fast an extensible algorithm for computing upper and lower bounds on the number of solu...
The polytope model is widely used in compiler analysis for representing a certain class of programs....
An important problem in automatic parallelization of scientific programs is to generate loops from a...
A fundamental problem that arises frequently in quantita-tive program analysis (e.g., resource usage...