Towards best-case response times of real-time tasks under fixed-priority scheduling with deferred preemption
Reinder J. Bril, Wfj Wim Verhaegh, I. Puaut · TU/e Research Portal · 2005
In this paper, we present lower bounds for best-case response times of periodic tasks under fixed-priority scheduling with deferred preemption (FPDS) and arbitrary phasing. Our analysis is based on a dedicated conjecture for a ¿-optimal instant, and uses the notion of best-case occupied time. We briefly compare best-case analysis and worst-case analysis for FPDS and arbitrary phasing.