Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2010

Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems

Résumé

The multiprocessor Fixed-Job Priority (FJP) scheduling of real-time systems is studied. An important property for the schedulability analysis, the predictability (regardless to the execution times), is studied for heterogeneous multiprocessor platforms. Our main contribution is to show that any FJP schedulers are predictable on unrelated platforms. A convenient consequence is the fact that any FJP schedulers are predictable on uniform multiprocessors.
Fichier non déposé

Dates et versions

inria-00544642 , version 1 (08-12-2010)

Identifiants

  • HAL Id : inria-00544642 , version 1

Citer

Liliana Cucu-Grosjean, Joël Goossens. Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems. Information Processing Letters, 2010, 110 (10), pp.399-402. ⟨inria-00544642⟩
66 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More