Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code
Authors:
Preprint
Abstract
This paper introduces Tiramisu, a polyhedral framework designed to generate high performance code for multiple platforms including multicores, GPUs, and distributed machines. Tiramisu introduces a scheduling language with novel extensions to explicitly manage the complexities that arise when targeting these systems. The framework is designed for the areas of image processing, stencils, linear algebra and deep learning. Tiramisu has two main features: it relies on a flexible representation based on the polyhedral model and it has a rich scheduling language allowing fine-grained control of optimizations. Tiramisu uses a four-level intermediate representation that allows full separation between the algorithms, loop transformations, data layouts, and communication. This separation simplifies targeting multiple hardware architectures with the same algorithm. We evaluate Tiramisu by writing a set of image processing, deep learning, and linear algebra benchmarks and compare them with state-of-the-art compilers and hand-tuned libraries. We show that Tiramisu matches or outperforms existing compilers and libraries on different hardware architectures, including multicore CPUs, GPUs, and distributed machines.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- PENCIL: A Platform-Neutral Compute Intermediate Language for Accelerator Programming2015
- Nuclear correlation functions in lattice QCDPhysical Review D, 2013
- POLLY — PERFORMING POLYHEDRAL OPTIMIZATIONS ON A LOW-LEVEL INTERMEDIATE REPRESENTATIONParallel Processing Letters, 2012
- Loop Transformation Recipes for Code Generation and Auto-Tuning2010
- isl: An Integer Set Library for the Polyhedral Model2010
- Effective automatic parallelization of stencil computationsACM SIGPLAN Notices, 2007
- Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory HierarchiesInternational Journal of Parallel Programming, 2006
- New Complexity Results on Array Contraction and Related ProblemsJournal of Signal Processing Systems, 2005
- Automatic storage management for parallel programsParallel Computing, 1998
- Dataflow analysis of array and scalar referencesInternational Journal of Parallel Programming, 1991