Minimizing the number of processors for real-time distributed systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

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.
Fichier principal
Vignette du fichier
dorin.pdf (416.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00336511 , version 1 (04-11-2008)

Identifiers

  • HAL Id : inria-00336511 , version 1

Cite

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⟩
76 View
322 Download

Share

Gmail Facebook X LinkedIn More