Sharp utilization thresholds for some real-time scheduling problems

@article{Gopalakrishnan2012SharpUT,
  title={Sharp utilization thresholds for some real-time scheduling problems},
  author={Sathish Gopalakrishnan},
  journal={SIGMETRICS Performance Evaluation Review},
  year={2012},
  volume={39},
  pages={12-22}
}
Scheduling policies for real-time systems exhibit threshold behavior that is related to the utilization of the task set they schedule, and in some cases this threshold is sharp. A task set is considered schedulable if it can be scheduled to meet all associated deadlines. A schedulability test for a chosen policy is a test of feasibility: given a task set, can all deadlines be met? For the rate monotonic scheduling policy, we show that periodic workload with utilization less than a threshold URM… CONTINUE READING