Federated Scheduling of Sporadic DAG Task Systems

Recurrent (periodic and sporadic) task systems have traditionally been scheduled upon multiprocessor platforms using either the partitioned or the global approach. Under the recently-proposed federated approach, each task is either restricted to execute upon a single processor (as in partitioned scheduling), or may execute upon multiple processors but is the only task to execute upon each of these processors. Earlier studies concerning the federated scheduling of task systems represented using the sporadic DAG model were restricted to implicit-deadline and constrained-deadline sporadic task systems, the research reported here extends this study to the consideration of task systems represented using the more general arbitrary-deadline sporadic DAG model.