Options
Evaluating the performance of solvers for integer-linear programming
Citation Link: https://doi.org/10.15480/882.1839
Publikationstyp
Technical Report
Date Issued
2018
Sprache
English
Author(s)
Herausgeber*innen
Institut
TORE-DOI
Optimizing embedded systems often boils down to solving complex combinatorial optimization problems. Integer-Linear Programming (ILP) turned out to be a powerful tool to solve these problems, as beyond traditional constraints, Boolean variables may be used to model complex logical expressions and conditionals. One of the key technical aspects is to be able to efficiently express these relations within the ILP. This paper presents formalized solutions for these issues, as well as an assessment of common ILP solvers. Additionally, the performance impact is illustrated using a compiler based cache aging optimization.
Subjects
Integer-Linear Programming
ILP
Solvers
Evaluation
DDC Class
620: Ingenieurwissenschaften
More Funding Information
Deutsche Forschungsgemeinschaft
Loading...
Name
ilp.pdf
Size
405.63 KB
Format
Adobe PDF