Feasibility Intervals for Multiprocessor Fixed-Priority Scheduling of Arbitrary Deadline Periodic Systems

Liliana Cucu 1 Joël Goossens
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we study the global scheduling of periodic task systems with arbitrary deadlines upon identical multiprocessor platforms. We first show two very general properties which are well-known for uniprocessor platforms and which remain for multiprocessor platforms: under few and not so restrictive assumptions, we show that any feasible schedule of arbitrary deadline periodic task systems is periodic from some point and for the specific case of synchronous periodic task systems, we show that the schedule repeats from the origin. We then present our main result: any feasible schedule of asynchronous periodic task sets using a fixed-priority scheduler is periodic from a specific point. Moreover, we characterize that point and we provide a feasibility interval for those systems.
Type de document :
Communication dans un congrès
10th Design, Automation and Test in Europe - DATE'07, Apr 2007, Nice, France. pp.1635--1640, 2007
Liste complète des métadonnées

https://hal.inria.fr/inria-00192210
Contributeur : Liliana Cucu <>
Soumis le : mardi 27 novembre 2007 - 10:39:36
Dernière modification le : jeudi 11 janvier 2018 - 06:20:05

Identifiants

  • HAL Id : inria-00192210, version 1

Collections

Citation

Liliana Cucu, Joël Goossens. Feasibility Intervals for Multiprocessor Fixed-Priority Scheduling of Arbitrary Deadline Periodic Systems. 10th Design, Automation and Test in Europe - DATE'07, Apr 2007, Nice, France. pp.1635--1640, 2007. 〈inria-00192210〉

Partager

Métriques

Consultations de la notice

148