Rate-Monotonic Scheduling on Uniform Multiprocessors

  • Authors:
  • Sanjoy K. Baruah;Joël Goossens

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 2003

Quantified Score

Hi-index 14.98

Visualization

Abstract

The rate-monotonic algorithm is arguably one of the most popular algorithms for scheduling systems of periodic real-time tasks. The rate-monotonic scheduling of systems of periodic tasks on uniform multiprocessor platforms is considered here. A simple, sufficient test is presented for determining whether a given periodic task system will be successfully scheduled by this algorithm upon a particular uniform multiprocessor platform驴this test generalizes earlier results concerning rate-monotonic scheduling upon identical multiprocessor platforms.