Fengxiang Zhang∗
Computer Systems Science and Engineering, Vol.34, No.4, pp. 171-178, 2019, DOI:10.32604/csse.2019.34.171
Abstract 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 Pbusy−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 More >
Login
Register
