Heuristic Algorithms for MapReduce Scheduling Problem with Open-Map Task and Series-Reduce Tasks

الملخص EN

Based on the classical MapReduce concept, we propose an extended MapReduce scheduling model.

In the extended MapReduce scheduling problem, we assumed that each job contains an open-map task (the map task can be divided into multiple unparallel operations) and series-reduce tasks (each reduce task consists of only one operation).

Different from the classical MapReduce scheduling problem, we also assume that all the operations cannot be processed in parallel, and the machine settings are unrelated machines.

For solving the extended MapReduce scheduling problem, we establish a mixed-integer programming model with the minimum makespan as the objective function.

We then propose a genetic algorithm, a simulated annealing algorithm, and an L-F algorithm to solve this problem.

Numerical experiments show that L-F algorithm has better performance in solving this problem.