The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1995 vol.44)
pp: 1140-1144
ABSTRACT
<p><it>Abstract</it>—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 (<it>S</it><sub><it>max</it></sub>) as an objective function. A multimedia task set is used to demonstrate how <it>S</it><sub><it>max</it></sub> can be used to optimize the grouping of tasks to priority levels.</p>
INDEX TERMS
Real-time systems, fixed priority scheduling, schedulability, degree of schedulable saturation.
CITATION
Shirish S. Sathaye, Daniel I. Katcher, Jay K. Strosnider, "Fixed Priority Scheduling with Limited Priority Levels", IEEE Transactions on Computers, vol.44, no. 9, pp. 1140-1144, September 1995, doi:10.1109/12.464392
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool