{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:28:56Z","timestamp":1743085736415,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031439421"},{"type":"electronic","value":"9783031439438"}],"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_6","type":"book-chapter","created":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T13:52:25Z","timestamp":1694699545000},"page":"116-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Experimental Analysis of\u00a0Regression-Obtained HPC Scheduling Heuristics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9651-7781","authenticated-orcid":false,"given":"Lucas","family":"Rosa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1878-8137","authenticated-orcid":false,"given":"Danilo","family":"Carastan-Santos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5746-4154","authenticated-orcid":false,"given":"Alfredo","family":"Goldman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,15]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"754","DOI":"10.4236\/ojs.2015.57075","volume":"05","author":"MO Akinwande","year":"2015","unstructured":"Akinwande, M.O., Dikko, H.G., Samson, A.: Variance inflation factor: as a condition for the inclusion of suppressor variable(s) in regression analysis. Open J. Stat. 05, 754\u2013767 (2015). https:\/\/doi.org\/10.4236\/ojs.2015.57075","journal-title":"Open J. Stat."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1002\/wics.84","volume":"2","author":"A Alin","year":"2010","unstructured":"Alin, A.: Multicollinearity. Wiley Interdisc. Rev. Comput. Stat. 2, 370\u2013374 (2010). https:\/\/doi.org\/10.1002\/wics.84","journal-title":"Wiley Interdisc. Rev. Comput. Stat."},{"key":"6_CR3","unstructured":"Amvrosiadis, G., et al.: The atlas cluster trace repository. Usenix Mag. 43(4) (2018)"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"BS Baker","year":"1980","unstructured":"Baker, B.S., Coffman, E.G., Jr., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM J. Comput. 9(4), 846\u2013855 (1980)","journal-title":"SIAM J. Comput."},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Bougeret, M., Dutot, P., Jansen, K., Otte, C., Trystram, D.: Approximation algorithms for multiple strip packing. In: Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10\u201311, 2009. Revised Papers, pp. 37\u201348 (2009). https:\/\/doi.org\/10.1007\/978-3-642-12450-1_4","DOI":"10.1007\/978-3-642-12450-1_4"},{"key":"6_CR6","doi-asserted-by":"publisher","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. 32:1\u201332:13. SC 2017, ACM, New York (2017). https:\/\/doi.org\/10.1145\/3126908.3126955","DOI":"10.1145\/3126908.3126955"},{"key":"6_CR7","doi-asserted-by":"publisher","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 (2019). https:\/\/doi.org\/10.1109\/CCGRID.2019.00010","DOI":"10.1109\/CCGRID.2019.00010"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Carroll, R., Ruppert, D.: Transformation and Weighting in Regression. Chapman & Hall\/CRC Monographs on Statistics & Applied Probability, Taylor & Francis (1988), https:\/\/books.google.com.br\/books?id=I5rGEPJd57AC","DOI":"10.1007\/978-1-4899-2873-3"},{"issue":"10","key":"6_CR9","doi-asserted-by":"publisher","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":"6_CR10","doi-asserted-by":"publisher","unstructured":"Fan, Y., Lan, Z., Childers, T., Rich, P., Allcock, W., Papka, M.E.: Deep reinforcement agent for scheduling in HPC. In: 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 807\u2013816 (2021). https:\/\/doi.org\/10.1109\/IPDPS49936.2021.00090","DOI":"10.1109\/IPDPS49936.2021.00090"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/3-540-45540-X_11","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"DG Feitelson","year":"2001","unstructured":"Feitelson, D.G.: Metrics for parallel job scheduling and their convergence. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 188\u2013205. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45540-X_11"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-63574-2_14","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"DG Feitelson","year":"1997","unstructured":"Feitelson, D.G., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., Wong, P.: Theory and practice in parallel job scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1997. LNCS, vol. 1291, pp. 1\u201334. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63574-2_14"},{"issue":"10","key":"6_CR13","doi-asserted-by":"publisher","first-page":"2967","DOI":"10.1016\/j.jpdc.2014.06.013","volume":"74","author":"DG Feitelson","year":"2014","unstructured":"Feitelson, D.G., 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":"6_CR14","doi-asserted-by":"publisher","unstructured":"Gaussier, E., Glesser, D., Reis, V., Trystram, D.: Improving backfilling by using machine learning to predict running times. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 64:1\u201364:10. SC 2015, ACM, New York (2015). https:\/\/doi.org\/10.1145\/2807591.2807646","DOI":"10.1145\/2807591.2807646"},{"key":"6_CR15","unstructured":"Georgiou, Y.: Resource and job management in high performance computing, Ph. D. thesis, Joseph Fourier University, France (2010)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-77918-6_6","volume-title":"Approximation and Online Algorithms","author":"JL Hurink","year":"2008","unstructured":"Hurink, J.L., Paulus, J.J.: Online algorithm for parallel job scheduling and strip packing. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 67\u201374. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77918-6_6"},{"key":"6_CR17","doi-asserted-by":"publisher","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 (2019). https:\/\/doi.org\/10.1109\/IPDPS.2019.00077","DOI":"10.1109\/IPDPS.2019.00077"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-77398-8_3","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"J Lelong","year":"2018","unstructured":"Lelong, J., Reis, V., Trystram, D.: Tuning easy-backfilling queues. In: Klus\u00e1\u010dek, D., Cirne, W., Desai, N. (eds.) JSSPP 2017. LNCS, vol. 10773, pp. 43\u201361. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77398-8_3"},{"issue":"6","key":"6_CR19","doi-asserted-by":"publisher","first-page":"5960","DOI":"10.1007\/s11227-020-03506-5","volume":"77","author":"J Li","year":"2021","unstructured":"Li, J., Zhang, X., Han, L., Ji, Z., Dong, X., Hu, C.: OKCM: improving parallel task scheduling in high-performance computing systems using online learning. J. Supercomput. 77(6), 5960\u20135983 (2021)","journal-title":"J. Supercomput."},{"issue":"11","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1016\/S0743-7315(03)00108-4","volume":"63","author":"U Lublin","year":"2003","unstructured":"Lublin, U., Feitelson, D.G.: The workload on parallel supercomputers: modeling the characteristics of rigid jobs. J. Parallel Distrib. Comput. 63(11), 1105\u20131122 (2003). https:\/\/doi.org\/10.1016\/S0743-7315(03)00108-4","journal-title":"J. Parallel Distrib. Comput."},{"key":"6_CR21","unstructured":"Meuer, H., Strohmaier, E., Dongarra, J., Simon, H., Meuer, M.: TOP500 Supercomputer Sites (2023). https:\/\/www.top500.org\/. Access 21 Feb 2023"},{"issue":"6","key":"6_CR22","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":"6_CR23","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer (2016)"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.jpdc.2017.09.002","volume":"111","author":"GP Rodrigo","year":"2018","unstructured":"Rodrigo, G.P., \u00d6stberg, P.O., Elmroth, E., Antypas, K., Gerber, R., Ramakrishnan, L.: Towards understanding HPC users and systems: a NERSC case study. J. Parallel Distrib. Comput. 111, 206\u2013221 (2018)","journal-title":"J. Parallel Distrib. Comput."},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Tang, W., Lan, Z., Desai, N., Buettner, D.: Fault-aware, utility-based job scheduling on BlueGene\/P systems. In: Cluster Computing and Workshops, 2009. CLUSTER 2009. IEEE International Conference on, pp. 1\u201310. IEEE (2009)","DOI":"10.1109\/CLUSTR.2009.5289206"},{"issue":"3","key":"6_CR26","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"Virtanen, P., et al.: SciPy 1.0: fundamental algorithms for scientific computing in Python. Nat. Methods 17(3), 261\u2013272 (2020). https:\/\/doi.org\/10.1038\/s41592-019-0686-2","journal-title":"Nat. Methods"},{"issue":"3","key":"6_CR27","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.tcs.2009.09.029","volume":"412","author":"D Ye","year":"2011","unstructured":"Ye, D., Han, X., Zhang, G.: Online multiple-strip packing. Theoret. Comput. Sci. 412(3), 233\u2013239 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2009.09.029. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397509006896","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"6_CR28","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10951-007-0032-x","volume":"10","author":"D Ye","year":"2007","unstructured":"Ye, D., Zhang, G.: On-line scheduling of parallel jobs in a list. J. Sched. 10(6), 407\u2013413 (2007)","journal-title":"J. Sched."},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"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 (2020). https:\/\/doi.org\/10.1109\/SC41405.2020.00035","DOI":"10.1109\/SC41405.2020.00035"},{"issue":"1","key":"6_CR30","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1515\/156939206776241264","volume":"16","author":"S Zhuk","year":"2006","unstructured":"Zhuk, S.: Approximate algorithms to pack rectangles into several strips. Discrete Math. Appl. 16(1), 73\u201385 (2006)","journal-title":"Discrete Math. Appl."},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.jpdc.2022.01.003","volume":"164","author":"S Zrigui","year":"2022","unstructured":"Zrigui, S., de Camargo, R.Y., Legrand, A., Trystram, D.: Improving the performance of batch schedulers using online job runtime classification. J. Parallel Distrib. Comput. 164, 83\u201395 (2022). https:\/\/doi.org\/10.1016\/j.jpdc.2022.01.003. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0743731522000090","journal-title":"J. Parallel Distrib. Comput."}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T13:53:07Z","timestamp":1694699587000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43943-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439421","9783031439438"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43943-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}