{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T12:08:36Z","timestamp":1769170116466,"version":"3.49.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031439421","type":"print"},{"value":"9783031439438","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43943-8_5","type":"book-chapter","created":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T13:52:25Z","timestamp":1694699545000},"page":"97-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimization Metrics for\u00a0the\u00a0Evaluation of\u00a0Batch Schedulers in\u00a0HPC"],"prefix":"10.1007","author":[{"given":"Robin","family":"Bo\u00ebzennec","sequence":"first","affiliation":[]},{"given":"Fanny","family":"Dufoss\u00e9","sequence":"additional","affiliation":[]},{"given":"Guillaume","family":"Pallez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,15]]},"reference":[{"key":"5_CR1","unstructured":"ALCF Public Data. https:\/\/reports.alcf.anl.gov\/data\/. This data was generated from resources of the Argonne Leadership Computing Facility, which is a DOE Office of Science User Facility supported under Contract DE-AC02-06CH11357. Accessed 08 Dec 2022"},{"key":"5_CR2","unstructured":"Top500. https:\/\/www.top500.org\/"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/11407522_14","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"C Bailey Lee","year":"2005","unstructured":"Bailey Lee, C., 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. 3277, pp. 253\u2013263. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11407522_14"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Carastan-Santos, D., De Camargo, R.Y.: Obtaining dynamic scheduling policies with simulation and machine learning. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201313 (2017)","DOI":"10.1145\/3126908.3126955"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Carastan-Santos, D., De Camargo, R. Y., Trystram, D., Zrigui, S.: One can only gain by replacing easy backfilling: a simple scheduling policies case study. In: 2019 19th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), pp. 1\u201310. IEEE (2019)","DOI":"10.1109\/CCGRID.2019.00010"},{"key":"5_CR6","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. 2537, pp. 103\u2013127. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36180-4_7"},{"key":"5_CR7","unstructured":"Du, Y., Marchal, L., Pallez, G., Robert, Y.: Doing better for jobs that failed: node stealing from a batch scheduler\u2019s perspective"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Dutot, P.-F., Mercier, M., Poquet, M., Richard, O.: Batsim: a Realistic Language-Independent Resources and Jobs Management Systems Simulator. In: 20th Workshop on Job Scheduling Strategies for Parallel Processing (Chicago, United States, May 2016)","DOI":"10.1007\/978-3-319-61756-5_10"},{"issue":"12","key":"5_CR9","doi-asserted-by":"publisher","first-page":"4903","DOI":"10.1109\/TPDS.2022.3205325","volume":"33","author":"Y Fan","year":"2022","unstructured":"Fan, Y., et al.: DRAS: deep reinforcement learning for cluster scheduling in high performance computing. IEEE Trans. Parallel Distrib. Syst. 33(12), 4903\u20134917 (2022)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Fan, Y., Rich, P., Allcock, W.E., Papka, M.E., Lan, Z.: Trade-off between prediction accuracy and underestimation rate in job runtime estimates. In: 2017 IEEE International Conference on Cluster Computing (CLUSTER), pp. 530\u2013540. IEEE (2017)","DOI":"10.1109\/CLUSTER.2017.11"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Gainaru, A., Pallez, G.: Making speculative scheduling robust to incomplete data. In: 2019 IEEE\/ACM 10th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems (ScalA), pp. 62\u201371. IEEE (2019)","DOI":"10.1109\/ScalA49573.2019.00013"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Gainaru, A., Pallez, G., Sun, H., Raghavan, P.: Speculative scheduling for stochastic HPC applications. In: Proceedings of the 48th International Conference on Parallel Processing, pp. 1\u201310 (2019)","DOI":"10.1145\/3337821.3337890"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Goponenko, A.V., Lamar, K., Peterson, C., Allan, B.A., Brandt, J.M., Dechev, D.: Metrics for packing efficiency and fairness of HPC cluster batch job scheduling. In: 2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), pp. 241\u2013252 (2022)","DOI":"10.1109\/SBAC-PAD55451.2022.00035"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Legrand, A., Trystram, D., Zrigui, S.: Adapting batch scheduling to workload characteristics: what can we expect from online learning? In: 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 686\u2013695. IEEE (2019)","DOI":"10.1109\/IPDPS.2019.00077"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Leung, V.J., Sabin, G., Sadayappan, P.: Parallel job scheduling policies to improve fairness: a case study. In: 2010 39th International Conference on Parallel Processing Workshops, pp. 346\u2013353. IEEE (2010)","DOI":"10.1109\/ICPPW.2010.48"},{"issue":"6","key":"5_CR16","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":"5_CR17","doi-asserted-by":"crossref","unstructured":"Patel, T., Liu, Z., Kettimuthu, R., Rich, P., Allcock, W., Tiwari, D.: Job characteristics on large-scale systems: long-term analysis, quantification, and implications. In: SC20: International conference for high performance computing, networking, storage and analysis, pp. 1\u201317. IEEE (2020)","DOI":"10.1109\/SC41405.2020.00088"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Perkovic, D., Keleher, P.J.: Randomization, speculation, and adaptation in batch schedulers. In: SC 2000: Proceedings of the 2000 ACM\/IEEE Conference on Supercomputing, pp. 7\u20137. IEEE (2000)","DOI":"10.1109\/SC.2000.10041"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Tang, W., Lan, Z., Desai, N., Buettner, D.: Fault-aware, utility-based job scheduling on Blue, Gene\/P systems. In: 2009 IEEE International Conference on Cluster Computing and Workshops, pp. 1\u201310. IEEE (2009)","DOI":"10.1109\/CLUSTR.2009.5289206"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-16505-4_12","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D Tsafrir","year":"2010","unstructured":"Tsafrir, D.: Using inaccurate estimates accurately. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2010. LNCS, vol. 6253, pp. 208\u2013221. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16505-4_12"},{"issue":"6","key":"5_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. Parallel Distrib. Syst. 18(6), 789\u2013803 (2007)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Verma, A., Korupolu, M., Wilkes, J.: Evaluating job packing in warehouse-scale computing. In: 2014 IEEE International Conference on Cluster Computing (CLUSTER), pp. 48\u201356, IEEE (2014)","DOI":"10.1109\/CLUSTER.2014.6968735"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"D Zhang, D., Dai, D., He, Y., Bao, F.S., Xie, B.: RLScheduler: an automated HPC batch job scheduler using reinforcement learning. In: SC20: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201315. IEEE (2020)","DOI":"10.1109\/SC41405.2020.00035"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, D., Dai, D., Xie, B.: SchedInspector: a batch job scheduling inspector using reinforcement learning. In: Proceedings of the 31st International Symposium on High-Performance Parallel and Distributed Computing (New York, NY, USA, 2022), HPDC, pp. 97\u2013109. Association for Computing Machinery (2022)","DOI":"10.1145\/3502181.3531470"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Franke, H., Moreira, J.E., Sivasubramaniam, A.: Improving parallel job scheduling by combining gang scheduling and backfilling techniques. In: Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000, pp. 133\u2013142. IEEE (2000)","DOI":"10.1109\/IPDPS.2000.845975"}],"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-031-43943-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T02:11:16Z","timestamp":1730081476000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43943-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439421","9783031439438"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43943-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JSSPP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Job Scheduling Strategies for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jsspp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}