Multiprocessor Edf And Deadline Monotonic Schedulability Analysis

Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a single-queue m-server system, in which the deadline of a task may be less than or equal to the task period. These results sub-same and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independent proof.