Task Scheduling Algorithms for Fault Tolerance in Real-Time Embedded Systems

2000 ◽  
pp. 395-412 ◽  
Author(s):  
Nagarajan Kandasamy ◽  
John P. Hayes ◽  
Brian T. Murray
Keyword(s):  
Fault Tolerance ◽  
Embedded Systems ◽  
Real Time ◽  
Task Scheduling ◽  
Scheduling Algorithms

scholarly journals A Fault Tolerant Scheduling Heuristics for Distributed Real Time Embedded Systems

2018 ◽  
Vol 18 (3) ◽  
pp. 48-61 ◽  
Author(s):  
Bachir Malika ◽  
Hamoudi Kalla
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Task Scheduling ◽  
Fault Tolerant ◽  
Scheduling Algorithms ◽  
Task Graphs ◽  
Heterogeneous Processing ◽  
Mapping Task ◽  
Hardware Faults ◽  
Independent Tasks

Abstract In this paper, fault tolerant task scheduling algorithms are proposed for mapping task graphs to heterogeneous processing nodes. These scheduling heuristics that we propose are redundancy-based software to tolerate hardware faults. We consider only processor permanent failures with a fail-silent behavior. The proposed heuristics generate automatically a real-time fault distributed schedule of dependent and independent tasks into heterogonous multiprocessors architecture. The heuristics are based on active and passive redundancy.

Requirements for Static Task Scheduling in Real Time Embedded Systems

2001 ◽  
pp. 35-44
Author(s):  
Chun Wong ◽  
Filip Thoen ◽  
Francky Catthoor ◽  
Diederik Verkest
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Task Scheduling

scholarly journals REVIEW OF TASK SCHEDULING METHODS FOR REAL TIME TASKS IN CLOUD ENVIRONMENT

2020 ◽  
Vol 5 (1) ◽  
pp. 85-89
Author(s):  
Dinkan Patel ◽  
Anjuman Ranavadiya
Keyword(s):  
Cloud Computing ◽  
Real Time ◽  
Task Scheduling ◽  
Virtual Machines ◽  
Dynamic Scheduling ◽  
Scheduling Algorithms ◽  
Minimum Time ◽  
Cloud Environment ◽  
Static Scheduling ◽  
On Demand

Cloud Computing is a type of Internet model that enables convenient, on-demand resources that can be used rapidly and with minimum effort. Cloud Computing can be IaaS, PaaS or SaaS. Scheduling of these tasks is important so that resources can be utilized efficiently with minimum time which in turn gives better performance. Real time tasks require dynamic scheduling as tasks cannot be known in advance as in static scheduling approach. There are different task scheduling algorithms that can be utilized to increase the performance in real time and performing these on virtual machines can prove to be useful. Here a review of various task scheduling algorithms is done which can be used to perform the task and allocate resources so that performance can be increased.

scholarly journals Comparison of Real Time Task Scheduling Algorithms

2017 ◽  
Vol 158 (6) ◽  
pp. 37-41 ◽  
Author(s):  
Vijayshree Shinde ◽  
Seema C.
Keyword(s):  
Real Time ◽  
Task Scheduling ◽  
Scheduling Algorithms ◽  
Time Task
Sign in / Sign up

Export Citation Format

Share Document