On scheduling in map-reduce and flow-shops

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2011, Pages 289-298

  Moseley, Benjamin ^a   Dasgupta, Anirban ^b   Kumar, Ravi ^b   Sarlós, Tamás ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

algorithm analysis; approximation algorithms; flow shops; map reduce; on line problems; scheduling and resource allocation

Indexed keywords

ALGORITHM ANALYSIS; COMPETITIVE ALGORITHMS; DYNAMIC PROGRAMS; FIXED NUMBERS; FLEXIBLE FLOW SHOP; FLOW SHOP PROBLEMS; FLOW-SHOPS; FLOW-TIME; IF THERE ARE; JOB SCHEDULING; MAP-REDUCE; OFFLINE; ONLINE PROBLEMS; PROCESSING TIME; TOTAL FLOWTIME; TWO STAGE; UNRELATED MACHINES;

COMPUTER RESOURCE MANAGEMENT; DATA FLOW ANALYSIS; MACHINE SHOP PRACTICE; NETWORK ARCHITECTURE;

APPROXIMATION ALGORITHMS;

EID: 79959755780     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989493.1989540     Document Type: Conference Paper

References (35)

1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, and C. Stein. Approximation schemes for minimizing average weighted completion time with release dates. In Proc. 40th FOCS, pages 32-44, 1999.
2. N. Avrahami and Y. Azar. Minimizing total flow time and total completion time with immediate dispatching. Algorithmica, 47(3):253-268, 2007. (Pubitemid 46407938) (Pubitemid 46407938)
3. N. Bansal, R. Krishnaswamy, and V. Nagarajan. Better scalable algorithms for broadcast scheduling. In Proc. 37th ICALP, pages 324-335, 2010.
4. J. S. Chadha, N. Garg, A. Kumar, and V. N. Muralidhara. A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation. In Proc. 41st STOC, pages 679-684, 2009.
5. C. Chekuri, A. Goel, S. Khanna, and A. Kumar. Multi-processor scheduling to minimize flow time with epsilon resource augmentation. In Proc. 36th STOC, pages 363-372, 2004.
6. C. Chekuri and B. Moseley. Online scheduling to minimize the maximum delay factor. In Proc. 19th SODA, pages 1116-1125, 2009.
7. F. Chierichetti, R. Kumar, and A. Tomkins. Max-cover in map-reduce. In Proc. 19th WWW, pages 231-240, 2010.
8. C.-T. Chu, S. K. Kim, Y.-A. Lin, Y. Yu, G. R. Bradski, A. Y. Ng, and K. Olukotun. Map-reduce for machine learning on multicore. In Proc. 20th NIPS, pages 281-288, 2006.
9. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. C. ACM, 51:107-113, 2008.
10. J. Feldman, S. Muthukrishnan, A. Sidiropoulos, C. Stein, and Z. Svitkina. On distributing symmetric streaming computations. In Proc. 19th SODA, pages 710-719, 2008.
11. M. J. Fischer, X. Su, and Y. Yin. Assigning tasks for efficiency in hadoop: Extended abstract. In Proc. 22nd SPAA, pages 30-39, 2010.
12. A. Ganapathi, Y. Chen, A. Fox, R. Katz, and D. Patterson. Statistics-driven workload modeling for the Cloud. In Proc. Data Engineering Workshops at 26th ICDE, pages 87-92, 2010.
13. M. R. D. Garey, D. S. Johnson, and R. Sethi. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1:1171-129, 1976.
14. N. Garg and A. Kumar. Minimizing average flow-time : Upper and lower bounds. In FOCS, pages 603-613, 2007.
15. N. Garg, A. Kumar, and V. N. Muralidhara. Minimizing total flow-time: The unrelated case. In Proc. 19th ISAAC, pages 424-435, 2008.
16. L. A. Hall. Approximability of flow shop scheduling. In Proc. 36th FOCS, pages 82-91, 1995.
17. C. Hepner and C. Stein. Implementation of a PTAS for scheduling with release dates. Algorithm Engineering and Experimentation, pages 202-215, 2001.
18. k-norms of weighted flow time on unrelated machines. In Proc. 21st SODA, pages 95-108, 2011.
19. M. Isard, V. Prabhakaran, J. Currey, U. Wieder, K. Talwar, and A. Goldberg. Quincy: Fair scheduling for distributed computing clusters. In Proc. 22nd SOSP, pages 261-276, 2009.
20. S. M. Johnson. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1:69-81, 1954.
21. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. J. ACM, 47(4):617-643, 2000.
22. U. Kang, C. E. Tsourakakis, A. Appel, C. Faloutsos, and J. Leskovec. HADI: Fast diameter estimation and mining in massive graphs with Hadoop. Technical Report CMU-ML-08-117, CMU, 2008.
23. D. Karger, C. Stein, and J. Wein. Scheduling algorithms. In M. Atallah, editor, Handbook on Algorithms and Theory of Computation, chapter 34. Chapman and Hall/CRC, 1999.
24. H. Karloff, S. Suri, and S. Vassilvitskii. A model of computation for MapReduce. In Proc. 20th SODA, pages 938-948, 2010.
25. S. Leonardi and D. Raz. Approximating total flow time on parallel machines. JCSS, 73(6):875-891, 2007. (Pubitemid 46907088) (Pubitemid 46907088)
26. J. Lin and C. Dyer. Data-Intensive Text Processing with MapReduce. Number 7 in Synthesis Lectures on Human Language Technologies. Morgan and Claypool, 2010.
27. K. Pruhs, J. Sgall, and E. Torng. Handbook of Scheduling: Algorithms, Models, and Performance Analysis, chapter Online Scheduling. CRC Press, 2004.
28. T. Sandholm and K. Lai. MapReduce optimization using regulated dynamic prioritization. In Proc. 11th SIGMETRICS, pages 299-310, 2009.
29. P. Schuurman and G. J. Woeginger. Flowshop and jobshop schedules: Complexity and approximation. Operations Research, 26:136-152, 1978.
30. P. Schuurman and G. J. Woeginger. Polynomial time approximation algorithms for machine scheduling: ten open problems. Journal of Scheduling, 2(5):203-213, 1999. (Pubitemid 129633863) (Pubitemid 129633863)
31. P. Schuurman and G. J. Woeginger. A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. TCS, 237(1-2):105-122, 2000.
32. M. Skutella. Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM, 48(2):206-242, 2001.
33. J. L. Wolf, D. Rajan, K. Hildrum, R. Khandekar, V. Kumar, S. Parekh, K.-L. Wu, and A. Balmin. FLEX: A slot allocation scheduling optimizer for MapReduce workloads. In Middleware, pages 1-20, 2010.
34. M. Zaharia, D. Borthakur, J. Sen Sarma, K. Elmeleegy, S. Shenker, and I. Stoica. Delay scheduling: A simple technique for achieving locality and fairness in cluster scheduling. In Proc. 5th EuroSys, pages 265-278, 2010.
35. M. Zaharia, A. Konwinski, A. Joseph, R. Katz, and I. Stoica. Improving MapReduce performance in heterogeneous environments. In Proc. USENIX OSDI, 2008.