EEDS NR: An Online Energy-Efficient I/O Device Scheduling Algorithm for Hard Real-Time Systems with Non-preemptible Resources

2006 ◽  
Author(s):  
Hui Cheng ◽  
S. Goddard
Keyword(s):  
Real Time ◽  
Energy Efficient ◽  
Scheduling Algorithm ◽  
Real Time Systems ◽  
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

Energy-Efficient Scheduling for Embedded Real-Time Systems Using Threshold Work-Demand Analysis

2017 ◽  
Vol 26 (06) ◽  
pp. 1750091 ◽  
Author(s):  
Linwei Niu ◽  
Wei Li
Keyword(s):  
Energy Saving ◽  
Real Time ◽  
Energy Efficient ◽  
Critical Speed ◽  
Demand Analysis ◽  
Real Time Systems ◽  
Work Demand ◽  
Hard Real Time ◽  
Time Systems ◽  
Earliest Deadline

In this paper, we study the problem of reducing the energy consumption for hard real-time systems scheduled according to either fixed-priority (FP) or earliest-deadline-first (EDF) scheme. To balance the static and dynamic energy consumptions, the concept of critical speed was proposed in previous research. Moreover, when combined with the processor idle/shutdown state, the critical speed was widely used as the lower bound for voltage scaling in literature. In this paper, we show that this strategy might not always be more energy efficient than the traditional DVS strategy and there exists a dynamic tradeoff between these two strategies depending on the job’s work-demand to be finished within certain intervals. To effectively address this issue, we propose a unified approach that combines these two strategies to achieve better overall energy saving performance. Our approach determines the energy-efficient speeds for real-time jobs in their corresponding feasible intervals based on the threshold work-demand analysis. Our experimental results demonstrate that the proposed techniques significantly outperform previous approaches in the overall energy saving performance.

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

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.

Quasi-static fault-tolerant scheduling schemes for energy-efficient hard real-time systems

2012 ◽  
Vol 85 (6) ◽  
pp. 1386-1399 ◽  
Author(s):  
Tongquan Wei ◽  
Piyush Mishra ◽  
Kaijie Wu ◽  
Junlong Zhou
Keyword(s):  
Real Time ◽  
Energy Efficient ◽  
Fault Tolerant ◽  
Real Time Systems ◽  
Hard Real Time ◽  
Time Systems
Sign in / Sign up

Export Citation Format

Share Document