mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Task-Level Probabilistic Scheduling Guarantees for Dependable Real-Time Systems: A designer centric approach  
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0001-5053-6725
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0003-4157-3537
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0001-5269-3900
2011 (English)In: Proceedings - 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops, ISORCW 2011, 2011, p. 281-287Conference paper, Published paper (Refereed)
Abstract [en]

Dependable real-time systems typically consist of tasks of mixed-criticality levels with associated fault tolerance (FT) requirements and scheduling them in a fault-tolerant manner to efficiently satisfy these requirements is a challenging problem. From the designers' perspective, the most natural way to specify the task criticalities is by expressing the reliability requirements at task level, without having to deal with low level decisions, such as deciding on which FT method to use, where in the system to implement the FT and the amount of resources to be dedicated to the FT mechanism. Hence, it is extremely important to devise methods for translating the highlevel requirement specifications for each task into the low-level scheduling decisions needed for the FT mechanism to function efficiently and correctly. In this paper, we focus achieving FT by redundancy in the temporal domain, as it is the commonly preferred method in embedded applications to recover from transient and intermittent errors, mainly due to its relatively low cost and ease of implementation. We propose a method which allows the system designer to specify task-level reliability requirements and provides a priori probabilistic scheduling guarantees for real-time tasks with mixed-criticality levels in the context of preemptive fixed-priority scheduling. We illustrate the method on a running example.

Place, publisher, year, edition, pages
2011. p. 281-287
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:mdh:diva-13720DOI: 10.1109/ISORCW.2011.34Scopus ID: 2-s2.0-79958014069ISBN: 978-076954377-2 (print)OAI: oai:DiVA.org:mdh-13720DiVA, id: diva2:466266
Conference
2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops, ISORCW 2011;Newport Beach, CA; 28 March 2011 through 31 March 2011
Available from: 2011-12-15 Created: 2011-12-15 Last updated: 2013-12-03Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Aysan, HüseyinDobrin, RaduPunnekkat, Sasikumar

Search in DiVA

By author/editor
Aysan, HüseyinDobrin, RaduPunnekkat, Sasikumar
By organisation
School of Innovation, Design and Engineering
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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