• We propose models to simultaneously schedule map and reduce tasks in a MapReduce job. • Our models exploit the pattern of the relations between mappers and reducers. • A two-constraint formulation balances processors' loads in both map and reduce phases. • Our models improve the parallel runtimes of two key operations within the MapReduce.  a r t i c l e i n f o Task scheduling for MapReduce jobs has been an active area of research with the objective of decreasing the amount of data transferred during the shuffle phase via exploiting data locality. In the literature, generally only the scheduling of reduce tasks is considered with the assumption that scheduling of map tasks is already determined by the input data placement. However, in cloud or HPC deployments of MapReduce, the input data is located in a remote storage and scheduling map tasks gains importance. Here, we propose models for simultaneous scheduling of map and reduce tasks in order to improve data locality and balance the processors' loads in both map and reduce phases. Our approach is based on graph and hypergraph models which correctly encode the interactions between map and reduce tasks. Partitions produced by these models are decoded to schedule map and reduce tasks. A two-constraint formulation utilized in these models enables balancing processors' loads in both map and reduce phases. The partitioning objective in the hypergraph models correctly encapsulates the minimization of data transfer when a local combine step is performed prior to shuffle, whereas the partitioning objective in the graph models achieve the same feat when a local combine is not performed. We show the validity of our scheduling on the MapReduce parallelizations of two important kernel operations -sparse matrixvector multiplication (SpMV) and generalized sparse matrix-matrix multiplication (SpGEMM) -that are widely encountered in big data analytics and scientific computations. Compared to random scheduling, our models lead to tremendous savings in data transfer by reducing data traffic from several hundreds of megabytes to just a few megabytes in the shuffle phase and consequently leading up to 2.6x and 4.2x speedup for SpMV and SpGEMM, respectively.
As an instance, an offline scheduling algorithm based on graph models was proposed by Selvitopi et al. REF , which correctly encodes the interactions between map and reduce tasks.
Locality-aware and load-balanced static task scheduling for MapReduce
Future Gener. Comput. Syst.
Future Gener. Comput. Syst.
Computer Science