scholarly journals Generalized Tardiness Bounds for Global Multiprocessor Scheduling

2007 ◽  
Author(s):  
Hennadiy Leontyev ◽  
James Anderson
Keyword(s):  
Multiprocessor Scheduling ◽  
Global Multiprocessor Scheduling

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

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.

Sign in / Sign up

Export Citation Format

Share Document