Fault-tolerant scheduling in hierarchical real-time scheduling framework

Jongsoo Hyun, Kyong Hoon Kim

Research output: Contribution to conferencePaperpeer-review

7 Scopus citations

Abstract

As real-time systems become complex and require high-performance, Hierarchical Real-Time Scheduling Framework (HRTSF) has been investigated to schedule real-time tasks to meet their deadlines by sharing resources hierarchically under various scheduling algorithms. In this paper, we focus on fault-tolerant scheduling in the hierarchical real-time scheduling framework. Thus, we introduce a new component interface model which provides abstract information about a component's fault-tolerant real-time requirement. The upper-layer component can use the interface model to share its resource with consideration of both real-time and fault-tolerance. We also provide the schedulability analysis of Rate Monotonic (RM) algorithm under the proposed framework and apply it to a case study of designing avionics software as an example of Cyber Physical Systems (CPS).

Original languageEnglish
Pages431-436
Number of pages6
DOIs
StatePublished - 2012
Event18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012 - Seoul, Korea, Republic of
Duration: 19 Aug 201222 Aug 2012

Conference

Conference18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012
Country/TerritoryKorea, Republic of
CitySeoul
Period19/08/1222/08/12

Keywords

  • Compositional
  • Fault-tolerant
  • Hierarchical
  • Real-time scheduling

Fingerprint

Dive into the research topics of 'Fault-tolerant scheduling in hierarchical real-time scheduling framework'. Together they form a unique fingerprint.

Cite this