scholarly journals Schedulability Analysis and Priority Assignment for Global Job-Level Fixed-Priority Multiprocessor Scheduling

2012 ◽  
Author(s):  
Hyoungbu Back ◽  
Hoon Sung Chwa ◽  
Insik Shin
Keyword(s):  
Schedulability Analysis ◽  
Multiprocessor Scheduling ◽  
Priority Assignment ◽  
Fixed Priority ◽  
Job Level

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.

Global Multiprocessor Scheduling with Job Level Priority Assignment

2019 ◽  
Vol 28 (12) ◽  
pp. 1950210
Author(s):  
Tao Yang ◽  
Qingxu Deng
Keyword(s):  
Scheduling Algorithm ◽  
Multiprocessor Scheduling ◽  
Priority Assignment ◽  
Global Scheduling ◽  
Job Level ◽  
Timing Errors ◽  
Sporadic Task Systems ◽  
Global Multiprocessor Scheduling ◽  
Partitioned Scheduling ◽  
Task Systems

In the field of real-time multiprocessor scheduling, researchers have found that global scheduling on average results in better resource utilization than partitioned scheduling, and is more robust in the presence of timing errors. In this paper, we present a global scheduling algorithm JPA with Job-level Priority Assignment for sporadic task systems that can be viewed as a generalization of both FPS and EDF. We also introduce JPA's efficient variant, which greatly reduces the runtime overhead comparing with JPA. As will be shown by the experiments, JPA indeed exhibits much better performance than the state-of-the-art multiprocessor scheduling/analysis techniques based on FPS and EDF.

Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling

2011 ◽  
Vol 57 (5) ◽  
pp. 536-546 ◽  
Author(s):  
Nan Guan ◽  
Wang Yi ◽  
Qingxu Deng ◽  
Zonghua Gu ◽  
Ge Yu
Keyword(s):  
Schedulability Analysis ◽  
Multiprocessor Scheduling ◽  
Fixed Priority

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.

Sign in / Sign up

Export Citation Format

Share Document