Skip to Main content Skip to Navigation
Conference papers

Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra

Ramakrishna Upadrasta 1, 2 Albert Cohen 1
1 Parkas - Parallélisme de Kahn Synchrone
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : Polyhedral compilation has been successful in the design and implementation of complex loop nest optimizers and parallelizing compilers. The algorithmic complexity and scalability limitations remain one important weakness. We address it using sub-polyhedral under-aproximations of the systems of constraints resulting from affine scheduling problems. We propose a sub-polyhedral scheduling technique using (Unit-)Two-Variable-Per-Inequality or (U)TVPI Polyhedra. This technique relies on simple polynomial time algorithms to under-approximate a general polyhedron into (U)TVPI polyhedra. We modify the state-of-the-art PLuTo compiler using our scheduling technique, and show that for a majority of the Polybench (2.0) kernels, the above under-approximations yield polyhedra that are non-empty. Solving the under-approximated system leads to asymptotic gains in complexity, and shows practically significant improvements when compared to a traditional LP solver. We also verify that code generated by our sub-polyhedral parallelization prototype matches the performance of PLuTo-optimized code when the under-approximation preserves feasibility.
Document type :
Conference papers
Complete list of metadata

Cited literature [60 references]  Display  Hide  Download

https://hal.inria.fr/hal-00911888
Contributor : Albert Cohen <>
Submitted on : Sunday, December 1, 2013 - 1:15:46 AM
Last modification on : Thursday, July 8, 2021 - 3:47:24 AM
Long-term archiving on: : Monday, March 3, 2014 - 8:45:54 PM

File

popl070-upadrasta.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Ramakrishna Upadrasta, Albert Cohen. Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra. POPL'13 - 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Jan 2013, Rome, Italy. pp.483-496, ⟨10.1145/2429069.2429127⟩. ⟨hal-00911888⟩

Share

Metrics

Record views

859

Files downloads

1168