By Topic

Fixed priority scheduling with limited priority levels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Katcher, D.I. ; Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA ; Sathaye, S.S. ; Strosnider, J.K.

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

Published in:

Computers, IEEE Transactions on  (Volume:44 ,  Issue: 9 )