A generalized utilization bound test for fixed-priority real-time scheduling

2002 ◽  
Author(s):  
Dong-Won Park ◽  
S. Natarajan ◽  
A. Kanevsky ◽  
Myung Jun Kim
Keyword(s):  
Real Time ◽  
Fixed Priority ◽  
Real Time Scheduling ◽  
Utilization Bound ◽  
Time Scheduling ◽  
Bound Test

Cache allocation for fixed-priority real-time scheduling on multi-core platforms

2015 ◽  
Author(s):  
Gustavo A. Chaparro-Baquero ◽  
Soamar Homsi ◽  
Omara Vichot ◽  
Shaolei Ren ◽  
Gang Quan ◽  
...  
Keyword(s):  
Real Time ◽  
Fixed Priority ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Cache Allocation

Enhanced fixed-priority real-time scheduling on multi-core platforms by exploiting task period relationship

2015 ◽  
Vol 99 ◽  
pp. 85-96 ◽  
Author(s):  
Ming Fan ◽  
Qiushi Han ◽  
Shuo Liu ◽  
Shaolei Ren ◽  
Gang Quan ◽  
...  
Keyword(s):  
Real Time ◽  
Fixed Priority ◽  
Real Time Scheduling ◽  
Task Period ◽  
Time Scheduling

scholarly journals Fault-Tolerant Energy-Aware Task Scheduling on Multiprocessor System for Fixed-Priority Real-Time Tasks

2019 ◽  
Vol 9 (1) ◽  
pp. 2269-2275 ◽  
Keyword(s):  
Energy Efficiency ◽  
Fault Tolerance ◽  
Real Time ◽  
Task Scheduling ◽  
Fault Tolerant ◽  
Multiprocessor System ◽  
Energy Aware ◽  
Fixed Priority ◽  
Real Time Scheduling ◽  
Time Scheduling

Energy-aware real-time scheduling is gaining attention in recent years owing to environmental concerns and applications in numerous fields. System reliability also gets affected adversely with increasing energy dissipations posing serious challenges before the researchers. Keeping these in view, in recent times researchers have diverted to combining issues of fault-tolerance and energy efficiency. In literature, DVFS and DPM, most commonly used techniques for power management in task scheduling, are often combined with Primary/Backup technique to achieve fault tolerance against transient and permanent faults. Optimal algorithms, Earliest deadline first (EDF) and Rate-Monotonic (RM), meant for scheduling dynamic and fixed priority tasks respectively, have mainly been analyzed using a dual-processor approach for fault-tolerance and energy efficiency. In this paper, to handle higher workload of fixed-priority real-time tasks, energy-aware fault-tolerant scheduling algorithms are proposed for multiprocessor systems with balanced and unbalanced number of main and auxiliary processors. Simulations over extensive task-sets indicate that balanced approach is more energy-efficient than the unbalanced one.

Sign in / Sign up

Export Citation Format

Share Document