Data-parallel computations, such as linear algebra routines and stencil computations,
constitute one of the most relevant classes in parallel computing, eg, due to their importance …

We formally introduce a systematic (de/re)-composition approach, based on the algebraic
formalism of" Multi-Dimensional Homomorphisms (MDHs)". Our approach is designed as …

MLIR is an emerging compiler infrastructure for modern hardware, but existing programs
cannot take advantage of MLIR's high-performance compilation if they are described in …

We present a framework for compiling recurrence equations into native code. In our
framework, users specify a system of recurrences, the types of data structures that store …

We introduce a new scheduling language, based on the formalism of Multi-Dimensional
Homomorphisms (MDH). In contrast to existing scheduling languages, our MDH-based …

Incremental computation aims to compute more efficiently on changed input by reusing
previously computed results. We give a high-level overview of works on incremental …

Due to the missing of a good orchestration of loop transformations, existing optimizing
compilers for deploying neural networks on GPU either parallelize reductions ineffectively or …

Reductions combine collections of inputs with an associative (and here, also commutative)
operator to produce collections of outputs. When the same value contributes to multiple …

Reductions combine collections of input values with an associative and often commutative
operator to produce collections of results. When the same input value contributes to multiple …

Incremental computation aims to compute more efficiently on changed input by reusing
previously computed results. We give a high-level overview of works on incremental …