On a laxity-based real-time scheduling policy for fixed-priority tasks and its non-utilization bound

2011 ◽  
Author(s):  
Guangyi Chen ◽  
Wenfang Xie
Keyword(s):  
Real Time ◽  
Fixed Priority ◽  
Real Time Scheduling ◽  
Scheduling Policy ◽  
Utilization Bound ◽  
Time Scheduling

Exploitation of the EDF Scheduling in the Wireless Sensors Networks

2013 ◽  
pp. 87-100
Author(s):  
Rym Chéour ◽  
Sébastien Bilavarn ◽  
Mohamed Abid
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Management Policy ◽  
Wireless Sensor ◽  
Periodic Tasks ◽  
Real Time Scheduling ◽  
Scheduling Policy ◽  
Time Scheduling ◽  
Earliest Deadline

Today, due to recent advances in wireless technology, new products using wireless sensor networks are being employed. However, despite the excitement surrounding wireless sensor networks, it is not immune to the problem of energy consumption. To overcome this deficiency and enhance the real time aspect, a growing interest lies in the implementation of an “Earliest Deadline First” (EDF) scheduler. Thus, in this paper, the authors establish a management policy of periodic tasks that is preemptive, multiprocessor, and dynamic. The authors implement a real-time scheduling policy as a part of a user-level threads package under the Linux operating system as Linux does not support EDF. Furthermore, this paper describes the technique of the EDF scheduler and how it can yield to significant power savings.

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