mdh.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Task-Level Probabilistic Scheduling Guarantees for Dependable Real-Time Systems: A designer centric approach  
Mälardalens högskola, Akademin för innovation, design och teknik.ORCID-id: 0000-0001-5053-6725
Mälardalens högskola, Akademin för innovation, design och teknik.ORCID-id: 0000-0003-4157-3537
Mälardalens högskola, Akademin för innovation, design och teknik.ORCID-id: 0000-0001-5269-3900
2011 (Engelska)Ingår i: Proceedings - 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops, ISORCW 2011, 2011, s. 281-287Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
2011. s. 281-287
Nationell ämneskategori
Teknik och teknologier
Identifikatorer
URN: urn:nbn:se:mdh:diva-13720DOI: 10.1109/ISORCW.2011.34Scopus ID: 2-s2.0-79958014069ISBN: 978-076954377-2 (tryckt)OAI: oai:DiVA.org:mdh-13720DiVA, id: diva2:466266
Konferens
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
Tillgänglig från: 2011-12-15 Skapad: 2011-12-15 Senast uppdaterad: 2013-12-03Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Aysan, HüseyinDobrin, RaduPunnekkat, Sasikumar

Sök vidare i DiVA

Av författaren/redaktören
Aysan, HüseyinDobrin, RaduPunnekkat, Sasikumar
Av organisationen
Akademin för innovation, design och teknik
Teknik och teknologier

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 48 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf