Repository logo
 
Publication

From Code to Weakly Hard Constraints: A Pragmatic End-to-End Toolchain for Timed C

2020Conference object Restricted access
Simple item page
dc.contributor.authorNatarajan, Saranya
dc.contributor.authorNasri, Mitra
dc.contributor.authorBroman, David
dc.contributor.authorBrandenbur, Björn B.
dc.contributor.authorNelissen, Geoffrey
dc.date.accessioned2020-10-30T11:34:28Z
dc.date.embargo2120
dc.date.issued2020
dc.descriptionRTSS 2019 originally postponed from December 2019 (Hong-Kong) to February 2020 (York, UK) was cancelled.pt_PT
dc.description.abstractComplex real-time systems are traditionally developed in several disjoint steps: (i) decomposition of applications into sets of recurrent tasks, (ii) worst-case execution time estimation, and (iii) schedulability analysis. Each step is already in itself complex and error-prone, and the composition of all three poses a nontrivial integration problem. In particular, it is challenging to obtain an end-to-end analysis of timing properties of the whole system due to practical differences between the interfaces of tools for extracting task models, execution time analysis, and schedulability tests. To address this problem, we propose a seamless and pragmatic end-to-end compilation and timing analysis toolchain, where source programs are written in a real-time extension of C, called Timed C. The toolchain automatically translates timing primitives into executable code, measures execution times, and verifies temporal correctness using an extended schedulability test for non-preemptive generalized multiframe task sets. Novel aspects of our approach are: (i) both soft and firm tasks can be expressed at the programming language level and stated timing requirements are automatically verified by the schedulability test, and (ii) the schedulability test outputs per-job response-time information that enables a new approach to sensitivity analysis. Specifically, we perform a weakly hard sensitivity analysis that determines the worst-case execution time margins for the strongest still-satisfied (M;K) constraint, where M = m_1 + … + m_N denotes the number of deadline misses across the entire task set, and K = {k_1; … ; k_N} is the set of windows of interest of the different tasks. The toolchain is implemented as a source-to-source compiler, freely available as open source, and conveniently distributed as a Docker container.pt_PT
dc.description.versioninfo:eu-repo/semantics/publishedVersionpt_PT
dc.identifier.doi10.1109/RTSS46320.2019.00025pt_PT
dc.identifier.issn2576-3172
dc.identifier.urihttp://hdl.handle.net/10400.22/16387
dc.language.isoengpt_PT
dc.peerreviewedyespt_PT
dc.publisherIEEEpt_PT
dc.relationPReFECT, ref. POCI-01-0145-FEDER-029119pt_PT
dc.relation.publisherversionhttps://ieeexplore.ieee.org/document/9052188pt_PT
dc.subjectProgram compilerspt_PT
dc.subjectReal-time systemspt_PT
dc.subjectSchedulingpt_PT
dc.subjectTask analysispt_PT
dc.titleFrom Code to Weakly Hard Constraints: A Pragmatic End-to-End Toolchain for Timed Cpt_PT
dc.typeconference object
dspace.entity.typePublication
oaire.citation.conferencePlaceNon-Applicablept_PT
oaire.citation.endPage180pt_PT
oaire.citation.startPage167pt_PT
oaire.citation.titleProceedings of the 40th IEEE Real-Time Systems Symposium (RTSS 2019)pt_PT
person.familyNameNelissen
person.givenNameGeoffrey
person.identifier.ciencia-idE51E-C723-0D77
person.identifier.orcid0000-0003-4141-6718
person.identifier.scopus-author-id41561808600
rcaap.rightsclosedAccesspt_PT
rcaap.typeconferenceObjectpt_PT
relation.isAuthorOfPublicatione23673cc-6b82-4d9c-94fb-4b4fca051b0d
relation.isAuthorOfPublication.latestForDiscoverye23673cc-6b82-4d9c-94fb-4b4fca051b0d

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
COM_CISTER_Nelissen_2020.pdf
Size:
1.17 MB
Format:
Adobe Portable Document Format
Download

Collections

ISEP – CISTER – Comunicações em eventos científicos