메뉴 건너뛰기




Volumn , Issue , 2012, Pages

Predicting execution bottlenecks in map-reduce clusters

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE;

EID: 84906706410     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (37)

References (9)
  • 2
    • 37549003336 scopus 로고    scopus 로고
    • MapReduce: Simplified data processing on large clusters
    • Jan
    • J. Dean and S. Ghemawat. Mapreduce: simplified data processing on large clusters. Commun. ACM, 51:107-113, Jan. 2008.
    • (2008) Commun. ACM , vol.51 , pp. 107-113
    • Dean, J.1    Ghemawat, S.2
  • 3
    • 0035470889 scopus 로고    scopus 로고
    • Greedy function approximation: A gradient boosting machine
    • J. H. Friedman. Greedy function approximation: A gradient boosting machine. The Annals of Statistics, 29:1189-1232, 2001.
    • (2001) The Annals of Statistics , vol.29 , pp. 1189-1232
    • Friedman, J.H.1
  • 7
    • 77954636142 scopus 로고    scopus 로고
    • Delay scheduling: A simple technique for achieving locality and fairness in cluster scheduling
    • 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, 2010.
    • (2010) Eurosys
    • Zaharia, M.1    Borthakur, D.2    Sarma, J.S.3    Elmeleegy, K.4    Shenker, S.5    Stoica, I.6
  • 9
    • 84890471680 scopus 로고    scopus 로고
    • Characterizing task usage shapes in google compute clusters
    • Q. Zhang, J. Hellerstein, and R. Boutaba. Characterizing task usage shapes in google compute clusters. In LADIS, 2011.
    • (2011) LADIS
    • Zhang, Q.1    Hellerstein, J.2    Boutaba, R.3


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