Optimal Code Generation for Explicitly Parallel Processors

The aim of this project is to develop new algorithms and mathematical formulations that maintain the advantages of integer linear programming based code generation techniques while remaining computational feasible for real-world programs. This includes the application of well-known techniques from the operations research domain to decrease the required solver time such as cutting plane algorithms, column generation techniques, or Lagrangian relaxation. As some of the subproblems are known to be computationally hard for real-world instances, we want to use the developed models also to learn when and why established heuristics fail, and to develop efficient approximation algorithms and near-optimal techniques that remain computationally feasible even for large problems.


If you are interested in VLIWs, compilers and would like to work with LLVM, please check our current list of available topics (in German).

Project Leader
Andreas Krall
Research Group
Gergö Barany
Alexander Jordan
Nikolai Kim
Viktor Pavlu
Institut für Computersprachen E185/1
Technische Universität Wien
Argentinierstraße 8/185,
A-1040 Wien, Austria
Tel.: +43 1 58801-18511
Fax: +43 1 58801-18598
E-Mail: andi@complang.tuwien.ac.at

The project is funded by the Austrian Science Fund.

Faculty of Informatics
Vienna University of Technology
top | HTML 4.01 | last update: 2013-11-19 (ajordan)