We present the design and implementation of an automatic polyhedral source-to-source
transformation framework that can optimize regular programs (sequences of possibly …

The polyhedral model provides powerful abstractions to optimize loop nests with regular
accesses. Affine transformations in this model capture a complex sequence of execution …

We present the design and implementation of a fully automatic polyhedral source-to-source
transformation framework that can optimize regular programs (sequences of possibly …

An affine partitioning Framework unifies many useful program transforms such as
unimodular transformations(interchange, reversal, skewing), loop fusion, fission, scaling …

High-level loop transformations are a key instrument in map** computational kernels to
effectively exploit the resources in modern processor architectures. Nevertheless, selecting …

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 …

This paper presents an algorithm to find the optimal affine partitions that maximize the
degree of parallelism and minimize the degree of synchronization in programs with arbitrary …

The freedom to reorder computations involving associative operators has been widely
recognized and exploited in designing parallel algorithms and to a more limited extent in …

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

Today's multi-core era places significant demands on an optimizing compiler, which must
parallelize programs, exploit memory hierarchy, and leverage the ever-increasing SIMD …