Please use this identifier to cite or link to this item: https://doi.org/10.15480/882.1839
Fulltext available Open Access
DC FieldValueLanguage
dc.contributor.authorLuppold, Arno-
dc.contributor.authorOehlert, Dominic-
dc.contributor.authorFalk, Heiko-
dc.date.accessioned2018-11-09T11:27:17Z-
dc.date.available2018-11-09T11:27:17Z-
dc.date.issued2018-
dc.identifier.urihttp://tubdok.tub.tuhh.de/handle/11420/1842-
dc.description.abstractOptimizing 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.en
dc.description.sponsorshipDeutsche Forschungsgemeinschaftde_DE
dc.language.isoende_DE
dc.relationinfo:eu-repo/grantAgreement/EC/H2020/779882-
dc.rightsCC BY 3.0de_DE
dc.rightsinfo:eu-repo/semantics/openAccess-
dc.subjectInteger-Linear Programmingde_DE
dc.subjectILPde_DE
dc.subjectSolversde_DE
dc.subjectEvaluationde_DE
dc.subject.ddc620: Ingenieurwissenschaftende_DE
dc.titleEvaluating the performance of solvers for integer-linear programmingde_DE
dc.typeTechnical Reportde_DE
dc.identifier.urnurn:nbn:de:gbv:830-882.023210-
dc.identifier.doi10.15480/882.1839-
dc.type.dinireport-
dc.subject.ddccode620-
dcterms.DCMITypeText-
tuhh.identifier.urnurn:nbn:de:gbv:830-882.023210de_DE
tuhh.oai.showtruede_DE
dc.identifier.hdl11420/1842-
tuhh.abstract.englishOptimizing 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.de_DE
tuhh.publication.instituteEingebettete Systeme E-13de_DE
tuhh.identifier.doi10.15480/882.1839-
tuhh.type.opusReport (Bericht)de
tuhh.institute.germanEingebettete Systeme E-13de
tuhh.institute.englishEingebettete Systeme E-13de_DE
tuhh.gvk.hasppnfalse-
tuhh.hasurnfalse-
openaire.rightsinfo:eu-repo/semantics/openAccessde_DE
openaire.funder.nameECde_DE
openaire.funder.programmeH2020de_DE
openaire.funder.projectid779882de_DE
dc.type.driverreport-
dc.rights.ccversion3.0de_DE
dc.type.casraiReporten
dc.relation.projectMulti-Opt - Multikriterielle Code-Optimierung für Eingebettete Harte Echtzeitsysteme (Grant FA 1017/3-1)de_DE
dc.rights.nationallicensefalsede_DE
local.contributorCorporate.editorEingebettete Systeme E-13-
item.fulltextWith Fulltext-
item.creatorOrcidLuppold, Arno-
item.creatorOrcidOehlert, Dominic-
item.creatorOrcidFalk, Heiko-
item.languageiso639-1other-
item.creatorGNDLuppold, Arno-
item.creatorGNDOehlert, Dominic-
item.creatorGNDFalk, Heiko-
item.grantfulltextopen-
crisitem.author.deptEingebettete Systeme E-13-
crisitem.author.deptEingebettete Systeme E-13-
crisitem.author.deptEingebettete Systeme E-13-
crisitem.author.orcid0000-0001-8714-0273-
crisitem.author.orcid0000-0003-1196-0122-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
Appears in Collections:Publications (tub.dok)
Files in This Item:
File Description SizeFormat
ilp.pdfEvaluating the Performance of Solvers for Integer-Linear Programming405,63 kBAdobe PDFView/Open
Show simple item record

Page view(s)

79
Last Week
1
Last month
27
checked on Jun 17, 2019

Download(s)

35
checked on Jun 17, 2019

Google ScholarTM

Check

Export

This item is licensed under a Creative Commons License Creative Commons