{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T21:40:02Z","timestamp":1741470002620,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642233999"},{"type":"electronic","value":"9783642234002"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23400-2_14","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T11:34:15Z","timestamp":1313580855000},"page":"142-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Backfilling with Guarantees Granted upon Job Submission"],"prefix":"10.1007","author":[{"given":"Alexander M.","family":"Lindsay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxwell","family":"Galloway-Carson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher R.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David P.","family":"Bunde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitus J.","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-36180-4_7","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"S.-H. Chiang","year":"2002","unstructured":"Chiang, S.-H., Arpaci-Dusseau, A., Vernon, M.K.: The impact of more accurate requested runtimes on production job scheduling performance. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol.\u00a02537, pp. 103\u2013127. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Das Sharma, D., Pradhan, D.K.: Job scheduing in mesh multicomputers. In: Proc. Intern. Conf. on Parallel Processing Workshops, pp. 251\u2013258 (1994)","key":"14_CR2","DOI":"10.1109\/ICPP.1994.119"},{"unstructured":"Feitelson, D.: The parallel workloads archive, http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/index.html","key":"14_CR3"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11407522_1","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"2005","unstructured":"Feitelson, D.G., Rudolph, L., Schwiegelshohn, U.: Parallel job scheduling \u2014 A status report. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol.\u00a03277, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-45540-X_6","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. Jackson","year":"2001","unstructured":"Jackson, D., Snell, Q., Clement, M.: Core algorithms of the maui scheduler. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol.\u00a02221, pp. 87\u2013102. Springer, Heidelberg (2001)"},{"doi-asserted-by":"crossref","unstructured":"Leung, V., Sabin, G., Sadayappan, P.: Parallel job scheduling policies to improve fairness - a case study. In: Proc. 6th Intern. Workshop on Scheduling and Resource Management for Parallel and Distributed Syst. (2010)","key":"14_CR6","DOI":"10.1109\/ICPPW.2010.48"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-60153-8_35","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. Lifka","year":"1995","unstructured":"Lifka, D.: The ANL\/IBM SP scheduling system. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949, pp. 295\u2013303. Springer, Heidelberg (1995)"},{"issue":"6","key":"14_CR8","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"A.W. Mu\u2019alem","year":"2001","unstructured":"Mu\u2019alem, A.W., Feitelson, D.G.: Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Trans. on Parallel and Distributed Syst.\u00a012(6), 529\u2013543 (2001)","journal-title":"IEEE Trans. on Parallel and Distributed Syst."},{"doi-asserted-by":"crossref","unstructured":"Perkovi\u0107, D., Keleher, P.J.: Randomization, speculation, and adaptation in batch schedulers. In: Proc. 2000 ACM\/IEEE Conf. on Supercomputing (2000)","key":"14_CR9","DOI":"10.1109\/SC.2000.10041"},{"unstructured":"Schwiegelshohn, U., Yahyapour, R.: Analysis of first-come-first-serve parallel job scheduling. In: Proc. 9th ACM\/SIAM Symp. on Discrete Algorithms, pp. 629\u2013638 (1998)","key":"14_CR10"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/10968987_12","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"E. Shmueli","year":"2003","unstructured":"Shmueli, E., Feitelson, D.G.: Backfilling with lookahead to optimize the performance of parallel job scheduling. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol.\u00a02862, pp. 228\u2013251. Springer, Heidelberg (2003)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-47954-6_11","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"W. Smith","year":"1999","unstructured":"Smith, W., Taylor, V., Foster, I.: Using run-time predictions to estimate queue wait times and improve scheduler performance. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1999, IPPS-WS 1999, and SPDP-WS 1999. LNCS, vol.\u00a01659, pp. 202\u2013219. Springer, Heidelberg (1999)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-36180-4_4","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"S. Srinivasan","year":"2002","unstructured":"Srinivasan, S., Kettimuthu, R., Subramani, V., Sadayappan, P.: Selective reservation strategies for backfill job scheduling. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol.\u00a02537, pp. 55\u201371. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Talby, D., Feitelson, D.G.: Supporting priorities and improving utilization of the IBM SP scheduler using slack-based backfilling. In: Proc. 13th Intern. Parallel Processing Symp., pp. 513\u2013517 (1999)","key":"14_CR14","DOI":"10.1109\/IPPS.1999.760525"},{"issue":"6","key":"14_CR15","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1109\/TPDS.2007.70606","volume":"18","author":"D. Tsafrir","year":"2007","unstructured":"Tsafrir, D., Etsion, Y., Feitelson, D.G.: Backfilling using system-generated predictions rather than user runtime estimates. IEEE Trans. on Parallel and Distributed Systems\u00a018(6), 789\u2013803 (2007)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"doi-asserted-by":"crossref","unstructured":"Tsafrir, D., Feitelson, D.G.: The dynamics of backfilling: Solving the mystery of why increased inaccuracy may help. In: Proc. IEEE Intern. Symp. on Workload Characterization, pp. 131\u2013141 (2006)","key":"14_CR16","DOI":"10.1109\/IISWC.2006.302737"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2011 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23400-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T21:00:14Z","timestamp":1741467614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23400-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642233999","9783642234002"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23400-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}