Conference
2026
Preempt Less, Schedule Better: Revisiting PCG for Real-Time Uniform Processors
PCG ∗ is introduced, an optimal TL-plane algorithm based on PCG, which guarantees at most 2( m − 1) preemptions per TL-plane, matching the best-known theoretical bound for uniform platforms.
Yahya Hamdani, P. Richard, A. Bertout et al.
· Euromicro Conference on Real... · 0 citations