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
Bounding the effectiveness of temporal redundancy in fault-tolerant real-time scheduling under error bursts
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0002-6355-3564
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0003-4157-3537
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0001-5269-3900
2014 (English)In: 19th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2014, 2014, Article number 7005170- p.Conference paper, Published paper (Refereed)
Abstract [en]

Reliability is a key requirement in many distributed real-time systems deployed in safety and mission critical applications, and temporal redundancy is a widely employed strategy towards guaranteeing it. The temporal redundancy approach is typically based on task re-executions in form of entire tasks, task alternates or, check-pointing blocks, and each of the re-execution strategies have different impacts on the Fault Tolerance feasibility (FT-feasibility) of the system, which is traditionally defined as the existence of a schedule that guarantees timeliness of all tasks under a specified fault hypothesis. In this paper, we propose the use of resource augmentation to quantify the FT-feasibility of real-time task sets and use it to derive limits on the effectiveness of temporal redundancy in fault-tolerant real-time scheduling under error bursts of bounded lengths. We derive the limits for the general case, and then show that for the specific case when the error burst length is no longer than half the shortest deadline, the lower limit on the effectiveness of temporal redundancy is given by the resource augmentation bound 2, while, the corresponding upper-limit is 6. Our proposed approach empowers a system designer to quantify the effectiveness of a particular implementation of temporal redundancy. 

Place, publisher, year, edition, pages
2014. Article number 7005170- p.
Keyword [en]
Factory automation, Fault tolerance, Interactive computer systems, Redundancy, Scheduling, Check pointing, Distributed real time system, Mission critical applications, Real - time scheduling, Real-time tasks, Resource augmentation, System designers, Temporal redundancy, Real time systems
National Category
Computer and Information Science Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:mdh:diva-27927DOI: 10.1109/ETFA.2014.7005170ISI: 000360999100121Scopus ID: 2-s2.0-84946688971ISBN: 9781479948468 (print)OAI: oai:DiVA.org:mdh-27927DiVA: diva2:809175
Conference
19th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2014, 16 September 2014 through 19 September 2014
Available from: 2015-04-30 Created: 2015-04-30 Last updated: 2016-01-18Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Thekkilakattil, AbhilashDobrin, RaduPunnekkat, Sasikumar

Search in DiVA

By author/editor
Thekkilakattil, AbhilashDobrin, RaduPunnekkat, Sasikumar
By organisation
Embedded Systems
Computer and Information ScienceElectrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 11 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