메뉴 건너뛰기




Volumn 4641 LNCS, Issue , 2007, Pages 214-223

Scheduling file transfers for data-intensive jobs on heterogeneous clusters

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; DATA STORAGE EQUIPMENT; GRAPH THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING;

EID: 38049168793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74466-5_24     Document Type: Conference Paper
Times cited : (5)

References (10)
  • 2
    • 0001424107 scopus 로고
    • Constructing maximal dynamic flows from static flows
    • Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations Research 6, 419-433 (1958)
    • (1958) Operations Research , vol.6 , pp. 419-433
    • Ford, L.R.1    Fulkerson, D.R.2
  • 3
    • 38049122774 scopus 로고    scopus 로고
    • Scheduling file transfers for data-intensive jobs on heterogeneous clusters
    • Technical Report OSU-CISRC-1/07-TR05, CSE Dept, The Ohio State University
    • Khanna, G., Catalyurek, U., Kurc, T., Sadayappan, P., Saltz, J.: Scheduling file transfers for data-intensive jobs on heterogeneous clusters. Technical Report OSU-CISRC-1/07-TR05, CSE Dept, The Ohio State University (2007)
    • (2007)
    • Khanna, G.1    Catalyurek, U.2    Kurc, T.3    Sadayappan, P.4    Saltz, J.5
  • 4
    • 33845288098 scopus 로고    scopus 로고
    • Giersch, A., Robert, Y., Vivien, F.: Scheduling tasks sharing files from distributed repositories. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, 3149, pp. 246-253. Springer, Heidelberg (2004)
    • Giersch, A., Robert, Y., Vivien, F.: Scheduling tasks sharing files from distributed repositories. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, vol. 3149, pp. 246-253. Springer, Heidelberg (2004)
  • 5
    • 0000769475 scopus 로고
    • Heuristic algorithms for scheduling independent tasks on nonidentical processors
    • Ibarra, O.H., Kim, C.E.: Heuristic algorithms for scheduling independent tasks on nonidentical processors. J. ACM 24, 280-289 (1977)
    • (1977) J. ACM , vol.24 , pp. 280-289
    • Ibarra, O.H.1    Kim, C.E.2
  • 7
    • 0016943409 scopus 로고
    • An efficient implementation of edmonds' algorithm for maximum matching on graphs
    • Gabow, H.N.: An efficient implementation of edmonds' algorithm for maximum matching on graphs. J. ACM 23, 221-234 (1976)
    • (1976) J. ACM , vol.23 , pp. 221-234
    • Gabow, H.N.1
  • 8
    • 84886624520 scopus 로고    scopus 로고
    • Uysal, M., Kurc, T.M., Sussman, A., Saltz, J.: A performance prediction framework for data intensive applications on large scale parallel machines. In: O'Hallaron, D.R. (ed.) LCR 1998. LNCS, 1511, pp. 243-258. Springer, Heidelberg (1998)
    • Uysal, M., Kurc, T.M., Sussman, A., Saltz, J.: A performance prediction framework for data intensive applications on large scale parallel machines. In: O'Hallaron, D.R. (ed.) LCR 1998. LNCS, vol. 1511, pp. 243-258. Springer, Heidelberg (1998)


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