Thread-level priority assignment in global multiprocessor scheduling for DAG tasks

2016 ◽  
Vol 113 ◽  
pp. 246-256 ◽  
Author(s):  
Jiyeon Lee ◽  
Hoon Sung Chwa ◽  
Jinkyu Lee ◽  
Insik Shin
Keyword(s):  
Multiprocessor Scheduling ◽  
Priority Assignment ◽  
Global Multiprocessor Scheduling

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.

scholarly journals Generalized tardiness bounds for global multiprocessor scheduling

2009 ◽  
Vol 44 (1-3) ◽  
pp. 26-71 ◽  
Author(s):  
Hennadiy Leontyev ◽  
James H. Anderson
Keyword(s):  
Multiprocessor Scheduling ◽  
Global Multiprocessor Scheduling

scholarly journals Best Speed Fit EDF Scheduling for Performance Asymmetric Multiprocessors

2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Peng Wu ◽  
Minsoo Ryu
Keyword(s):  
Multiprocessor Scheduling ◽  
System Level ◽  
Time System ◽  
Priority Assignment ◽  
Real Time System ◽  
Priority Task ◽  
Schedulability Test ◽  
Reduced Power Consumption ◽  
Earliest Deadline ◽  
And Task

In order to improve the performance of a real-time system, asymmetric multiprocessors have been proposed. The benefits of improved system performance and reduced power consumption from such architectures cannot be fully exploited unless suitable task scheduling and task allocation approaches are implemented at the operating system level. Unfortunately, most of the previous research on scheduling algorithms for performance asymmetric multiprocessors is focused on task priority assignment. They simply assign the highest priority task to the fastest processor. In this paper, we propose BSF-EDF (best speed fit for earliest deadline first) for performance asymmetric multiprocessor scheduling. This approach chooses a suitable processor rather than the fastest one, when allocating tasks. With this proposed BSF-EDF scheduling, we also derive an effective schedulability test.

Sign in / Sign up

Export Citation Format

Share Document