2004 · 269 citations · 15 references
ComputingComputer EngineeringComputer ScienceReal-time SystemsSchedulingDeadline AnalysisPreemptive SchedulingReal-time SchedulingSchedulability AnalysisScheduling TheoryTask SchedulingDeadline MonotonicDeadline Monotonic AnalysisEarliest Deadline First SchedulabilityMultiprocessor Earliest Deadline First SchedulingMultiprocessor SchedulabilityProcessor Utilization BoundsScheduling With DeadlinesUtilization-based Tests
Schedulability tests are presented for preemptive earlier-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 subsume and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independent proof.
15
Stack-based scheduling of realtime processes
T. P. Baker · Real-Time Systems · 1991 · 818 citations
On a Real-Time Scheduling Problem
Sudarshan Dhall, C. L. Liu · Operations Research · 1978 · 567 citations
Static-priority scheduling on multiprocessors
Björn Andersson, Sanjoy Baruah, J. Jönsson · 2005 · 321 citations