cea-03578940
https://cea.hal.science/cea-03578940
https://cea.hal.science/cea-03578940/document
https://cea.hal.science/cea-03578940/file/main.pdf
[CEA] CEA - Commissariat à l'énergie atomique
[UNIV-EVRY] Université d'Evry-Val d'Essonne
[IBISC] Informatique, Biologie Intégrative et Systèmes Complexes
[DAM] Direction des applications militaires
[CEA-UPSAY] CEA - Université Paris-Saclay
[UNIV-PARIS-SACLAY] Université Paris-Saclay
[UNIV-EVRY-SACLAY] UNIV-EVRY-SACLAY
[UNIVERSITE-PARIS-SACLAY] Université Paris-Saclay
[GS-ENGINEERING] Graduate School Sciences de l'Ingénierie et des Systèmes
[GS-COMPUTER-SCIENCE] Graduate School Computer Science
[GS-LIFE-SCIENCES-HEALTH] Graduate School Life Sciences and Health
A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-width
Angel, Eric
Morais, Sébastien
Regnault, Damien
[INFO] Computer Science [cs]
UNDEFINED
In this paper we study a scheduling problem arising from executing numerical simulations on HPC architectures. With a constant number of parallel machines, the objective is to minimize the makespan under memory constraints for the machines. Those constraints come from a neighborhood graph G for the jobs. Motivated by a previous result on graphs G with bounded path-width, our focus is on the case when the neighborhood graph G has bounded tree-width. Our result is a bi-criteria fully polynomial time approximation algorithm based on a dynamic programming algorithm. It allows to find a solution within a factor of 1 + of the optimal makespan, where the memory capacity of the machines may be exceeded by a factor at most 1 + . This result relies on the use of a nice tree decomposition of G and its traversal in a specific way which may be useful on its own. The case of unrelated machines is also tractable with minor modifications.
2022
2022-02-17
en