Proceedings of the International Conference on Computer-Aided Design
Efficient and robust probabilistic guarantees for real-time tasks
Journal of Systems and Software
Server-based scheduling of parallel real-time tasks
Proceedings of the tenth ACM international conference on Embedded software
| Hi-index | 0.00 |
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore, GEDF may be a good candidate scheduling algorithm for soft real-time workloads.However, such workloads are often implemented assuming an average-case provisioning, and in prior tardiness-bound derivations for GEDF, worst-case execution costs are assumed.As worst-case costs can be orders of magnitude higher than average-case costs, using a worst-case provisioning may result in significant wasted processing capacity.In this paper, prior tardiness-bound derivations for GEDF are generalized so that execution times are probabilistic, and a bound on expected (mean) tardiness is derived.It is shown that, as long as the total expected utilization is strictly less than the number of available processors, the expected tardiness of every task is bounded under GEDF.The result also implies that any quantile of the tardiness distribution is also bounded.