On Minimizing the Makespan of a Set of Offline MapReduce Jobs

Abstract

There are quite a few algorithms on minimizing the makespan of a set of offline MapReduce jobs. However, these algorithms are heuristic or suboptimal. The best-known algorithm for minimizing the makespan is 3-approximation by applying Johnson model. In this paper, we evaluate three algorithms in terms of approximation, computational complexity, stability and optimal configuration of the underline cluster for the first time.