• DocumentCode
    3652201
  • Title

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

  • Author

    Xiaotong Cui; Jun Zhang; Kaijie Wu;Edwin Sha

  • Author_Institution
    Coll. of Comput. Sci., Chongqing Univ., Chongqing, China
  • fYear
    2014
  • Firstpage
    131
  • Lastpage
    136
  • 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%!
  • Keywords
    "Program processors","Schedules","Delays","Real-time systems","Educational institutions","Fault tolerance","Fault tolerant systems"
  • Publisher
    ieee
  • Conference_Titel
    Design Automation Conference (ASP-DAC), 2014 19th Asia and South Pacific
  • Type

    conf

  • DOI
    10.1109/ASPDAC.2014.6742878
  • Filename
    6742878
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3652201