Synthesis of Flexible Fault-Tolerant Schedules for Embedded Systems with Soft and Hard Timing Constraints

Author(s):  
Viacheslav Izosimov ◽  
Paul Pop ◽  
Petru Eles ◽  
Zebo Peng

The authors also present evaluation of the schedule synthesis heuristics with and without preemption using extensive experiments and a real-life example.

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 20920-20937
Author(s):  
Yunlong Sheng ◽  
Shouda Jiang ◽  
Changan Wei

2006 ◽  
Vol 2006 ◽  
pp. 1-15 ◽  
Author(s):  
Thilo Streichert ◽  
Dirk Koch ◽  
Christian Haubelt ◽  
Jürgen Teich

2016 ◽  
Vol 16 (2) ◽  
pp. 69-84
Author(s):  
Chafik Arar ◽  
Mohamed Salah Khireddine

Abstract The paper proposes a new reliable fault-tolerant scheduling algorithm for real-time embedded systems. The proposed scheduling algorithm takes into consideration only one bus fault in multi-bus heterogeneous architectures, caused by hardware faults and compensated by software redundancy solutions. The proposed algorithm is based on both active and passive backup copies, to minimize the scheduling length of data on buses. In the experiments, this paper evaluates the proposed methods in terms of data scheduling length for a set of DAG benchmarks. The experimental results show the effectiveness of our technique.


Computer ◽  
2020 ◽  
Vol 53 (3) ◽  
pp. 38-46
Author(s):  
Manuel Barranco ◽  
Sinisa Derasevic ◽  
Julian Proenza

Sign in / Sign up

Export Citation Format

Share Document