HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Dual-Priority versus Background Scheduling: A Path-Wise Comparison

Bruno Gaujal 1 Nicolas Navet 1 Jörn Migge 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper two well-known scheduling policies for Real Time Systems, namely Background Scheduling and Dual-Priority are compared in terms of response times for Soft Real Time traffic (SRT). It is proved that, when the SRT traffic is FIFO, the Dual-Priority policy always behaves better, in the preemptive case as well as in the non-preemptive case. The proof is based on a trajectorial method. As a complementary result, some non-FIFO examples where the Background Scheduling outperforms the Dual-Priority, are given.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 11:18:32 AM
Last modification on : Friday, February 4, 2022 - 3:30:27 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:28:16 PM


  • HAL Id : inria-00072931, version 1



Bruno Gaujal, Nicolas Navet, Jörn Migge. Dual-Priority versus Background Scheduling: A Path-Wise Comparison. [Research Report] RR-3734, INRIA. 1999. ⟨inria-00072931⟩



Record views


Files downloads