DeepAI AI Chat
Log In Sign Up

A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-width

by   Eric Angel, et al.
Université d'Évry Val d'Essonne

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 + epsilon of the optimal makespan, where the memory capacity of the machines may be exceeded by a factor at most 1 + epsilon. 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.


page 1

page 2

page 3

page 4


Non-branching tree-decompositions

We prove that if a graph has a tree-decomposition of width at most w, th...

The Neighborhood Polynomial of Chordal Graphs

The neighborhood polynomial of a graph G is the generating function of s...

Tree pivot-minors and linear rank-width

Tree-width and its linear variant path-width play a central role for the...

A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond

Short spanning trees subject to additional constraints are important bui...

Task scheduling for block-type conflict graphs

In this paper, we consider the scheduling of jobs on parallel machines, ...

Multitasking Scheduling with Shared Processing

Recently, the problem of multitasking scheduling has attracted a lot of ...