Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9125)


We propose a constant approximation algorithm for generalizations of the Flexible Flow Shop (FFS) problem which form a realistic model for non-preemptive scheduling in MapReduce systems. Our results concern the minimization of the total weighted completion time of a set of MapReduce jobs on unrelated processors and improve substantially on the model proposed by Moseley et al. (SPAA 2011) in two directions: (i) we consider jobs consisting of multiple Map and Reduce tasks, which is the key idea behind MapReduce computations, and (ii) we introduce into our model the crucial cost of the data shuffle phase, i.e., the cost for the transmission of intermediate data from Map to Reduce tasks. Moreover, we experimentally evaluate our algorithm compared with a lower bound on the optimal cost of our problem as well as with a fast algorithm, which combines a simple online assignment of tasks to processors with a standard scheduling policy. As we observe, for random instances that capture data locality issues, our algorithm achieves a better performance.


Completion Time Precedence Constraint Total Weighted Completion Time Reduce Task Flexible Flow Shop 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Afrati, F.N., Ullman, J.D.: Optimizing multiway joins in a map-reduce environment. IEEE Transactions on Knowledge and Data Engineering 23(9), 1282–1298 (2011)CrossRefGoogle Scholar
  2. 2.
    Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line Routing of Virtual Circuits with Applications to Load Balancing and Machine Scheduling. Journal of the ACM 44(3), 486–504 (1997)zbMATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Chang, H., Kodialam, M.S., Kompella, R.R., Lakshman, T.V., Lee, M., Mukherjee, S.: Scheduling in mapreduce-like systems for fast completion time. In: IEEE Proceedings of the 30th International Conference on Computer Communications, pp. 3074–3082 (2011)Google Scholar
  4. 4.
    Chen, F., Kodialam, M.S., Lakshman, T.V.: Joint scheduling of processing and shuffle phases in mapreduce systems. In: IEEE Proceedings of the 31st International Conference on Computer Communications, pp. 1143–1151 (2012)Google Scholar
  5. 5.
    Correa, J.R., Skutella, M., Verschae, J.: The power of preemption on unrelated machines and applications to scheduling orders. Mathematics of Operations Research 37(2), 379–398 (2012)zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. In: Proceedings of the 6th Symposium on Operating System Design and Implementation, pp. 137–150 (2004)Google Scholar
  7. 7.
    Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1(2), 117–129 (1976)zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Gonzalez, T., Sahni, S.: Flowshop and jobshop schedules: complexity and approximation. Operations research 26(1), 36–52 (1978)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Mathematics of Operations Research 22, 513–544 (1997)zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Hariri, A.M., Potts, C.N.: Heuristics for scheduling unrelated parallel machines. Computers and Operations Research 18(3), 323–331 (1991)zbMATHCrossRefGoogle Scholar
  11. 11.
    Mastrolilli, M., Queyranne, M., Schulz, A.S., Svensson, O., Uhan, N.A.: Minimizing the sum of weighted completion times in a concurrent open shop. Operations Research Letters 38(5), 390–395 (2010)zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Moseley, B., Dasgupta, A., Kumar, R., Sarlós, T.: On scheduling in map-reduce and flow-shops. In: Proc. of the 23rd ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 289–298 (2011)Google Scholar
  13. 13.
    Schuurman, P., Woeginger, G.J.: A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theoretical Computer Science 237(1), 105–122 (2000)zbMATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    Shmoys, D.B., Tardos, É.: An approximation algorithm for the generalized assignment problem. Mathematical Programming 62, 461–474 (1993)zbMATHMathSciNetCrossRefGoogle Scholar
  15. 15.
    Yoo, D.-J., Sim, K.M.: A comparative review of job scheduling for mapreduce. In: IEEE Proc. of the International Symposium on Cloud Computing and Intelligece Systems, pp. 353–358 (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.School of Electrical and Computer EngineeringNational Technical University of AthensAthensGreece
  2. 2.Department of InformaticsAthens University of Economics and BusinessAthensGreece
  3. 3.CSAILMassachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations