A simulation approach to statistical evaluation of periodic task scheduling in a real-time computer system
Zbigniew Handzel, Krzysztof J. Latawiec · 2010
The task schedulability theorem in the celebrated GRMS theory provides a sufficient condition only, specifying the upper bound on CPU utilization by scheduled periodic tasks. This paper presents a simulation study on real-time task scheduling for a specific case when the upper bound on processor utilization can be exceeded. The results are applied in a problem of multiprocessor task scheduling.