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
FT-Feasibility in Fixed Priority Real-Time Scheduling
Mälardalens högskola, Institutionen för datavetenskap och elektronik.ORCID-id: 0000-0001-5053-6725
Mälardalens högskola, Institutionen för datavetenskap och elektronik.ORCID-id: 0000-0003-4157-3537
Mälardalens högskola, Institutionen för datavetenskap och elektronik.ORCID-id: 0000-0001-5269-3900
2007 (Engelska)Rapport (Övrigt vetenskapligt)
Abstract [en]

Real-time systems typically have to satisfy complex requirements mapped to the timing attributes of the tasks that are eventually guaranteed by the underlying scheduler. These systems consist of a mix of hard and soft tasks with varying criticalities as well as associated fault tolerance (FT) requirements. Often time redundancy techniques are preferred in many embedded applications and hence it is extremely important to devise appropriate methodologies for scheduling real-time tasks under fault assumptions. Additionally, the relative criticality of tasks could undergo changes during the evolution of the system. Hence scheduling decisions under fault assumptions have to reflect all these important factors in addition to the resource constraints.

In this paper we propose a framework for 'FTfeasibility', i.e., to provide a priori guarantees that all critical tasks in the system will meet their deadlines even in case of faults. Our main objective here is to ensure FTfeasibility of all critical tasks in the system and do so with minimal costs and without any fundamental changes in the scheduling paradigm. We demonstrate its applicability in scenarios where the FT strategy employed is re-execution of the affected tasks or an alternate action upon occurrence of transient faults or software design faults. We analyse a feasible set of tasks and propose methods to adapt it to varying FT requirements without modifications to the underlying scheduler. We do so by reassigning task attributes to achieve FT-feasibility while keeping the costs minimised.

Ort, förlag, år, upplaga, sidor
2007.
Nationell ämneskategori
Datorsystem
Identifikatorer
URN: urn:nbn:se:mdh:diva-6995ISRN: MDH-MRTC-210/2007-1-SEOAI: oai:DiVA.org:mdh-6995DiVA, id: diva2:237005
Tillgänglig från: 2009-09-25 Skapad: 2009-09-25 Senast uppdaterad: 2015-07-29Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

http://www.es.mdh.se/pdf_publications/1064.pdf

Personposter BETA

Aysan, HüseyinDobrin, RaduPunnekkat, Sasikumar

Sök vidare i DiVA

Av författaren/redaktören
Aysan, HüseyinDobrin, RaduPunnekkat, Sasikumar
Av organisationen
Institutionen för datavetenskap och elektronik
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 113 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