Partitioned Scheduling of Parallel Real-time Tasks on Multiprocessor Systems

Abstract : In this paper, we focus on the scheduling of periodic fork-join real-time tasks on multiprocessor systems. Parallel real-time tasks of fork-join model have strict parallel segments with no laxity. We propose a parti- tioned scheduling algorithm which increases the laxity of the parallel segments and therefore the schedula- bility of tasksets of this model. A similar algorithm has been proposed in the literature but it produces job migrations. Ours avoid the use of job migrations in order to create a portable algorithm that can be implemented on a standard Linux kernel. Results of extensive simulations are provided in order to analyze the schedulability of the proposed algorithm compared to the previous one.
Type de document :
Article dans une revue
ACM SIGBED Review, Association for Computing Machinery (ACM), 2011, 8 (3), pp.28-31. 〈10.1145/2038617.2038623〉
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00668726
Contributeur : Frédéric Fauberteau <>
Soumis le : vendredi 10 février 2012 - 11:38:51
Dernière modification le : mercredi 4 juillet 2018 - 16:37:56
Document(s) archivé(s) le : jeudi 22 novembre 2012 - 11:57:04

Fichier

paper_ecrts.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Frédéric Fauberteau, Manar Qamhieh, Serge Midonnet. Partitioned Scheduling of Parallel Real-time Tasks on Multiprocessor Systems. ACM SIGBED Review, Association for Computing Machinery (ACM), 2011, 8 (3), pp.28-31. 〈10.1145/2038617.2038623〉. 〈hal-00668726〉

Partager

Métriques

Consultations de la notice

403

Téléchargements de fichiers

353