Vincent Loechner

Learn More
In the area of automatic parallelization of programs , analyzing and transforming loop nests with parametric aane loop bounds requires fundamental mathematical results. The most common geometrical model of iteration spaces, called the polytope model, is based on mathematics dealing with convex and discrete geometry, linear programming, combinatorics and(More)
Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by linear constraints, then such problems are equivalent to counting the number of integer points in (possibly) parametric polytopes. It is well known that the enumerator of such a set can be(More)
Algorithms specified for parametrically sized problems are more general purpose and more reusable than algorithms for fixed sized problems. For this reason, there is a need for representing and symbolically analyzing linearly parameterized algorithms. An important class of parallel algorithms can be described as systems of parameterized affine recurrence(More)
A significant source for enhancing application performance and for reducing power consumption in embedded processor applications is to improve the usage of the memory hierarchy. In this paper, a temporal and spatial locality optimization framework of nested loops is proposed, driven by parameterized cost functions. The considered loops can be imperfectly(More)
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by linear constraints, then such problems are equivalent to counting the number of integer points in (possibly) parametric polytopes. It(More)
2 3 Pierrot (P. Dewaere):-" C'est pas mauvais cette petite potée. " Jean-Claude (G. Depardieu):-" Oh... pas de quoí ecrire une thèse! " Bertrand Blier, Les Valseuses (Going Places/Die Ausgebufften). " La compilation, c'est bon. " Philippe Clauss. Ce manuscrit présente une grande partie des travaux de recherche que j'ai effectués pendant mes trois ans de(More)
The polyhedral model is a well-known compiler optimization framework for the analysis and transformation of affine loop nests. We present a new method to solve a difficult geometric operation that is raised by this model: the integer affine transformation of parametric ℤ-polytopes. The result of such a transformation is given by a worst-case(More)
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of points in a parametrized polytope. It is well known that this parametrized count can be represented by an Ehrhart polynomial, which is usually computed through interpolation. In some cases, however, this interpolation(More)