A Bi-criteria FPTAS for scheduling with memory constraints on graphs with bounded tree-width - Archive ouverte HAL Access content directly
Conference Papers Year : 2022

A Bi-criteria FPTAS for scheduling with memory constraints on graphs with bounded tree-width

(1) , (2, 3) , (1)
1
2
3

Abstract

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.
Not file

Dates and versions

hal-03762328 , version 1 (27-08-2022)

Identifiers

Cite

Eric Angel, Sébastien Morais, Damien Regnault. A Bi-criteria FPTAS for scheduling with memory constraints on graphs with bounded tree-width. 28th International Conference on Parallel and Distributed Computing(Euro-Par 2022), Aug 2022, Glasgow, United Kingdom. pp.136--151, ⟨10.1007/978-3-031-12597-3_9⟩. ⟨hal-03762328⟩
26 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More