{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T00:50:02Z","timestamp":1782003002828,"version":"3.54.5"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031087592","type":"print"},{"value":"9783031087608","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-08760-8_1","type":"book-chapter","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T03:06:09Z","timestamp":1655780769000},"page":"3-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Machine Learning-Based Scheduling and Resources Allocation in Distributed Computing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1484-2255","authenticated-orcid":false,"given":"Victor","family":"Toporkov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9359-8245","authenticated-orcid":false,"given":"Dmitry","family":"Yemelyanov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Artem","family":"Bulkhak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Bharathi, S., Chervenak, A.L., Deelman, E., Mehta, G., Su, M., Vahi, K.: Characterization of scientific workflows. In: Proceedings of 2008 Third Workshop on Workflows in Support of Large-Scale Science, pp. 1\u201310 (2008)","DOI":"10.1109\/WORKS.2008.4723958"},{"issue":"P2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1016\/j.future.2017.05.009","volume":"79","author":"MA Rodriguez","year":"2018","unstructured":"Rodriguez, M.A., Buyya, R.: Scheduling dynamic workloads in multi-tenant scientific workflow as a service platforms. Futur. Gener. Comput. Syst. 79(P2), 739\u2013750 (2018)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Kurowski, K., Nabrzyski, J., Oleksiak, A., Weglarz, J.: Multicriteria aspects of grid resource management. In: Nabrzyski, J., Schopf, J.M., Weglarz J. (eds.) Grid Resource Management. State of the Art and Future Trends, pp. 271\u2013293. Kluwer Academic Publishers (2003)","DOI":"10.1007\/978-1-4615-0509-9_18"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-22744-9_31","volume-title":"Computational Science \u2013 ICCS 2019","author":"V Toporkov","year":"2019","unstructured":"Toporkov, V., Yemelyanov, D.: Heuristic rules for coordinated resources allocation and optimization in distributed computing. In: Rodrigues, J.M.F., et al. (eds.) ICCS 2019. LNCS, vol. 11538, pp. 395\u2013408. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22744-9_31"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Toporkov, V., Yemelyanov, D., Toporkova, A.: Coordinated global and private job-flow scheduling in grid virtual organizations. J. Simulation Modelling Practice and Theory 107. Elsevier (2021)","DOI":"10.1016\/j.simpat.2020.102228"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"7857","DOI":"10.1007\/s11227-018-2553-9","volume":"75","author":"O Sukhoroslov","year":"2019","unstructured":"Sukhoroslov, O., Nazarenko, A., Aleksandrov, R.: An experimental study of scheduling algorithms for many-task applications. J. Supercomputing 75, 7857\u20137871 (2019)","journal-title":"J. Supercomputing"},{"issue":"C","key":"1_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.ins.2014.02.008","volume":"357","author":"P Samimi","year":"2016","unstructured":"Samimi, P., Teimouri, Y., Mukhtar, M.: A combinatorial double auction resource allocation model in cloud computing. J. Inform. Sci. 357(C), 201\u2013216 (2016)","journal-title":"J. Inform. Sci."},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10723-013-9252-9","volume":"11","author":"I Rodero","year":"2013","unstructured":"Rodero, I., Villegas, D., Bobroff, N., Liu, Y., Fong, L., Sadjadi, S.: Enabling interoperability among grid meta-schedulers. J. Grid Comput. 11(2), 311\u2013336 (2013)","journal-title":"J. Grid Comput."},{"issue":"9","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1016\/j.jpdc.2005.05.003","volume":"65","author":"E Shmueli","year":"2005","unstructured":"Shmueli, E., Feitelson, D.G.: Backfilling with lookahead to optimize the packing of parallel jobs. J. Parallel Distrib. Comput. 65(9), 1090\u20131107 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR10","unstructured":"Khemka, B., Machovec, D., Blandin, C., Siegel, H.J., Hariri, S., Louri, A., Tunc, C., Fargo, F., Maciejewski, A.A.: Resource management in heterogeneous parallel computing environments with soft and hard deadlines. In: Proceedings of 11th Metaheuristics International Conference (MIC 2015) (2015)"},{"key":"1_CR11","unstructured":"Netto, M.A.S., Buyya, R.: A flexible resource co-allocation model based on advance reservations with rescheduling support. In: Technical Report, GRIDSTR-2007\u20132017, Grid Computing and Distributed Systems Laboratory. The University of Melbourne, Australia (2007)"},{"key":"1_CR12","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-99626-4_4","volume-title":"Intelligent Distributed Computing XII","author":"V Toporkov","year":"2018","unstructured":"Toporkov, V., Toporkova, A., Yemelyanov, D.: Slot co-allocation optimization in distributed computing with heterogeneous resources. In: Del Ser, J., Osaba, E., Bilbao, M.N., Sanchez-Medina, J.J., Vecchio, M., Yang, X.-S. (eds.) IDC 2018. SCI, vol. 798, pp. 40\u201349. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99626-4_4"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/978-3-319-93701-4_45","volume-title":"Computational Science \u2013 ICCS 2018","author":"V Toporkov","year":"2018","unstructured":"Toporkov, V., Yemelyanov, D.: Optimization of resources selection for jobs scheduling in heterogeneous distributed computing environments. In: Shi, Y., Fu, H., Tian, Y., Krzhizhanovskaya, V.V., Lees, M.H., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2018. LNCS, vol. 10861, pp. 574\u2013583. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93701-4_45"},{"key":"1_CR14","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-030-76773-0_43","volume-title":"Theory and Engineering of Dependable Computer Systems and Networks","author":"V Toporkov","year":"2021","unstructured":"Toporkov, V., Yemelyanov, D.: Scheduling optimization in heterogeneous computing environments with resources of different types. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds.) DepCoS-RELCOMEX 2021. AISC, vol. 1389, pp. 447\u2013456. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76773-0_43"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Xu, S., Panwar, S.S., Kodialam, M.S., Lakshman, T.V.: Deep neural network approximated dynamic programming for combinatorial optimization. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1684\u20131691 (2020)","DOI":"10.1609\/aaai.v34i02.5531"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Nomer, H.A.A., Alnowibet, K.A., Elsayed, A., Mohamed, A.W.: Neural knapsack: A neural network based solver for the knapsack problem. In: Proceedings of the IEEE Access, vol. 8, pp. 224200\u2013224210 (2020)","DOI":"10.1109\/ACCESS.2020.3044005"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Hertrich, C., Skutella, M.: Provably good solutions to the knapsack problem via neural networks of bounded size. In: Proceedings of the AAAI Conference on Artificial Intelligence 35(9), pp. 7685\u20137693 (2021)","DOI":"10.1609\/aaai.v35i9.16939"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Chollet, F.: Xception: Deep learning with depthwise separable convolutions. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 1800\u20131807 (2017)","DOI":"10.1109\/CVPR.2017.195"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08760-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T00:11:06Z","timestamp":1782000666000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08760-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031087592","9783031087608"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08760-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"21 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2022\/","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":"474","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":"175","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":"78","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":"37% - 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":"2.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":"3","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}