Management of anytime tasks in real time applications

Colloque avec actes et comité de lecture. internationale.International audienceA large number of applications in such areas as diagnosis or path planning, use more and more anytime algorithms for which the quality of results increases with computation time. Two types of anytime algorithm exist interruptible and contract algorithms. An interruptible algorithm can be stopped at any time, while for a contract algorithm, a mandatory computation time is required. Using this type of algorithm in a real time application introduces a new set of timed constraints (e.g. dealines). We propose, in this paper, the definition of a new entity called Resource Manager. Its aim is to share the processor among the different types of tasks (non-anytime, anytime interruptible or anytime with contract) so that every deadlines are respected. This algorithm uses an acceptation test based on Earliest Deadline First policy, without explicit computation of the response times. || Un grand nombre d'applications dans certains domaines comme le diagnostic ou la recherche de trajectoire utilise de plus en plus des algorithmes "anytime" tels que la qualité de leurs résultats s'accroit en fonction du temps de calcul. Deux types de tel