On the Approximability of Related Machine Scheduling Under Arbitrary Precedence

Abstract

Distributed computing systems often need to consider the scheduling problem involving a collection of highly dependent data-processing tasks that must work in concert to achieve mission-critical objectives. This paper considers the unrelated machine scheduling problem for minimizing weighted sum completion time under arbitrary precedence constraints and on heterogeneous machines with different processing speeds. The problem is known to be strongly NP-hard even in the single machine setting. By making use of Queyranne’s constraint set and constructing a novel Linear Programming relaxation for the scheduling problem under arbitrary precedence constraints, our results in this paper advance the state of the art. We develop a 2(1 + ( ${m}$ –1)/ ${D}$ )-approximation algorithm (and 2(1 + ( ${m}$ –1)/ ${D}$ ) + 1-approximation) for the scheduling problem with zero release time (and arbitrary release time), where ${m}$ is the number of servers and ${D}$ is the task-skewness product. The algorithm can be efficiently computed in polynomial time using the Ellipsoid method and achieves nearly optimal performance in practice as ${D} > {O}$ ( ${m}$ ) when the number of tasks per job to schedule is sufficiently larger than the number of machines available. Our implementation and evaluation using a heterogeneous testbed and real-world benchmarks confirms significant improvement in weighted sum completion time for dependent computing tasks.