TY - EJOU
AU - Zhang, Fengxiang
TI - An Upper Bound of Task Loads in a Deadline-D All Busy Period for Multiprocessor Global EDF Real-Time Systems
T2 - Computer Systems Science and Engineering
PY - 2019
VL - 34
IS - 4
SN -
AB - This paper addresses a number of mathematical issues related to multiprocessor global EDF platforms. We present a deadline-d all busy period and backward
interference which are important concepts for multiprocessor EDF systems, and some general schedulability conditions for any studied job are proposed.
We formally prove that at most *m*-1 different tasks’ jobs could contribute their execution time to an interval starting with a *P*_{busy}−d, and we propose an
approach for computing an exact upper bound of the total deadline-d task load in a given interval. Therefore, the proposed results are important foundations
for constructing exact schedulability analyses of global EDF scheduling systems.
KW - Real-time systems; Multiprocessor scheduling; EDF algorithm; Schedulability analysis
DO - 10.32604/csse.2019.34.171