An exact comparison of global, partitioned, and semi-partitioned fixed-priority real-time multiprocessor schedulers

2021 ◽  
pp. 102313
Author(s):  
Artem Burmyakov ◽  
Borislav Nikolić
Keyword(s):  
Real Time ◽  
Fixed Priority

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

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.

Global Fixed Priority Scheduling with Constructing Execution Dependency in Multiprocessor Real-Time Systems

2018 ◽  
Vol 27 (10) ◽  
pp. 1850165
Author(s):  
Meiling Han ◽  
Tianyu Zhang ◽  
Yuhan Lin ◽  
Zhiwei Feng ◽  
Qingxu Deng
Keyword(s):  
Real Time ◽  
Real Time Systems ◽  
Analysis Method ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Lower Priority ◽  
Acceptance Ratio ◽  
Processor Performance ◽  
Time Systems

The increasing demands for processor performance are driving system designers to adopt multiprocessors. In this paper, we study global fixed priority scheduling in multiprocessor real-time systems and introduce a technique for improving the schedulability. The key idea is to construct execution dependency for selected tasks to leverage slack time and reduce the interference between high-priority and low-priority tasks. Thus, more lower-priority tasks are enabled to be scheduled. Further, we provide a response time analysis method which takes the execution constraint of tasks into consideration. Extensive simulation results indicate that the proposed approach outperforms existing work in terms of acceptance ratio.

Sign in / Sign up

Export Citation Format

Share Document