Change search
ReferencesLink to record
Permanent link

Direct link
Relaxing the Synchronous Approach for Mixed-Criticality Systems
University of Auckland.
University of Auckland.
University of Auckland.
University of California, Berkeley and Linköping University.ORCID iD: 0000-0001-8457-4105
2014 (English)In: Proceedings of the 20th IEEE Real-Time and Embedded Technology and Application Symposium (RTAS), IEEE conference proceedings, 2014, 89-100 p.Conference paper (Refereed)
Abstract [en]

Synchronous languages are widely used to design safety-critical embedded systems. These languages are based on the synchrony hypothesis, asserting that all tasks must complete instantaneously at each logical time step. This assertion is, however, unsuitable for the design of mixed-criticality systems, where some tasks can tolerate missed deadlines. This paper proposes a novel extension to the synchronous approach for supporting three levels of task criticality: life, mission, and non-critical. We achieve this by relaxing the synchrony hypothesis to allow tasks that can tolerate bounded or unbounded deadline misses. We address the issue of task communication between multi-rate, mixed-criticality tasks, and propose a deterministic lossless communication model. To maximize system utilization, we present a hybrid static and dynamic scheduling approach that executes schedulable tasks during slack time. Extensive benchmarking shows that our approach can schedule up to 15% more task sets and achieve an average of 5.38% better system utilization than the Early-Release EDF (ER-EDF) approach. Tasks are scheduled fairer under our approach and achieve consistently higher execution frequencies, but require more preemptions.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2014. 89-100 p.
National Category
Computer Science
URN: urn:nbn:se:kth:diva-164164DOI: 10.1109/RTAS.2014.6925993ISBN: 978-1-4799-4691-4OAI: diva2:803901
The 20th IEEE Real-Time and Embedded Technology and Application Symposium (RTAS), Berlin, Germany, April 15-17, 2014

QC 20150521

Available from: 2015-04-14 Created: 2015-04-14 Last updated: 2015-05-21Bibliographically approved

Open Access in DiVA

fulltext(1278 kB)26 downloads
File information
File name FULLTEXT01.pdfFile size 1278 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textIEEEXplore

Search in DiVA

By author/editor
Broman, David
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 26 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 21 hits
ReferencesLink to record
Permanent link

Direct link