Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Data Propagation Delay Constraints in Multi-Rate Systems - Deadlines vs. Job-Level Dependencies
Friedrich Alexander Univ Erlangen Nurnberg FAU, Distributed Syst & Operating Syst, Erlangen, Germany..
Friedrich Alexander Univ Erlangen Nurnberg FAU, Distributed Syst & Operating Syst, Erlangen, Germany..
KTH, School of Electrical Engineering and Computer Science (EECS), Electronics, Electronic and embedded systems.ORCID iD: 0000-0002-1276-3609
Friedrich Alexander Univ Erlangen Nurnberg FAU, Distributed Syst & Operating Syst, Erlangen, Germany..
2018 (English)In: PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS (RTNS 2018), ASSOC COMPUTING MACHINERY , 2018Conference paper, Published paper (Refereed)
Abstract [en]

Many industrial areas are faced with a continuous increase in system complexity, while systems need to satisfy stringent timing requirements, which are traditionally based on the tasks' local deadlines. However, correct functionality is subject to high-level timing requirements on data propagation through a set of semantically related tasks. Since distributed concurrent engineering is often used to deal with the complexity of such systems, violations of data propagation delay constraints are only visible at late development stages, where changes in system design become increasingly expensive. In this paper, we leverage job-level dependencies (JLDs) that can be specified at early development stages to guarantee data propagation delay constraints. Therefore, we present an approach that extends the Real-Time Systems Compiler to enforce the JLDs in actual multicore schedules. This strategy enables us to perform extensive evaluations of the effectiveness of JLDs in combination with contemporary allocation and scheduling algorithms, where we observed schedulability improvements of up to 42%. Additionally, we identified the effect of the number of available cores on the data age.

Place, publisher, year, edition, pages
ASSOC COMPUTING MACHINERY , 2018.
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:kth:diva-242210DOI: 10.1145/3273905.3273923ISI: 000455090500009Scopus ID: 2-s2.0-85056697375OAI: oai:DiVA.org:kth-242210DiVA, id: diva2:1283188
Conference
26th International Conference on Real-Time Networks and Systems
Note

QC 20190128

Available from: 2019-01-28 Created: 2019-01-28 Last updated: 2019-01-28Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopushttps://rtns2018.ensma.fr/

Authority records BETA

Becker, Matthias

Search in DiVA

By author/editor
Becker, Matthias
By organisation
Electronic and embedded systems
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 107 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf