A static scheduling algorithm for distributed hard real-time systems

1991 ◽  
Vol 3 (3) ◽  
pp. 227-246 ◽  
Author(s):  
J. P. C. Verhoosel ◽  
E. J. Luit ◽  
D. K. Hammer ◽  
E. Jansen
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Real Time Systems ◽  
Static Scheduling ◽  
Hard Real Time ◽  
Time Systems

Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems

1985 ◽  
Vol C-34 (12) ◽  
pp. 1130-1143 ◽  
Author(s):  
John A. Stankovic ◽  
Krithivasan Ramamritham ◽  
Shengchang Cheng
Keyword(s):  
Real Time ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Real Time Systems ◽  
Task Scheduling Algorithm ◽  
Hard Real Time ◽  
Time Systems

A Fault-Tolerant Scheduling Algorithm Based on Checkpointing and Redundancy for Distributed Real-Time Systems

2019 ◽  
Vol 10 (3) ◽  
pp. 58-75 ◽  
Author(s):  
Barkahoum Kada ◽  
Hamoudi Kalla
Keyword(s):  
Real Time ◽  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Real Time Systems ◽  
Transient Faults ◽  
Spare Capacity ◽  
Tolerance Approach ◽  
Architecture Simulation ◽  
Hard Real Time ◽  
Time Systems

Real-time systems are becoming ever more widely used in life-critical applications, and the need for fault-tolerant scheduling can only grow in the years ahead. This article presents a novel fault tolerance approach for tolerating transient faults in hard real-time systems. The proposed approach combines both checkpointing with rollback and active replication to tolerate several transient faults. Based on this approach, a new static fault-tolerant scheduling algorithm SFTS is presented. It is based on a list of scheduling heuristics which satisfy the application time constraints even in the presence of faults by exploring the spare capacity of available processors in the architecture. Simulation results show the performance and effectiveness of the proposed approach compared to other fault-tolerant approaches. The results reveal that in the presence of multiple transient faults, the average timing overhead of this approach is lower than checkpointing technique. Moreover, the proposed algorithm SFTS achieves better feasibility rate in the presence of multiple transient faults.

A Fault-Tolerant Scheduling Algorithm Based on Checkpointing and Redundancy for Distributed Real-Time Systems

2021 ◽  
pp. 770-788
Author(s):  
Barkahoum Kada ◽  
Hamoudi Kalla
Keyword(s):  
Real Time ◽  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Real Time Systems ◽  
Transient Faults ◽  
Application Time ◽  
Spare Capacity ◽  
Architecture Simulation ◽  
Hard Real Time ◽  
Time Systems

Real-time systems are becoming ever more widely used in life-critical applications, and the need for fault-tolerant scheduling can only grow in the years ahead. This article presents a novel fault tolerance approach for tolerating transient faults in hard real-time systems. The proposed approach combines both checkpointing with rollback and active replication to tolerate several transient faults. Based on this approach, a new static fault-tolerant scheduling algorithm SFTS is presented. It is based on a list of scheduling heuristics which satisfy the application time constraints even in the presence of faults by exploring the spare capacity of available processors in the architecture. Simulation results show the performance and effectiveness of the proposed approach compared to other fault-tolerant approaches. The results reveal that in the presence of multiple transient faults, the average timing overhead of this approach is lower than checkpointing technique. Moreover, the proposed algorithm SFTS achieves better feasibility rate in the presence of multiple transient faults.

scholarly journals Integer Programming Techniques for Static Scheduling of Hard Real-Time Systems

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 170389-170403
Author(s):  
Ana Guasque ◽  
Hossein Tohidi ◽  
Patricia Balbastre ◽  
Jose Maria Aceituno ◽  
Jose Simo ◽  
...  
Keyword(s):  
Integer Programming ◽  
Real Time ◽  
Real Time Systems ◽  
Static Scheduling ◽  
Programming Techniques ◽  
Hard Real Time ◽  
Time Systems

scholarly journals Performance of Dynamic Queue based Minimal Deadline First Scheduling Algorithm in Multicore System Under Real Time and NonReal Time Kernel Environment

2019 ◽  
Vol 8 (11) ◽  
pp. 3263-3268
Keyword(s):  
Operating System ◽  
Real Time ◽  
Low Cost ◽  
Scheduling Algorithm ◽  
Priority Queue ◽  
Real Time Systems ◽  
Real Time System ◽  
Core System ◽  
Hard Real Time ◽  
Time Systems

Some real-time systems that need to be associated with operating system services with a hard real-time system. Since these real-time systems that need to be extremely responsive to the outside world have no simple and low-cost operating system assistance. This paper deals with the application on a Linux-based operating system of the priority-based preemptive real-time scheduling algorithm that will suffice these firm applications in real-time. Typically, the algorithms regarded for these hard real-time systems are preemptive scheduling based on priorities. Based on the priority, by meeting the deadline, this algorithm can produce a feasible schedule for the dynamic tasks to be performed on the processor. It is feasible to schedule tasks on a processor as long as preemption is permitted and tasks do not compete for resources. In this scheduling algorithm, the task in the running queue that is waiting for the execution will be placed in the priority queue that is ready to execute in the available processor. This algorithm is deployed in the Linux kernel with the patch file and the kernel is built in the multi core system to execute an application

Sign in / Sign up

Export Citation Format

Share Document