The aim of this paper is to explain the importance of polytope and polyhedra in automatic
parallelization. We show that the semantics of parallel programs is best described …

Supercompilers must reschedule computations defined by nested DO-loops in order to
make an efficient use of supercomputer features (vector units, multiple elementary …

Supercompilers perform complex program transformations which often result in new loop
bounds. This paper shows that, under the usual assumptions in automatic parallelization …

Page 1 Alain Darte Yves Robert Frédéric Vivien Scheduling and Automatic Parallelization pringer
Science Business Media, LLC Page 2 Scheduling and Automatic Parallelization Page 3 Alain …

We present a plan to add loop nest optimizations in GCC based on polyhedral
representations of loop nests. We advocate a static analysis approach based on a hierarchy …

In this paper, we survey loop parallelization algorithms, analyzing the dependence
representations they use, the loop transformations they generate, the code generation …

Automatic parallel code generation from high-level abstractions such as those manipulated
by artificial intelligence and deep learning (AI/DL) frameworks heavily rely on compiler …

This paper presents an optimal algorithm for detecting line or medium grain parallelism in
nested loops whose dependences are described by an approximation of distance vectors by …

The polyhedral model is a powerful framework to reason about high level loop
transformations. Yet the lack of scalable algorithms and tools has deterred actors from both …

Analyzing time complexity of functional programs in a lazy language is problematic, because
the time required to evaluate a function depends on how much of the result is “needed” in …