Deadline Monotonic Scheduling on Uniform Multiprocessors

The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, in the form of a processor speedup bound.

• Type: Conference
• Year: 2008
• Where: OPODIS
• Authors: Sanjoy K. Baruah, Joël Goossens
• Keywords: Distributed And Parallel Computing, Non-trivial Quantitative Guarantees, OPODIS 2008, Sufficient Schedulability Test, Uniform Multiprocessor Platforms