Sciweavers

Share
RTSS
2003
IEEE

Multiprocessor EDF and Deadline Monotonic Schedulability Analysis

10 years 5 months ago
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 singlequeue Ñ-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.
Theodore P. Baker
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where RTSS
Authors Theodore P. Baker
Comments (0)
books