The multiprocessor Deadline-Monotonic scheduling of sporadic task systems is studied. A new sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, including a processor speedup bound.
['Sanjoy K. Baruah', 'Nathan Fisher']
Global deadline-monotonic scheduling of arbitrary-deadline sporadic task systems