Towards best-case response times of real-time tasks under fixed-priority scheduling with deferred preemption

R.J. Bril, W.F.J. Verhaegh

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

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 languageEnglish
Title of host publicationProceedings 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
EditorsI. Puaut
Place of PublicationRennes, France
PublisherIRISA
Pages17-20
Publication statusPublished - 2005

Fingerprint

Dive into the research topics of 'Towards best-case response times of real-time tasks under fixed-priority scheduling with deferred preemption'. Together they form a unique fingerprint.

Cite this