Deadline Monotonic Scheduling on Uniform Multiprocessors

  • Authors:
  • Sanjoy Baruah;Joël Goossens

  • Affiliations:
  • University of North Carolina at Chapel Hill, USA;Université Libre de Bruxelles, Brussels, Belgium

  • Venue:
  • OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.