Enabling compilers to automatically optimize code has been a longstanding goal for the
compiler community. Efficiently solving this problem requires using precise cost models …

Programming accelerators such as GPUs with low-level APIs and languages such as
OpenCL and CUDA is difficult, error-prone, and not performance-portable. Automatic …

Writing high-performance GPU implementations of graph algorithms can be challenging. In
this paper, we argue that three optimizations called throughput optimizations are key to high …

While polyhedral compilers have shown success in implementing advanced code
transformations, they still have challenges in selecting the most profitable transformations …

The polyhedral model is a powerful algebraic framework that has enabled significant
advances to analysis and transformation of sequential affine (sub) programs, relative to …

Writing correct parallel programs becomes more and more difficult as the complexity and
heterogeneity of processors increase. This issue is addressed by parallelising compilers …

We present VOBLA, a domain-specific language designed for programming linear algebra
libraries. VOBLA is compiled to PENCIL, a domain independent intermediate language …

The shift towards parallel processor architectures has made programming, performance
prediction and code generation increasingly challenging. Abstract representations of …

Deductive program verification can be used effectively to verify high-level programs, but can
be challenging for low-level, high-performance code. In this paper, we argue that …

Polyhedral Transformations of Explicitly Parallel Programs Page 1 1/42 Polyhedral
Transformations of Explicitly Parallel Programs Prasanth Chatarasi, Jun Shirako, Vivek Sarkar …