Scheduling in mapreduce-like systems for fast completion time

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 3074-3082

  Chang, Hyunseok ^a   Kodialam, Murali ^a   Kompella, Ramana Rao ^b   Lakshman, T V ^a   Lee, Myungjin ^b   Mukherjee, Sarit ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETION TIME; DATA CENTERS; DISTRIBUTED AND PARALLEL COMPUTING; JOB COMPLETION; MAP-REDUCE; NP-HARD; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; OPTIMAL SOLUTIONS; PROCESSING NEEDS; PROGRAMMING MODELS; SCHEDULING PROBLEM; SCHEDULING STRATEGIES;

APPROXIMATION ALGORITHMS; COMPUTER PROGRAMMING; DATA HANDLING; DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS;

SCHEDULING ALGORITHMS;

EID: 79960851571     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5935152     Document Type: Conference Paper

References (14)

1. J. Dean and S. Ghemawat, "MapReduce: Simplified Data Processing on Large Clusters," in USENIX OSDI, 2004.
2. M. Isard, V. Prabhakaran, J. Currey, U. Wieder, K. Talwar, and A. Goldberg, "Quincy: Fair Scheduling for Distributed Computing Clusters," in SOSP, 2009.
3. M. Zaharia, D. Borthakur, J. S. Sarma, K. Elmeleegy, S. Shenker, and I. Stoica, "Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling," in EuroSys '10: Proceedings of the 5th European conference on Computer systems, 2010, pp. 265-278.
4. G. Ananthanarayanan, S. Kandula, A. Greenberg, I. Stoica, Y. Lu, B. Saha, and E. Harris, "Reining in the outliers in map-reduce clusters using mantri," in USENIX OSDI, 2010.
5. M. Queyranne, "Structure of a simple scheduling polyhedron," Mathe-matical Programming, vol. 58, no. 2, pp. 263-285, 1993.
6. A. S. Schulz, "Scheduling to minimize total weighted completion time: Performance guarantees of lp-based heuristics and lower bounds," 1995.
7. N. Garg and J. Knemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," in In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998, pp. 300-309.
8. B. W. Lampson, "A scheduling philosophy for multiprocessing systems," Communications of the ACM, vol. 11, pp. 347-360, 1968.
9. M. Harchol-Balter, "Task assignment with unknown duration," Journal of the ACM, vol. 49, no. 2, pp. 260-288, 2002.
10. M. E. Crovella, M. Harchol-Balter, and C. D. Murta, "Task assignment in a distributed system (extended abstract): improving performance by unbalancing load," in SIGMETRICS '98, 1998, pp. 268-269.
11. M. Zaharia, A. Konwinski, A. D. Joseph, R. H. Katz, and I. Stoica, "Improving mapreduce performance in heterogeneous environments," in USENIX OSDI, 2008.
12. T. Sandholm and K. Lai, "Mapreduce optimization using regulated dynamic prioritization," in SIGMETRICS '09, 2009.
13. M. X. Goemans, "Improved approximation algorthims for scheduling with release dates," in SODA '97: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, 1997, pp. 591-598.
14. E. J. Anderson and C. N. Potts, "On-line scheduling of a single machine to minimize total weighted completion time," in SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, 2002, pp. 548-557.