scholarly journals Energy-Efficient Fault-Tolerant Scheduling Algorithm for Real-Time Tasks in Cloud-Based 5G Networks

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 53671-53683 ◽  
Author(s):  
Pengze Guo ◽  
Ming Liu ◽  
Jun Wu ◽  
Zhi Xue ◽  
Xiangjian He
Keyword(s):  
Real Time ◽  
Energy Efficient ◽  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
5G Networks

scholarly journals Energy-Efficient Real-Time Scheduling Algorithm for Fault-Tolerant Autonomous Systems

2018 ◽  
Vol 19 (4) ◽  
pp. 387-400
Author(s):  
Hussein El Ghor ◽  
Julia Hage ◽  
Nizar Hamadeh ◽  
Rafic Hage Chehade
Keyword(s):  
Energy Consumption ◽  
Real Time ◽  
Integrated Circuit ◽  
Energy Efficient ◽  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Autonomous Systems ◽  
Scheduling Algorithms ◽  
Real Time Scheduling ◽  
Time Scheduling

For the past decades, we have experienced an aggressive technology scaling due to the tremendous advancements of Integrated Circuit technology. As massive integration continues, the power consumption of the IC chips exponentially increases which further degraded the system reliability. This in turn poses significant challenges to the design of real-time autonomous systems. In this paper, we target the problem of designing advanced real-time scheduling algorithms that are subject to timing, energy consumption and fault-tolerant design constraints. To this end, we first investigated the problem of developing scheduling techniques for uniprocessor real-time systems that minimizes energy consumption while still tolerating up to k transient faults to preserve the system's reliability. Two scheduling algorithms are proposed: the first scheduler is an extension of an optimal fault-free energy-efficient scheduling algorithm, named ES-DVFS. The second algorithm aims to enhance the energy saving by reserving adequate slack time for recovery when faults strike. We derive a necessary and sufficient condition that must be efficiently checked for the time and energy feasibility of aperiodic jobs in the presence of failures. Later, we formally prove that the proposed algorithm is optimal for a k-fault-tolerant model. Our simulation results demonstrate that the proposed schedulers can efficiently improve energy savings when compared with previous works.

scholarly journals An Efficient Fault-Tolerant Multi-Bus Data Scheduling Algorithm Based on Replication and Deallocation

2016 ◽  
Vol 16 (2) ◽  
pp. 69-84
Author(s):  
Chafik Arar ◽  
Mohamed Salah Khireddine
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Experimental Results ◽  
Data Scheduling ◽  
Heterogeneous Architectures ◽  
Hardware Faults

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.

Sign in / Sign up

Export Citation Format

Share Document