FIXED PRIORITY SCHEDULING WITH LIMITED PRIORITY LEVELS

Authors
KATCHER DI SATHAYE SS STROSNIDER JK
Citation
Di. Katcher et al., FIXED PRIORITY SCHEDULING WITH LIMITED PRIORITY LEVELS, I.E.E.E. transactions on computers, 44(9), 1995, pp. 1140-1144
Citations number
13
Categorie Soggetti
Computer Sciences","Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture
Journal title
I.E.E.E. transactions on computers → ACNP
ISSN journal
00189340
Volume
44
Issue
9
Year of publication
1995
Pages
1140 - 1144
Database
ISI
SICI code
0018-9340(1995)44:9<1140:FPSWLP>2.0.ZU;2-O
Abstract
This paper develops necessary and sufficient conditions for analyzing the schedulability of fixed priority algorithms on resources with limi ted priority levels. we introduce the degree of schedulable saturation (S-max) as an objective function. A multimedia task set is used to de monstrate how S-max can be used to optimize the grouping of tasks to p riority levels.