Sub-Polyhedral Compilation using (Unit-)Two-Variables-Per-Inequality Polyhedra

Sub-Polyhedral Compilation using (Unit-)Two-Variables-Per-Inequality Polyhedra

Show other versions (1)

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...

Full description

Bibliographic Details
Main Author: Upadrasta, Ramakrishna
Language:English
Published: Université Paris Sud - Paris XI 2013
Subjects:
[INFO:INFO_OH] Computer Science/Other
[INFO:INFO_OH] Informatique/Autre
Affine scheduling
Approximation algorithms
Compiler optimizations
Compilers
Loop transformations
Optimization
Parallelism
Asymptotic complexity
Code generation
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

Internet

http://tel.archives-ouvertes.fr/tel-00818764
http://tel.archives-ouvertes.fr/docs/00/81/87/64/PDF/VD2_UPADRASTA_RAMAKRISHNA_13032013.pdf

Similar Items