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

Non-premptive Fixed Priority schedulingwith FIFO arbitration:uniprocessor and distributed cases

Steven Martin Pascale Minet 1 Laurent George
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : In this paper, we focus on non-preemptive Fixed Priority scheduling. We are interested in the worst case response time of flows, both in uniprocessor and distributed cases. On a processor, the number of available priorities is generally limited. If this number is less than the number of flows to be considered, several flows have to share the same priority. Such flows are assumed to be scheduled arbitrarily in the classical approach. We assume in this paper that these flows are scheduled FIFO. This assumption leads us to revisit classical results in the uniprocessor case. As we obtain response times less than or equal to the classical results, any flow set feasible with the classical approach is feasible with our approach. The converse is false, as shown by an example. Moreover, we determine the conditions leading to shorter response times. We then establish new results in a distributed context. We show how to compute an upper bound on the end-to-end response time of any flow. For this, we use a worst case analysis based on the trajectory approach.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 5:52:44 PM
Last modification on : Friday, February 4, 2022 - 3:07:56 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:23:08 PM


  • HAL Id : inria-00071532, version 1



Steven Martin, Pascale Minet, Laurent George. Non-premptive Fixed Priority schedulingwith FIFO arbitration:uniprocessor and distributed cases. [Research Report] RR-5051, INRIA. 2004. ⟨inria-00071532⟩



Record views


Files downloads