{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:10:03Z","timestamp":1737396603938,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744658"},{"type":"electronic","value":"9783540744665"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74466-5_24","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T14:54:32Z","timestamp":1188226472000},"page":"214-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Scheduling File Transfers for Data-Intensive Jobs on Heterogeneous Clusters"],"prefix":"10.1007","author":[{"given":"Gaurav","family":"Khanna","sequence":"first","affiliation":[]},{"given":"Umit","family":"Catalyurek","sequence":"additional","affiliation":[]},{"given":"Tahsin","family":"Kurc","sequence":"additional","affiliation":[]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[]},{"given":"Joel","family":"Saltz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Khanna, G., Vydyanathan, N., Kurc, T., Catalyurek, U., Wyckoff, P., Saltz, J., Sadayappan, P.: A hypergraph partitioning based approach for scheduling of tasks with batch-shared I\/O. In: Proc. of CCGrid 2005, vol.\u00a02, pp. 792\u2013799 (2005)","DOI":"10.1109\/CCGRID.2005.1558643"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations Research\u00a06, 419\u2013433 (1958)","journal-title":"Operations Research"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/978-3-540-74466-5_24"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-540-27866-5_32","volume-title":"Euro-Par 2004 Parallel Processing","author":"A. Giersch","year":"2004","unstructured":"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.\u00a03149, pp. 246\u2013253. Springer, Heidelberg (2004)"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/322003.322011","volume":"24","author":"O.H. Ibarra","year":"1977","unstructured":"Ibarra, O.H., Kim, C.E.: Heuristic algorithms for scheduling independent tasks on nonidentical processors. J. ACM\u00a024, 280\u2013289 (1977)","journal-title":"J. ACM"},{"key":"24_CR6","unstructured":"Allcock, W., Bresnahan, J., Kettimuthu, R., Link, M.: The globus striped gridftp framework and server. In: Proc. of SuperComputing 2005 (2005)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/321941.321942","volume":"23","author":"H.N. Gabow","year":"1976","unstructured":"Gabow, H.N.: An efficient implementation of edmonds\u2019 algorithm for maximum matching on graphs. J. ACM\u00a023, 221\u2013234 (1976)","journal-title":"J. ACM"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-49530-4_18","volume-title":"Languages, Compilers, and Run-Time Systems for Scalable Computers","author":"M. Uysal","year":"1998","unstructured":"Uysal, M., Kurc, T.M., Sussman, A., Saltz, J.: A performance prediction framework for data intensive applications on large scale parallel machines. In: O\u2019Hallaron, D.R. (ed.) LCR 1998. LNCS, vol.\u00a01511, pp. 243\u2013258. Springer, Heidelberg (1998)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M. Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program\u00a0104, 91\u2013104 (2005)","journal-title":"Math. Program"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/99.714603","volume":"5","author":"J. Czyzyk","year":"1998","unstructured":"Czyzyk, J., Mesnier, M.P., Mor\u00e9, J.J.: The neos server. IEEE Comput. Sci. Eng.\u00a05, 68\u201375 (1998)","journal-title":"IEEE Comput. Sci. Eng."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2007 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74466-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T17:37:33Z","timestamp":1737394653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74466-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540744658","9783540744665"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74466-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}