The polyhedral model has been successfully used in production compilers. Nevertheless, only a very restricted class of applications can benefit from it. Recent proposals investigated how runtime information could be used to apply polyhedral optimization on applications that do not statically fit the model. In this work, we go one step further in that direction. We propose a dynamic analysis that builds a compact polyhedral representation from a program execution. It is able to accurately detect affine dependencies and fixed-stride memory accesses in programs. The analysis scales to real-life applications, which often include some non-affine dependencies and accesses in otherwise affine code. This is enabled by a safe fine-grain polyhedral o...
The Polyhedral Model is one of the most powerful framework for automatic optimization and paralleliz...
Loop tiling is a loop transformation widely used to improve spatial and temporal data locality, to i...
This Thesis focuses on the study of inertial methods for solving composite convex minimization probl...
The polyhedral model has been successfully used in production compilers. Nevertheless, only a very r...
Writing a code which uses an architecture at its full capability has become an increasingly difficul...
We present a paradigm and implementation of a parallel control flow model for algorithmic patterns o...
Despite decades of research on high-level loop optimizations and theirsuccessful integration in prod...
International audienceThe polyhedral model is a powerful framework for automatic optimization and pa...
Tiling is a crucial program transformation, adjusting the ops-to-bytes balance of codes to improvelo...
While studied over several decades, the computation of boolean operations on polyhedra is almost alw...
Moving away from constrained parametric to unconstrained flexible non parametric models is a deep tr...
Corresponding publication at IMPACT'16 (http://impact.gforge.inria.fr/impact2016)This paper studies ...
In this thesis, we present our contributions to APOLLO: an automatic parallelization compiler that c...
The complexity of CPUs has increased considerably since their beginnings, introducing mechanisms suc...
Despite decades of work in this area, the construction of effective loop nest optimizers and paralle...
The Polyhedral Model is one of the most powerful framework for automatic optimization and paralleliz...
Loop tiling is a loop transformation widely used to improve spatial and temporal data locality, to i...
This Thesis focuses on the study of inertial methods for solving composite convex minimization probl...
The polyhedral model has been successfully used in production compilers. Nevertheless, only a very r...
Writing a code which uses an architecture at its full capability has become an increasingly difficul...
We present a paradigm and implementation of a parallel control flow model for algorithmic patterns o...
Despite decades of research on high-level loop optimizations and theirsuccessful integration in prod...
International audienceThe polyhedral model is a powerful framework for automatic optimization and pa...
Tiling is a crucial program transformation, adjusting the ops-to-bytes balance of codes to improvelo...
While studied over several decades, the computation of boolean operations on polyhedra is almost alw...
Moving away from constrained parametric to unconstrained flexible non parametric models is a deep tr...
Corresponding publication at IMPACT'16 (http://impact.gforge.inria.fr/impact2016)This paper studies ...
In this thesis, we present our contributions to APOLLO: an automatic parallelization compiler that c...
The complexity of CPUs has increased considerably since their beginnings, introducing mechanisms suc...
Despite decades of work in this area, the construction of effective loop nest optimizers and paralle...
The Polyhedral Model is one of the most powerful framework for automatic optimization and paralleliz...
Loop tiling is a loop transformation widely used to improve spatial and temporal data locality, to i...
This Thesis focuses on the study of inertial methods for solving composite convex minimization probl...