{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T05:24:47Z","timestamp":1743571487873,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304415"},{"type":"electronic","value":"9783031304422"}],"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-30442-2_18","type":"book-chapter","created":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T10:02:09Z","timestamp":1682589729000},"page":"237-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Task Scheduler for\u00a0Heterogeneous Data Centres Based on\u00a0Deep Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Jaime","family":"Fomperosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Iba\u00f1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esteban","family":"Stafford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose Luis","family":"Bosque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,28]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Bosque, J.L., Perez, L.P.: Theoretical scalability analysis for heterogeneous clusters. In: 4th IEEE\/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2004), Chicago, USA, pp. 285\u2013292. IEEE Computer Society (2004)","key":"18_CR1","DOI":"10.1109\/CCGrid.2004.1336579"},{"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)","key":"18_CR2","DOI":"10.1145\/3126908.3126955"},{"issue":"10","key":"18_CR3","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."},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s11227-016-1693-z","volume":"73","author":"D Garc\u00eda-Saiz","year":"2017","unstructured":"Garc\u00eda-Saiz, D., Zorrilla, M.E., Bosque, J.L.: A clustering-based knowledge discovery process for data Centre infrastructure management. J. Supercomput. 73(1), 215\u2013226 (2017)","journal-title":"J. Supercomput."},{"doi-asserted-by":"crossref","unstructured":"Hartigan, J.A., Wong, M.A.: Algorithm AS 136: a K-means clustering algorithm. J. Roy. Stat. Soc. ser. C 28(1), 100\u2013108 (1979)","key":"18_CR5","DOI":"10.2307\/2346830"},{"doi-asserted-by":"crossref","unstructured":"Herrera, A., Ib\u00e1\u00f1ez, M., Stafford, E., Bosque, J.: A simulator for intelligent workload managers in heterogeneous clusters. In: 2021 IEEE\/ACM 21st International Symposium on Cluster, Cloud and Internet Computing (CCGrid), pp. 196\u2013205 (2021)","key":"18_CR6","DOI":"10.1109\/CCGrid51090.2021.00029"},{"doi-asserted-by":"crossref","unstructured":"Leonenkov, S., Zhumatiy, S.: Introducing new backfill-based scheduler for SLURM resource manager. In: Procedia Computer Science, 4th International Young Scientist Conference on Computational Science, vol. 66, pp. 661\u2013669 (2015)","key":"18_CR7","DOI":"10.1016\/j.procs.2015.11.075"},{"issue":"11","key":"18_CR8","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)","journal-title":"J. Parallel Distrib. Comput."},{"doi-asserted-by":"crossref","unstructured":"Mao, H., Alizadeh, M., Menache, I., Kandula, S.: Resource management with deep reinforcement learning. In: Proceedings of the 15th ACM Workshop on Hot Topics in Networks, pp. 50\u201356 (2016)","key":"18_CR9","DOI":"10.1145\/3005745.3005750"},{"doi-asserted-by":"crossref","unstructured":"Mao, H., Schwarzkopf, M., Venkatakrishnan, S.B., Meng, Z., Alizadeh, M.: Learning scheduling algorithms for data processing clusters. In: Proceedings of the ACM Special Interest Group on Data Communication, p. 270\u2013288. SIGCOMM 2019 (2019)","key":"18_CR10","DOI":"10.1145\/3341302.3342080"},{"key":"18_CR11","volume-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"J Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Longman Publishing Co., Inc, Boston (1984)"},{"key":"18_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling","author":"M Pinedo","year":"2012","unstructured":"Pinedo, M.: Scheduling, vol. 29. Springer, Berlin (2012)"},{"issue":"11","key":"18_CR13","doi-asserted-by":"publisher","first-page":"8787","DOI":"10.1007\/s11227-020-03175-4","volume":"76","author":"E Stafford","year":"2020","unstructured":"Stafford, E., Bosque, J.L.: Improving utilization of heterogeneous clusters. J. Supercomput. 76(11), 8787\u20138800 (2020). https:\/\/doi.org\/10.1007\/s11227-020-03175-4","journal-title":"J. Supercomput."},{"issue":"9","key":"18_CR14","doi-asserted-by":"publisher","first-page":"10053","DOI":"10.1007\/s11227-021-03663-1","volume":"77","author":"E Stafford","year":"2021","unstructured":"Stafford, E., Bosque, J.L.: Performance and energy task migration model for heterogeneous clusters. J. Supercomput. 77(9), 10053\u201310064 (2021). https:\/\/doi.org\/10.1007\/s11227-021-03663-1","journal-title":"J. Supercomput."},{"key":"18_CR15","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT press, Cambridge (2018)"},{"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: IEEE International Conference on Cluster Computing and Workshops, pp. 1\u201310 (2009)","key":"18_CR16","DOI":"10.1109\/CLUSTR.2009.5289206"},{"key":"18_CR17","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2013","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer Science & Business Media, Berlin (2013)"},{"key":"18_CR18","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"},{"doi-asserted-by":"crossref","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. IEEE (2020)","key":"18_CR19","DOI":"10.1109\/SC41405.2020.00035"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30442-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T09:01:28Z","timestamp":1729328488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30442-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304415","9783031304422"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30442-2_18","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":"28 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gdansk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppam.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","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":"132","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":"77","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":"58% - 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","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","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}