On-Line Scheduling on Uniform Multiprocessors

  • Authors:
  • Shelby Funk;Joel Goossens;Sanjoy Baruah

  • Affiliations:
  • -;-;-

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

Each processor in a uniform multiprocessor machine ischaracterized by a speed or computing capacity, with theinterpretation that a job executing on a processor with speeds for t time units completes (s X t) units of execution.Theon-line scheduling of hard-real-time systems, in which alljobs must complete by specified deadlines, on uniformmultiprocessor machines is considered.It is known that on-line algorithms tend to perform very poorly in schedulingsuch hard-real-time systems on multiprocessors; resource-augmentation techniques are presented here thatpermit on-line algorithms to perform better than may be expectedgiven the inherent limitations.Results derived here are appliedto the scheduling of periodic task systems on uniformmultiprocessor machines.