Exploiting Gaps in Fixed-Priority Preemptive Schedules for Task Insertion

2010 ◽  
Author(s):  
Eike Thaden ◽  
Henrik Lipskoch ◽  
Alexander Metzner ◽  
Ingo Stierand
Keyword(s):  
Fixed Priority

Leakage-Aware Energy-Efficient Scheduling for Fixed-Priority Tasks with Preemption Thresholds

2009 ◽  
Vol 31 (11) ◽  
pp. 2060-2071 ◽  
Author(s):  
Xiao-Chuan HE ◽  
Yan JIA
Keyword(s):  
Energy Efficient ◽  
Fixed Priority ◽  
Energy Efficient Scheduling

Harmonicity-Aware Task Partitioning for Fixed Priority Scheduling of Probabilistic Real-Time Tasks on Multi-Core Platforms

2017 ◽  
Vol 16 (4) ◽  
pp. 1-21 ◽  
Author(s):  
Tianyi Wang ◽  
Soamar Homsi ◽  
Linwei Niu ◽  
Shaolei Ren ◽  
Ou Bai ◽  
...  
Keyword(s):  
Real Time ◽  
Task Partitioning ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling

Tardiness bounds for fixed-priority global scheduling without intra-task precedence constraints

2021 ◽  
Author(s):  
Sergey Voronov ◽  
James H. Anderson ◽  
Kecheng Yang
Keyword(s):  
Precedence Constraints ◽  
Global Scheduling ◽  
Fixed Priority

A Review of Sufficient Schedulability Analysis for Fixed Priority Scheduling Systems

2015 ◽  
Vol 741 ◽  
pp. 856-859
Author(s):  
Yan Feng Zhai ◽  
Feng Xiang Zhang
Keyword(s):  
Schedulability Analysis ◽  
Priority Assignment ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Rate Monotonic ◽  
Simple Implementation ◽  
Deadline Monotonic ◽  
Activation Rates

This papercarries out a survey of sufficient schedulability analysis forfixed priority (FP) scheduling. The most common used fixed priority assignment is the rate monotonic (RM) algorithm, according to its policy, the task priorities are ordered based on their activation rates, so that the task with the shortest period is assigned the highest priority. However, when each task’s relative deadline is not equal to its period, the RM algorithm is not suitable to assign the task priorities. When relative deadlines are less than or equal to periods,the deadline monotonic (DM) algorithm can be deployed to schedule the tasks. The utilization based schedulability analysis has the advantage of simple implementation, and manyexisting schedulability analyses on uniprocessor are covered.

Sign in / Sign up

Export Citation Format

Share Document