Open Access
ARTICLE
An Upper Bound of Task Loads in a Deadline-D All Busy Period for Multiprocessor Global EDF Real-Time Systems
Fengxiang Zhang∗
College of Computer and Information Science, Southwest University, China
* Corresponding Author: Email:
Computer Systems Science and Engineering 2019, 34(4), 171-178. https://doi.org/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 schedulability analyses of global EDF scheduling systems.
Keywords
Cite This Article
APA Style
Zhang, F. (2019). An upper bound of task loads in a deadline-d all busy period for multiprocessor global EDF real-time systems. Computer Systems Science and Engineering, 34(4), 171-178. https://doi.org/10.32604/csse.2019.34.171
Vancouver Style
Zhang F. An upper bound of task loads in a deadline-d all busy period for multiprocessor global EDF real-time systems. Comput Syst Sci Eng. 2019;34(4):171-178 https://doi.org/10.32604/csse.2019.34.171
IEEE Style
F. Zhang, "An Upper Bound of Task Loads in a Deadline-D All Busy Period for Multiprocessor Global EDF Real-Time Systems," Comput. Syst. Sci. Eng., vol. 34, no. 4, pp. 171-178. 2019. https://doi.org/10.32604/csse.2019.34.171
Citations