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.
Liste complète des métadonnées

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01208434
Contributor : Grégory Mounié <>
Submitted on : Friday, October 2, 2015 - 3:37:58 PM
Last modification on : Thursday, April 4, 2019 - 10:18:05 AM
Document(s) archivé(s) le : Sunday, January 3, 2016 - 10:51:06 AM

File

DAMarticle.pdf
Files produced by the author(s)

Identifiers

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⟩

Share

Metrics

Record views

657

Files downloads

143