Online Scheduling of Moldable Task Graphs under Common Speedup Models - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Online Scheduling of Moldable Task Graphs under Common Speedup Models

Résumé

The problem of scheduling moldable tasks has been widely studied, in particular when tasks have dependencies (i.e., task graphs), or when tasks are released on-the-fly (i.e., online). However, few study has focused on both (i.e., online scheduling of moldable task graphs). In this paper, we derive constant competitive ratios for this problem under several common yet realistic speedup models for the tasks (roofline, communication, Amdahl, and a combination of them). We also provide the first lower bound on the competitive ratio of any deterministic online algorithm for arbitrary speedup model, which is not constant but depends on the number of tasks in the longest path of the graph.
Fichier principal
Vignette du fichier
moldable_online_new.pdf (326.4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03778405 , version 1 (15-09-2022)

Licence

Paternité

Identifiants

Citer

Anne Benoit, Lucas Perotin, Yves Robert, Hongyang Sun. Online Scheduling of Moldable Task Graphs under Common Speedup Models. ICPP 2022 - 51st International Conference on Parallel Processing, Aug 2022, Bordeaux, France. pp.1-11, ⟨10.1145/3545008.3545049⟩. ⟨hal-03778405⟩
75 Consultations
111 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More