{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T17:09:16Z","timestamp":1763226556519},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319773971"},{"type":"electronic","value":"9783319773988"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-77398-8_4","type":"book-chapter","created":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T00:52:54Z","timestamp":1519692774000},"page":"62-82","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Don\u2019t Hurry Be Happy: A Deadline-Based Backfilling Approach"],"prefix":"10.1007","author":[{"given":"Tchimou","family":"N\u2019takp\u00e9","sequence":"first","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Suter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,28]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Capit, N., Da Costa, G., Georgiou, Y., Huard, G., Martin, C., Mouni\u00e9, G., Neyron, P., Richard, O.: A batch scheduler with high level components. In: Proceedings of the 5th International Symposium on Cluster Computing and the Grid (CCGrid), Cardiff, UK, May 2005, pp. 776\u2013783 (2005)","DOI":"10.1109\/CCGRID.2005.1558641"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/10968987_3","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"AB Yoo","year":"2003","unstructured":"Yoo, A.B., Jette, M.A., Grondona, M.: SLURM: simple Linux utility for resource management. In: Feitelson, D., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 44\u201360. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/10968987_3"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Staples, G.: TORQUE - TORQUE resource manager. In: Proceedings of the ACM\/IEEE SC2006 Conference on High Performance Networking and Computing, Tampa, FL, p. 8, November 2006","DOI":"10.1145\/1188455.1188464"},{"key":"4_CR4","unstructured":"Boutin, E., Ekanayake, J., Lin, W., Shi, B., Zhou, J., Qian, Z., Wu, M., Zhou, L.: Apollo: scalable and coordinated scheduling for cloud-scale computing. In: Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation, (OSDI), Broomfield, CO, pp. 285\u2013300, October 2014"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Verma, A., Pedrosa, L., Korupolu, M., Oppenheimer, D., Tune, E., Wilkes, J.: Large-scale cluster management at Google with Borg. In: Proceedings of the 10th European Conference on Computer Systems (EuroSys), Bordeaux, France, April 2015","DOI":"10.1145\/2741948.2741964"},{"key":"4_CR6","unstructured":"Hindman, B., Konwinski, A., Zaharia, M., Ghodsi, A., Joseph, A.D., Katz, R.H., Shenker, S., Stoica, I.: Mesos: a platform for fine-grained resource sharing in the data center. In: Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI), Boston, MA (2011)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Schwiegelshohn, U., Yahyapour, R.: Analysis of first-come-first-serve parallel job scheduling. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 629\u2013638, January 1998","DOI":"10.1007\/BFb0053987"},{"issue":"10","key":"4_CR8","doi-asserted-by":"crossref","first-page":"2967","DOI":"10.1016\/j.jpdc.2014.06.013","volume":"74","author":"D Feitelson","year":"2014","unstructured":"Feitelson, D., Tsafrir, D., Krakov, D.: Experience with using the parallel workloads archive. J. Parallel Distrib. Comput. 74(10), 2967\u20132982 (2014)","journal-title":"J. Parallel Distrib. Comput."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Feitelson, D.G., Weil, A.M.: Utilization and predictability in scheduling the IBM SP2 with backfilling. In: Proceedings of the 12th International Parallel Processing Symposium (IPPS), pp. 542\u2013546 (1998)","DOI":"10.1109\/IPPS.1998.669970"},{"issue":"6","key":"4_CR10","doi-asserted-by":"crossref","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":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-319-09873-9_12","volume-title":"Euro-Par 2014 Parallel Processing","author":"D Klus\u00e1\u010dek","year":"2014","unstructured":"Klus\u00e1\u010dek, D., T\u00f3th, \u0160.: On interactions among scheduling policies: finding efficient queue setup using high-resolution simulations. In: Silva, F., Dutra, I., Santos Costa, V. (eds.) Euro-Par 2014. LNCS, vol. 8632, pp. 138\u2013149. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09873-9_12"},{"key":"4_CR12","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":"DA Lifka","year":"1995","unstructured":"Lifka, D.A.: The ANL\/IBM SP scheduling system. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1995. LNCS, vol. 949, pp. 295\u2013303. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60153-8_35"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Klus\u00e1\u010dek, D., Rudov\u00e1, H.: Alea 2 - job scheduling simulator. In: Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques (SIMUTools 2010), Malaga, Spain (2010)","DOI":"10.4108\/ICST.SIMUTOOLS2010.8722"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-00955-6_27","volume-title":"Euro-Par 2008 Workshops - Parallel Processing","author":"Y Caniou","year":"2009","unstructured":"Caniou, Y., Gay, J.-S.: Simbatch: an API for simulating and predicting the performance of parallel resources managed by batch systems. In: C\u00e9sar, E., Alexander, M., Streit, A., Tr\u00e4ff, J.L., C\u00e9rin, C., Kn\u00fcpfer, A., Kranzlm\u00fcller, D., Jha, S. (eds.) Euro-Par 2008. LNCS, vol. 5415, pp. 223\u2013234. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00955-6_27"},{"issue":"10","key":"4_CR15","doi-asserted-by":"crossref","first-page":"2899","DOI":"10.1016\/j.jpdc.2014.06.008","volume":"74","author":"H Casanova","year":"2014","unstructured":"Casanova, H., Giersch, A., Legrand, A., Quinson, M., Suter, F.: Versatile, scalable, and accurate simulation of distributed applications and platforms. J. Parallel Distrib. Comput. 74(10), 2899\u20132917 (2014)","journal-title":"J. Parallel Distrib. Comput."},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-319-61756-5_10","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"P-F Dutot","year":"2017","unstructured":"Dutot, P.-F., Mercier, M., Poquet, M., Richard, O.: Batsim: a realistic language-independent resources and jobs management systems simulator. In: Desai, N., Cirne, W. (eds.) JSSPP 2015-2016. LNCS, vol. 10353, pp. 178\u2013197. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61756-5_10"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"N\u2019takp\u00e9, T., Suter, F.: Companion of the don\u2019t hurry be happy: a deadline-based backfilling approach article (2017). https:\/\/doi.org\/10.6084\/m9.figshare.4644466","DOI":"10.6084\/m9.figshare.4644466"},{"issue":"1","key":"4_CR18","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu, C.L., Layland, J.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46\u201361 (1973)","journal-title":"J. ACM"},{"key":"4_CR19","unstructured":"Jyothi, S.A., Curino, C., Menache, I., Narayanamurthy, S.M., Tumanov, A., Yaniv, J., Mavlyutov, R., Goiri, I., Krishnan, S., Kulkarni, J., Rao, S.: Morpheus: towards automated SLOs for enterprise clusters. In: Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI), Savannah, GA, pp. 117\u2013134, November 2016"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Lucier, B., Menache, I., Naor, J., Yaniv, J.: Efficient online scheduling for deadline-sensitive jobs. In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Montreal, Canada, pp. 305\u2013314, July 2013","DOI":"10.1145\/2486159.2486187"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-0-387-78448-9_8","volume-title":"Making Grids Work","author":"R Baraglia","year":"2008","unstructured":"Baraglia, R., Capannini, G., Pasquali, M., Puppin, D., Ricci, L., Techiouba, A.: Backfilling strategies for scheduling streams of jobs on computational farms. In: Danelutto, M., Fragopoulou, P., Getov, V. (eds.) Making Grids Work, pp. 103\u2013115. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-78448-9_8"},{"key":"4_CR22","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\u00e1c\u0306ek","year":"2013","unstructured":"Klus\u00e1c\u0306ek, 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). https:\/\/doi.org\/10.1007\/978-3-642-35867-8_13"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Klus\u00e0\u010dek, D., Chlumsk\u00fd, V.: Planning and metaheuristic optimization in production job scheduler. In: Proceedings of the 20th Workshop on Job Scheduling Strategies for Parallel Processing, Chicago, IL, May 2016. https:\/\/doi.org\/10.1007\/978-3-319-61756-5_11","DOI":"10.1007\/978-3-319-61756-5_11"},{"issue":"4","key":"4_CR24","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1002\/cpe.2860","volume":"25","author":"A Lindsay","year":"2013","unstructured":"Lindsay, A., Galloway-Carson, M., Johnson, C., Bunde, D., Leung, V.: Backfilling with guarantees made as jobs arrive. Concurr. Computat. Pract. Exp. 25(4), 513\u2013523 (2013)","journal-title":"Concurr. Computat. Pract. Exp."}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77398-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T05:11:47Z","timestamp":1693545107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-77398-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319773971","9783319773988"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77398-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}