Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
FSU Computer Science Technical Report TR-030401

Theodore P. Baker

Department of Computer Science
Florida State University
Tallahassee, FL 32306-4530
e-mail: baker@cs.fsu.edu

7 February 2003¹

Abstract:

Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic 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 subsume and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independent proof.