Efficient feasibility analysis of DAG scheduling with real-time constraints in the presence of faults

  • Xiaotong Cui
  • , Jun Zhang
  • , Kaijie Wu
  • , Edwin Sha

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Tasks in hard real-time systems are required to meet deadlines in the presence of faults. We conclude that a sufficient condition of a task set experiencing its worst-case finish time (WCFT) is that its critical task (CT) incurs all faults. An algorithm is presented to identify the CT and the WCFT in O(N2) with N being the task number. A common practice that bet the WCFT using the task with the longest re-execution time could under estimate by up-to 35%!

Original languageEnglish
Title of host publication2014 19th Asia and South Pacific Design Automation Conference, ASP-DAC 2014 - Proceedings
Pages131-136
Number of pages6
DOIs
StatePublished - 2014
Externally publishedYes
Event2014 19th Asia and South Pacific Design Automation Conference, ASP-DAC 2014 - Suntec, Singapore
Duration: 20 Jan 201423 Jan 2014

Publication series

NameProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Conference

Conference2014 19th Asia and South Pacific Design Automation Conference, ASP-DAC 2014
Country/TerritorySingapore
CitySuntec
Period20/01/1423/01/14

Keywords

  • Fault tolerance
  • critical task
  • feasibility test
  • frame-based real-time system
  • worst-case analysis

Fingerprint

Dive into the research topics of 'Efficient feasibility analysis of DAG scheduling with real-time constraints in the presence of faults'. Together they form a unique fingerprint.

Cite this