메뉴 건너뛰기




Volumn , Issue , 2012, Pages 11-18

Two sides of a coin: Optimizing the schedule of mapreduce jobs to minimize their makespan and improve cluster performance

Author keywords

batch workloads; Hadoop; MapReduce; minimized makespan; optimized schedule

Indexed keywords

BATCH WORKLOADS; HADOOP; MAKESPAN; MAP-REDUCE; OPTIMIZED SCHEDULE;

EID: 84868221206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASCOTS.2012.12     Document Type: Conference Paper
Times cited : (78)

References (17)
  • 2
    • 0003075019 scopus 로고
    • Optimal Two- and Three-Stage Production Schedules with Setup Times Included
    • S. Johnson, "Optimal Two- and Three-Stage Production Schedules with Setup Times Included," Naval Res. Log. Quart., 1954.
    • (1954) Naval Res. Log. Quart.
    • Johnson, S.1
  • 3
    • 79960196705 scopus 로고    scopus 로고
    • ARIA: Automatic Resource Inference and Allocation for MapReduce Environments
    • A. Verma, L. Cherkasova, and R. H. Campbell, "ARIA: Automatic Resource Inference and Allocation for MapReduce Environments," in Proc. of ICAC,, 2011.
    • Proc. of ICAC, 2011
    • Verma, A.1    Cherkasova, L.2    Campbell, R.H.3
  • 6
    • 79955917314 scopus 로고    scopus 로고
    • [Online]. Available
    • "Capacity Scheduler Guide." [Online]. Available: http://hadoop.apache.org/common/docs/r0.20.1/capacity-scheduler.html
    • Capacity Scheduler Guide
  • 9
    • 0000269759 scopus 로고    scopus 로고
    • Scheduling multithreaded computations by work stealing
    • R. Blumofe and C. Leiserson, "Scheduling multithreaded computations by work stealing," Journal of the ACM (JACM), vol. 46, no. 5, pp. 720-748, 1999.
    • (1999) Journal of the ACM (JACM) , vol.46 , Issue.5 , pp. 720-748
    • Blumofe, R.1    Leiserson, C.2
  • 10
    • 84958764503 scopus 로고    scopus 로고
    • An efficient approximation algorithm for minimizing makespan on uniformly related machines
    • C. Chekuri and M. Bender, "An efficient approximation algorithm for minimizing makespan on uniformly related machines," Integer Programming and Combinatorial Optimization, pp. 383-393, 1998.
    • (1998) Integer Programming and Combinatorial Optimization , pp. 383-393
    • Chekuri, C.1    Bender, M.2
  • 11
    • 84914826148 scopus 로고
    • A scheduling philosophy for multiprocessing systems
    • B. Lampson, "A scheduling philosophy for multiprocessing systems," Communications of the ACM, vol. 11, no. 5, 1968.
    • (1968) Communications of the ACM , vol.11 , Issue.5
    • Lampson, B.1
  • 16
    • 82155174846 scopus 로고    scopus 로고
    • Profiling, What-if Analysis, and Costbased Optimization of MapReduce Programs
    • H. Herodotou and S. Babu, "Profiling, What-if Analysis, and Costbased Optimization of MapReduce Programs." in Proc. of the VLDB Endowment, Vol. 4, No. 11, 2011.
    • (2011) Proc. of the VLDB Endowment , vol.4 , Issue.11
    • Herodotou, H.1    Babu, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.