Improved Multiprocessor Global Schedulability Analysis of Sporadic DAG Task Systems

Bonifaci et al have recently introduced some novel analytical techniques in order to derive a speed-up bound for the multiprocessor global EDF scheduling of systems of recurrent tasks that are represented using the sporadic DAG task model, and have applied these techniques to obtain a pseudo-polynomial time sufficient schedulability test. In this paper, these techniques are further generalized to yield an improved pseudo-polynomial time sufficient schedulability test for global EDF scheduling of systems of sporadic DAG tasks. It is shown that this new test strictly dominates the one by Bonifaci et al, in addition, schedulability experiments demonstrate that the improvement can be quite substantial for certain kinds of task systems.