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

TL;DR

This paper presents a bi-criteria FPTAS for scheduling on a fixed number of machines with memory constraints modeled by a bounded tree-width graph, achieving near-optimal makespan with controlled memory violation.

Contribution

It introduces a novel bi-criteria FPTAS for scheduling with memory constraints on graphs of bounded tree-width, extending previous work on path-width.

Findings

Achieves a (1+epsilon)-approximate solution for makespan

Allows memory capacity to be exceeded by at most (1+epsilon)

Applicable to unrelated machines with minor modifications

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 + 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.