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 …

We are building a compiler that automatically translates sequential scienti c programs into
parallel code for scalable parallel machines. Many of the compiler techniques needed to …

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

This paper presents the design and implementation of PolyMage, a domain-specific
language and compiler for image processing pipelines. An image processing pipeline can …

This book is devoted to the computation of the elementary functions. Here, we call
elementary functions the most commonly used mathematical functions: sin, cos, tan, sin− 1 …

The Omega test is an integer programming algorithm that can determine whether a
dependence exists between two array references, and if so, under what conditions …

This paper extends the algorithms which were developed in Part I to cases in which there is
no affine schedule, ie to problems whose parallel complexity is polynomial but not linear …

Many advances in automatic parallelization and optimization have been achieved through
the polyhedral model. It has been extensively shown that this computational model provides …

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 …