{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T17:10:03Z","timestamp":1739380203995,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046322"},{"type":"electronic","value":"9783642046339"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04633-9_7","type":"book-chapter","created":{"date-parts":[[2009,10,7]],"date-time":"2009-10-07T13:57:15Z","timestamp":1254923835000},"page":"116-137","source":"Crossref","is-referenced-by-count":6,"title":["Scheduling Restartable Jobs with Short Test Runs"],"prefix":"10.1007","author":[{"given":"Ojaswirajanya","family":"Thebe","sequence":"first","affiliation":[]},{"given":"David P.","family":"Bunde","sequence":"additional","affiliation":[]},{"given":"Vitus J.","family":"Leung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Job Scheduling Strategies for Parallel Processing","year":"1997","unstructured":"Feitelson, D.G., Rudolph, L. (eds.): IPPS-WS 1997 and JSSPP 1997. LNCS, vol.\u00a01291. Springer, Heidelberg (1997)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Job Scheduling Strategies for Parallel Processing","year":"2002","unstructured":"Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.): JSSPP 2002. LNCS, vol.\u00a02537. Springer, Heidelberg (2002)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Chiang, S.-H., Arpaci-Dusseau, A., Vernon, M.K.: The impact of more accurate requested runtimes on production job scheduling performance. In: Proc. 8th Workshop on Job Scheduling Strategies for Parallel Processing, [2], pp. 103\u2013127","DOI":"10.1007\/3-540-36180-4_7"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Chiang, S.-H., Mansharamani, R., Vernon, M.: Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies. In: Proc. ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, pp. 33\u201344 (1994)","DOI":"10.1145\/183018.183023"},{"key":"7_CR5","unstructured":"Chiang, S.-H., Vernon, M.K.: Production job scheduling for parallel shared memory systems. In: Proc. 15th IEEE Intern. Parallel and Distributed Processing Symp. (2001)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Downey, A.B.: Using queue time predictions for processor allocation. In: Proc. 3rd Workshop on Job Scheduling Strategies for Parallel Processing [2], pp. 35\u201357","DOI":"10.1007\/3-540-63574-2_15"},{"key":"7_CR7","unstructured":"Feitelson, D.: The parallel workloads archive, http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/index.html"},{"key":"7_CR8","unstructured":"Gibbons, R.: A historical application profiler for use by parallel schedulers. In: Proc. 3rd Workshop on Job Scheduling Strategies for Parallel Processing [1]"},{"issue":"2\/3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1504\/IJHPCN.2005.008032","volume":"3","author":"R. Kettimuthu","year":"2005","unstructured":"Kettimuthu, R., Subramani, V., Srinivasan, S., Gopalsamy, T., Panda, D.K., Sadayappan, P.: Selective preemption strategies for parallel job scheduling. Intern. J. of High Performance Computing and Networking\u00a03(2\/3), 122\u2013152 (2005)","journal-title":"Intern. J. of High Performance Computing and Networking"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Lawson, B., Smirni, E., Puiu, D.: Self-adapting backfilling scheduling for parallel systems. In: Proc. 31st Intern. Conf. Parallel Processing, pp. 583\u2013592 (2002)","DOI":"10.1109\/ICPP.2002.1040916"},{"key":"7_CR11","unstructured":"Lawson, B.G., Smirni, E.: Multiple-queue backfilling scheduling with priorities and reservations for parallel systems. In: Proc. 8th Workshop on Job Scheduling Strategies for Parallel Processing [2]"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/11562382","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"C.B. Lee","year":"2005","unstructured":"Lee, C.B., Schwartzman, Y., Hardy, J., Snavely, A.: Are user runtime estimates inherently inaccurate? In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol.\u00a03277, pp. 253\u2013263. Springer, Heidelberg (2005)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"7_CR14","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. Parallel and Distributed Syst.\u00a012(6), 529\u2013543 (2001)","journal-title":"IEEE Trans. Parallel and Distributed Syst."},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-78699-3_6","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"A. Nissimov","year":"2008","unstructured":"Nissimov, A., Feitelson, D.G.: Probabilistic backfilling. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2007. LNCS, vol.\u00a04942, pp. 102\u2013115. Springer, Heidelberg (2008)"},{"key":"7_CR16","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)","DOI":"10.1109\/SC.2000.10041"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BFb0053987","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"U. Schwiegelshohn","year":"1998","unstructured":"Schwiegelshohn, U., Yahyapour, R.: Improving first-come-first-serve job scheduling by gang scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol.\u00a01459, pp. 180\u2013198. Springer, Heidelberg (1998)"},{"key":"7_CR18","unstructured":"Shmueli, E., Feitelson, D.G.: On simulation and design of parallel-systems schedulers: Are we doing the right thing? IEEE Trans. Parallel and Distributed Systems (to appear)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Snell, Q.O., Clement, M.J., Jackson, D.B.: Preemption based backfill. In: Proc. 8th Workshop on Job Scheduling Strategies for Parallel Processing [2], pp. 24\u201337","DOI":"10.1007\/3-540-36180-4_2"},{"key":"7_CR20","unstructured":"Srinivasan, S., Kettimuthu, R., Subramani, V., Sadayappan, P.: Characterization of backfilling strategies for parallel job scheduling. In: Proc. Intern. Conf. on Parallel Processing Workshops, pp. 514\u2013522 (2002)"},{"issue":"6","key":"7_CR21","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"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Tsafrir, D., Feitelson, D.G.: The dynamics of backfilling: Solving the mystery of why increased inaccuracy help. In: Proc. IEEE Intern. Symp. on Workload Characterization, pp. 131\u2013141 (2006)","DOI":"10.1109\/IISWC.2006.302737"},{"key":"7_CR23","unstructured":"Zotkin, D., Keleher, P.J.: Job-length estimation and performance in backfilling schedulers. In: Proc. 8th IEEE International Symposium on High Performance Distributed Computing, pp. 236\u2013243 (1999)"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04633-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T16:28:14Z","timestamp":1739377694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04633-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046322","9783642046339"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04633-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}