Fixed priority scheduling with limited priority levels

DOI10.1109/12.464392zbMath1057.68549OpenAlexW2009604291MaRDI QIDQ4421189

Shirish S. Sathaye, Jay K. Strosnider, Daniel I. Katcher

Publication date: 10 November 2003

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.464392

zbMATH Keywords

real-time systemsdegree of schedulable saturation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Conventional and early token release scheduling models for the IEEE 802.5 token ring ⋮ Maintaining the feasibility of hard real-time systems with a reduced number of priority levels ⋮ A group priority earliest deadline first scheduling algorithm ⋮ On priority assignment in fixed priority scheduling

This page was built for publication: Fixed priority scheduling with limited priority levels