Fixed Priority Scheduling with Limited Priority Levels

  • Authors:
  • Shirish S. Sathaye;Daniel I. Katcher;Jay K. Strosnider

  • Affiliations:
  • -;-;-

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

Quantified Score

Hi-index 14.98

Visualization

Abstract

This paper develops necessary and sufficient conditions for analyzing the schedulability of fixed priority algorithms on resources with limited priority levels. We introduce the degree of schedulable saturation (Smax) as an objective function. A multimedia task set is used to demonstrate how Smax can be used to optimize the grouping of tasks to priority levels.