Static-Priority Scheduling on Multiprocessors

  • Authors:
  • Bjorn Andersson;Sanjoy Baruah;Jan Jonsson

  • Affiliations:
  • -;-;-

  • Venue:
  • RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The preemptive scheduling of systems of periodic taskson a platform comprised of several identical processors isconsidered.A scheduling algorithm is proposed for staticpriority scheduling of such systems; this algorithm isa simple extension of the unprocessed rate-monotonic scheduling algorithm.It is proven that this algorithm successfully schedules any periodic task system with aworst-case utilization no more than a third the capacity of the multiprocessor platform.It is also shown that no static-priority multiprocessor scheduling algorithm (partitioned or global) can guarantee schedulability ora periodic task set with a utilization higher than one halfthe capacity of the multiprocessor platform.