Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings of the Work-in-Progress Session at 17th Euromicro Conference on Real-Time Systems (Palma de Mallorca, Spain, July 6-8, 2005), Internal Report No.1723 |
Editors | I. Puaut |
Place of Publication | Rennes, France |
Publisher | IRISA |
Pages | 17-20 |
Publication status | Published - 2005 |