Open AccessAn Upper Bound of Task Loads in a Deadline-D All Busy Period for Multiprocessor Global EDF Real-Time Systems
Author(s) -
Fengxiang Zhang
Publication year - 2019
Publication title -
computer systems science and engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.19
H-Index - 26
ISSN - 0267-6192
DOI - 10.32604/csse.2019.34.171
Subject(s) - multiprocessing , computer science , scheduling (production processes) , parallel computing , upper and lower bounds , interval (graph theory) , multiprocessor scheduling , task (project management) , earliest deadline first scheduling , real time operating system , processor scheduling , distributed computing , dynamic priority scheduling , embedded system , mathematical optimization , rate monotonic scheduling , mathematics , operating system , schedule , combinatorics , mathematical analysis , management , economics
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom