Show simple item record

dc.contributor.authorZolda, Michael
dc.contributor.authorKirner, Raimund
dc.date.accessioned2017-07-18T15:30:49Z
dc.date.available2017-07-18T15:30:49Z
dc.date.issued2015-09-01
dc.identifier.citationZolda , M & Kirner , R 2015 , ' Calculating WCET Estimates from Timed Traces ' , Real-Time systems , vol. 52 , no. 1 , pp. 38-87 . https://doi.org/10.1007/s11241-015-9240-1
dc.identifier.issn0922-6443
dc.identifier.otherPURE: 9226577
dc.identifier.otherPURE UUID: 400c8471-4c50-44a0-82fd-bdcb62f9954c
dc.identifier.otherScopus: 84953365229
dc.identifier.urihttp://hdl.handle.net/2299/18972
dc.description© The Author(s) 2015. This article is published with open access at Springerlink.com
dc.description.abstractReal-time systems engineers face a daunting duty: They must ensure that each task in their system can always meet its deadline. To analyse schedulability they must know the worst-case execution time (WCET) of each task. However, determining exact WCETs is practically infeasible in cost-constrained industrial settings involving real-life code and COTS hardware. Static analysis tools that could yield sufficiently tight WCET bounds are often unavailable. As a result, interest in portable analysis approaches like measurement-based timing analysis (MBTA) is growing. We present an approach based on integer linear programming (ILP) for calculating a WCET estimate from a given database of timed execution traces. Unlike previous work, our method specifically aims at reducing overestimation, by means of an automatic classification of code executions into scenarios with differing worst-case behaviour. To ease the integration into existing analysis tool chains, our method is based on the implicit path enumeration technique (IPET). It can thus reuse flow facts from other analysis tools and produces ILP problems that can be solved by off-the-shelf solvers.en
dc.format.extent50
dc.language.isoeng
dc.relation.ispartofReal-Time systems
dc.rights/dk/atira/pure/core/openaccesspermission/open
dc.subjectWorst-case execution time (WCET) analysis
dc.subjectInteger linear programming
dc.subjectmeasurement-based timing analysis
dc.titleCalculating WCET Estimates from Timed Tracesen
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionScience & Technology Research Institute
dc.contributor.institutionCentre for Computer Science and Informatics Research
dc.description.statusPeer reviewed
dc.relation.schoolSchool of Computer Science
dc.description.versiontypeFinal Published version
rioxxterms.versionSMUR
rioxxterms.versionVoR
rioxxterms.versionofrecordhttps://doi.org/10.1007/s11241-015-9240-1
rioxxterms.licenseref.urihttp://creativecommons.org/licenses/by/4.0/
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue
herts.rights.accesstypeopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record