A study of scheduling problems with preemptions on multi-core computers with GPU accelerators

Abstract : For many years, scheduling problems have been concerned either with parallel processor systems or with dedicated processors-job shop type systems. With a development of new computing architectures this partition is no longer so obvious. Multi-core (processor) computers equipped with GPU co-processors require new scheduling strategies. This paper is devoted to a characterization of this new type of scheduling problems. After a thorough introduction of the new model of a computing system, an extension of the classical notation of scheduling problems is proposed. A special attention is paid to preemptions, since this feature of the new architecture differs the most as compared with the classical model. In the paper, several scheduling algorithms, new ones and those refining classical approaches, are presented. Possible extensions of the model are also discussed.
Type de document :
Article dans une revue
Discrete Applied Mathematics, Elsevier, 2015, 196, pp.72-82. 〈10.1016/j.dam.2015.04.009〉
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-01208434
Contributeur : Grégory Mounié <>
Soumis le : vendredi 2 octobre 2015 - 15:37:58
Dernière modification le : vendredi 21 décembre 2018 - 10:46:07
Document(s) archivé(s) le : dimanche 3 janvier 2016 - 10:51:06

Fichier

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

Identifiants

Collections

Citation

Jacek Błażewicz, Safia Kedad-Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram. A study of scheduling problems with preemptions on multi-core computers with GPU accelerators. Discrete Applied Mathematics, Elsevier, 2015, 196, pp.72-82. 〈10.1016/j.dam.2015.04.009〉. 〈hal-01208434〉

Partager

Métriques

Consultations de la notice

640

Téléchargements de fichiers

133