Malleable scheduling beyond identical machines

by   Dimitris Fotakis, et al.

In malleable job scheduling, jobs can be executed simultaneously on multiple machines with the processing time depending on the number of allocated machines. Jobs are required to be executed non-preemptively and in unison, in the sense that they occupy, during their execution, the same time interval over all the machines of the allocated set. In this work, we study generalizations of malleable job scheduling inspired by standard scheduling on unrelated machines. Specifically, we introduce a general model of malleable job scheduling, where each machine has a (possibly different) speed for each job, and the processing time of a job j on a set of allocated machines S depends on the total speed of S for j. For machines with unrelated speeds, we show that the optimal makespan cannot be approximated within a factor less than e/e-1, unless P = NP. On the positive side, we present polynomial-time algorithms with approximation ratios 2e/e-1 for machines with unrelated speeds, 3 for machines with uniform speeds, and 7/3 for restricted assignments on identical machines. Our algorithms are based on deterministic LP rounding and result in sparse schedules, in the sense that each machine shares at most one job with other machines. We also prove lower bounds on the integrality gap of 1+φ for unrelated speeds (φ is the golden ratio) and 2 for uniform speeds and restricted assignments. To indicate the generality of our approach, we show that it also yields constant factor approximation algorithms (i) for minimizing the sum of weighted completion times; and (ii) a variant where we determine the effective speed of a set of allocated machines based on the L_p norm of their speeds.



There are no comments yet.


page 1

page 2

page 3

page 4


Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds

Malleable scheduling is a model that captures the possibility of paralle...

Bag-of-Tasks Scheduling on Related Machines

We consider online scheduling to minimize weighted completion time on re...

A Constant-Factor Approximation for Generalized Malleable Scheduling under M^♮-Concave Processing Speeds

In generalized malleable scheduling, jobs can be allocated and processed...

High Multiplicity Scheduling on Uniform Machines in FPT-Time

In high-multiplicity scheduling, jobs of the same size are encoded in an...

Geometry of Scheduling on Multiple Machines

We consider the following general scheduling problem: there are m identi...

Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines

The task of scheduling jobs to machines while minimizing the total makes...

Scheduling with Speed Predictions

Algorithms with predictions is a recent framework that has been used to ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.