We present a new algorithm to automatically schedule Halide programs for high-
performance image processing and deep learning. We significantly improve upon the …

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

In this paper we introduce a multi-objective autotuning framework comprising compiler and
runtime components. Focusing on individual code regions, our compiler uses a novel search …

Static analysis is a tremendous help when trying to find faults in complex software. Writing
multi-threaded programs is difficult, because the thread scheduling increases the program …

Expensive data movement makes the optimal target-specific selection of data-locality
transformations essential. Loop fusion and tiling are the most important data-locality …

Scratchpad Memory (SPM) is widely used in emerging domain-specific architectures and
accelerators for improving energy efficiency and time predictability. Typically, SPM-based …

Loop tiling or blocking improves temporal locality by dividing the problem domain into tiles
and then repeatedly accessing the data within a tile. While this reduces reuse, it also leads …

Programmers spend a lot of time and effort optimizing their code to make it run faster, this
has led compiler researchers to focus on developing automatic optimization techniques that …

Automatic tuning (auto-tuning) of software has emerged in recent years as a promising
method that tries to automatically adapt the behaviour of a program to attain different …

A mixed method combining formal and auto-tuning approaches and aimed at maximizing
efficiency of parallel programs (in terms of execution time) is proposed. The formal approach …