{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:14:45Z","timestamp":1743012885292,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662437780"},{"type":"electronic","value":"9783662437797"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43779-7_10","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T22:40:31Z","timestamp":1402440031000},"page":"177-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Variations of Conservative Backfilling to Improve Fairness"],"prefix":"10.1007","author":[{"given":"Avinab","family":"Rajbhandary","sequence":"first","affiliation":[]},{"given":"David P.","family":"Bunde","sequence":"additional","affiliation":[]},{"given":"Vitus J.","family":"Leung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,11]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1017\/S0269964808000302","volume":"22","author":"B Avi-Itzhak","year":"2008","unstructured":"Avi-Itzhak, B., Levy, H., Raz, D.: Quantifying fairness in queuing systems: principles, approaches, and applicability. Probab. Eng. Inf. Sci. 22(4), 495\u2013517 (2008)","journal-title":"Probab. Eng. Inf. Sci."},{"key":"10_CR2","unstructured":"Feitelson, D.: The parallel workloads archive. http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/index.html"},{"key":"10_CR3","unstructured":"Feitelson, D.: Personal communication (2013)"},{"key":"10_CR4","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":"DB Jackson","year":"2001","unstructured":"Jackson, D.B., Snell, Q.O., Clement, M.J.: Core algorithms of the Maui scheduler. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 87\u2013102. Springer, Heidelberg (2001)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-35867-8_13","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D Klus\u00e1\u010dek","year":"2013","unstructured":"Klus\u00e1\u010dek, D., Rudov\u00e1, H.: Performance and fairness for users in parallel job scheduling. In: Cirne, W., Desai, N., Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2012. LNCS, vol. 7698, pp. 235\u2013252. Springer, Heidelberg (2013)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Leung, V.J., Sabin, G., Sadayappan, P.: Parallel job scheduling policies to improve fairness: a case study. In: Proceedings of the 6th International Workshop on Scheduling and Resource Management for Parallel and Distributed Systems (2010)","DOI":"10.1109\/ICPPW.2010.48"},{"key":"10_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. 949, pp. 295\u2013303. Springer, Heidelberg (1995)"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1002\/cpe.2860","volume":"25","author":"AM Lindsay","year":"2013","unstructured":"Lindsay, A.M., Galloway-Carson, M., Johnson, C.R., Bunde, D.P., Leung, V.J.: Backfilling with guarantees made as jobs arrive. Concur. Comput. Pract. Exp. 25(4), 513\u2013523 (2013)","journal-title":"Concur. Comput. Pract. Exp."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1086\/224787","volume":"75","author":"L Mann","year":"1969","unstructured":"Mann, L.: Queue culture: the waiting line as a social system. Am. J. Sociol. 75, 340\u2013354 (1969)","journal-title":"Am. J. Sociol."},{"issue":"6","key":"10_CR10","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"AW 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 Distrib. Syst. 12(6), 529\u2013543 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Perkovi\u0107, D., Keleher, P.J.: Randomization, speculation, and adaptation in batch schedulers. In: Proceedings of the 2000 ACM\/IEEE Conference on Supercomputing (2000)","DOI":"10.1109\/SC.2000.10041"},{"key":"10_CR12","unstructured":"Rajbhandary, A.: Fairness in scheduling algorithms. Honors thesis, Knox College (2013)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Raz, D., Avi-Itzhak, B., Levy, H.: Fairness considerations in multi-server and multi-queue systems. In: Proceedings of the 1st International Conference on Performance Evaluation Methodologies and Tools (2006)","DOI":"10.1145\/1190095.1190145"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Sabin, G., Kochhar, G., Sadayappan, G.: Job fairness in non-preeemptive job scheduling. In: Proceedings of the International Conference on Parallel Processing (ICPP) (2004)","DOI":"10.1109\/ICPP.2004.1327920"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11605300_12","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"G Sabin","year":"2005","unstructured":"Sabin, G., Sadayappan, P.: Unfairness metrics for space-sharing parallel job schedulers. In: Feitelson, D.G., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2005. LNCS, vol. 3834, pp. 238\u2013256. Springer, Heidelberg (2005)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/1099-1425(200009\/10)3:5<297::AID-JOS50>3.0.CO;2-D","volume":"3","author":"U Schwiegelshohn","year":"2000","unstructured":"Schwiegelshohn, U., Yahyapour, R.: Fairness in parallel job scheduling. J. Sched. 3, 297\u2013320 (2000)","journal-title":"J. Sched."},{"key":"10_CR17","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. LNCS, vol. 1659, pp. 202\u2013219. Springer, Heidelberg (1999)"},{"key":"10_CR18","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. 2537, pp. 55\u201371. Springer, Heidelberg (2002)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-60153-8_30","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"I Stoica","year":"1995","unstructured":"Stoica, I., Abdel-Wahab, H., Pothen, A.: A microeconomic scheduler for parallel computers. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol. 949, pp. 200\u2013218. Springer, Heidelberg (1995)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Tsafrir, D., Feitelson, D.G.: The dynamics of backfilling: solving the mystery of why increased inaccuracy may help. In: Proceedings of the IEEE International Symposium on Workload Characterization, pp. 131\u2013141 (2006)","DOI":"10.1109\/IISWC.2006.302737"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43779-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T03:09:58Z","timestamp":1676862598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-43779-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662437780","9783662437797"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43779-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"11 June 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}