Sub-Polyhedral Compilation using (Unit-)Two-Variables-Per-Inequality Polyhedra
The goal of this thesis is to design algorithms that run with better complexity when compiling or parallelizing loop programs. The framework within which our algorithms operate is the polyhedral model of compilation which has been successful in the design and implementation of complex loop nest opti...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
Université Paris Sud - Paris XI
2013
|
| Subjects: | |
| Online Access: | http://tel.archives-ouvertes.fr/tel-00818764 http://tel.archives-ouvertes.fr/docs/00/81/87/64/PDF/VD2_UPADRASTA_RAMAKRISHNA_13032013.pdf |
Search Result 1