Program equivalence is a well-known problem with a wide range of applications, such as algorithm recognition, program verification and program optimization. This problem is also known to be undecidable if the class of programs is rich enough, in which case semi-algorithms are commonly used. We focus on programs represented as Systems of Affine Recurrence… (More)
We present a formulation, solution method, and program acceleration techniques for two dynamic control scenarios, both with the common goal of optimizing resource allocations. These approaches allocate resources in a non-myopic way, accounting for long-term impacts of current control decisions via nominal belief-state optimization (NBO). In both scenarios,… (More)
Tiling is a crucial program transformation with many benefits: it improves locality, exposes parallelism, allows for adjusting the ops-to-bytes balance of codes, and can be applied at multiple levels. Allowing tile sizes to be symbolic parameters at compile time has many benefits, including efficient auto-tuning, and run-time adaptability to system… (More)
The polyhedral model is a powerful mathematical framework used for program analysis (such as program transformation , automatic parallelization of nested loops, etc). It is well known that this model becomes somewhat cumbersome when we encounter modulos, " holes " in the computation domain, or non-unit-stride loops. An extension, called the Z-polyhedral… (More)
Polyhedral compilers perform optimizations such as tiling and parallelization; when doing both, they usually generate code that executes " barrier-synchronized wavefronts " of tiles. We present a system to express and generate code for hybrid schedules, where some constraints are automatically satisfied through the structure of the code, and the remainder… (More)
Purpose: People present work in progress to get feedback from other members.
This is the tentative schedule of Mélange group for the Fall 2015 semester.
As computing moves to exascale, it will be dominated by energy-efficiency. We propose a new GPU-like accelerator called the Stencil Processing Unit (SPU), for implementing dense stencil computations in an energy-efficient manner. We address all the levels of the programming stack, from architecture, programming API, runtime system and compilation. First, a… (More)
Parametric tiling is a well-known transformation which is widely used to improve locality, parallelism and granularity. However, parametric tiling is also a non-linear transformation and this prevents polyhedral analysis or further poly-hedral transformation after parametric tiling. It is therefore generally applied during the code generation phase. In this… (More)