scholarly journals On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm

2015 ◽  
Vol 52 (1) ◽  
pp. 113-122 ◽  
Author(s):  
Robert I. Davis ◽  
Marko Bertogna ◽  
Vincenzo Bonifaci
Keyword(s):  
Priority Assignment ◽  
Fixed Priority ◽  
Assignment Algorithm ◽  
Optimal Priority Assignment ◽  
Schedulability Tests

scholarly journals Assigning Priorities for Fixed Priority Preemption Threshold Scheduling

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Saehwa Kim
Keyword(s):  
Real Time ◽  
Empirical Evaluation ◽  
Priority Assignment ◽  
Fixed Priority ◽  
Assignment Algorithm ◽  
Optimal Priority Assignment ◽  
A Performance

Preemption threshold scheduling (PTS) enhances real-time schedulability by controlling preemptiveness of tasks. This benefit of PTS highly depends on a proper algorithm that assigns each task feasible scheduling attributes, which are priority and preemption threshold. Due to the existence of an efficient optimal preemption threshold assignment algorithm that works with fully assigned priority orderings, we need an optimal priority assignment algorithm for PTS. This paper analyzes the inefficiency or nonoptimality of the previously proposed optimal priority assignment algorithms for PTS. We develop theorems for exhaustively but safely pruning infeasible priority orderings while assigning priorities to tasks for PTS. Based on the developed theorems, we correct the previously proposed optimal priority assignment algorithm for PTS. We also propose a performance improved optimal priority assignment algorithm for PTS proving its optimality. The empirical evaluation results clearly show the effectiveness of the proposed algorithm.

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.

scholarly journals Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems

2008 ◽  
Vol 57 (9) ◽  
pp. 1261-1276 ◽  
Author(s):  
Robert I. Davis ◽  
Attila Zabos ◽  
Alan Burns
Keyword(s):  
Real Time ◽  
Real Time Systems ◽  
Fixed Priority ◽  
Time Systems ◽  
Schedulability Tests

Optimal priority assignment in the presence of blocking

2006 ◽  
Vol 99 (3) ◽  
pp. 83-86 ◽  
Author(s):  
Konstantinos Bletsas ◽  
Neil Audsley
Keyword(s):  
Priority Assignment ◽  
Optimal Priority Assignment
Sign in / Sign up

Export Citation Format

Share Document