Institute of Electrical & Electronic Engineers
In this paper, the authors address the schedulability problem of periodic and sporadic real-time task sets with constrained deadlines preemptively scheduled on a multiprocessor platform composed by identical processors. They assume that a global work-conserving scheduler is used and migration from one processor to another is allowed during task lifetime. First, a general method to derive schedulability conditions for multiprocessor real-time systems will be presented. The analysis will be applied to two typical scheduling algorithms: Earliest Deadline First (EDF) and Fixed Priority (FP).