Skip to Main content Skip to Navigation
Conference papers

Minimizing the number of processors for real-time distributed systems

Abstract : In this paper we present a new search method for partitioning and scheduling a set of periodic tasks on a multiprocessor or distributed architecture. The schedule is fixedpriority driven and task migration is not allowed. The aim of this algorithm is to minimize the number of processors used for scheduling a set of tasks. Moreover, we assume that the number of processors obtained by our method is optimal in respect to the holistic analysis. The paper then compares experimental results from the presented method to the FBB-FFD [9] partitioning algorithm in a multiprocessor context.
Document type :
Conference papers
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Anne Jaigu Connect in order to contact the contributor
Submitted on : Tuesday, November 4, 2008 - 12:57:35 PM
Last modification on : Wednesday, October 20, 2021 - 3:22:08 AM
Long-term archiving on: : Monday, June 7, 2010 - 10:43:49 PM


Files produced by the author(s)


  • HAL Id : inria-00336511, version 1



François Dorin, Michael Richard, Emmanuel Grolleau, Pascal Richard. Minimizing the number of processors for real-time distributed systems. 16th International Conference on Real-Time and Network Systems (RTNS 2008), Isabelle Puaut, Oct 2008, Rennes, France. ⟨inria-00336511⟩



Record views


Files downloads