Scheduling Periodic Task Graphs for Safety-Critical Time-Triggered Avionic Systems

被引:21
作者
Hu, Menglan [1 ]
Luo, Jun [2 ]
Wang, Yang [3 ]
Veeravalli, Bharadwaj [4 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Elect Informat & Commun, Wuhan 430074, Peoples R China
[2] Nanyang Technol Univ, Sch Comp Engn, Singapore 639798, Singapore
[3] Univ New Brunswick, Fac Comp Sci, Fredericton, NB E3B 5A3, Canada
[4] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore 117576, Singapore
关键词
ASSIGNMENT; ALGORITHM; LOAD;
D O I
10.1109/TAES.2015.140063
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
Time-triggered communication protocols, such as time-triggered protocol (TTP) and FlexRay, have the potential to solve many system integration and concurrent engineering issues in the aerospace industry. This paper investigates the scheduling of periodic applications on time-triggered systems. A novel scheduling problem is formulated to capture a unique feature commonly existing in the safety-critical time-triggered systems, i.e., in task graphs running in such systems, some nodes (i.e., tasks and messages) are strictly periodic while others are not. To address the problem, a novel scheduling algorithm called synchronized highest level first (SHLF) algorithm is presented. Moreover, to further improve schedulability, this paper also proposes two rescheduling and backtracking approaches, namely release time deferment (RTD) procedure and backtracking and priority promotion (BPP) procedure. Performance evaluation results are presented to demonstrate the effectiveness and competitiveness of our approaches when compared with existing algorithms.
引用
收藏
页码:2294 / 2304
页数:11
相关论文
empty
未找到相关数据