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
FT-Feasibility in Fixed Priority Real-Time Scheduling
Mälardalen University, Department of Computer Science and Electronics.ORCID iD: 0000-0001-5053-6725
Mälardalen University, Department of Computer Science and Electronics.ORCID iD: 0000-0003-4157-3537
Mälardalen University, Department of Computer Science and Electronics.ORCID iD: 0000-0001-5269-3900
2007 (English)Report (Other academic)
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.

Place, publisher, year, edition, pages
2007.
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:mdh:diva-6995ISRN: MDH-MRTC-210/2007-1-SEOAI: oai:DiVA.org:mdh-6995DiVA, id: diva2:237005
Available from: 2009-09-25 Created: 2009-09-25 Last updated: 2015-07-29Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

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

Authority records BETA

Aysan, HüseyinDobrin, RaduPunnekkat, Sasikumar

Search in DiVA

By author/editor
Aysan, HüseyinDobrin, RaduPunnekkat, Sasikumar
By organisation
Department of Computer Science and Electronics
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 69 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