{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T22:40:06Z","timestamp":1749422406230,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030779795"},{"type":"electronic","value":"9783030779801"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77980-1_41","type":"book-chapter","created":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T07:17:01Z","timestamp":1623223021000},"page":"540-553","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimization of Resources Allocation in High Performance Computing Under Utilization Uncertainty"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1484-2255","authenticated-orcid":false,"given":"Victor","family":"Toporkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9359-8245","authenticated-orcid":false,"given":"Dmitry","family":"Yemelyanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maksim","family":"Grigorenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"issue":"4","key":"41_CR1","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.jpdc.2011.12.002","volume":"72","author":"YC Lee","year":"2012","unstructured":"Lee, Y.C., Wang, C., Zomaya, A.Y., Zhou, B.B.: Profit-driven scheduling for cloud services with data access awareness. J. Parallel Distrib. Comput. 72(4), 591\u2013602 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"41_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.995","volume":"41","author":"RN Calheiros","year":"2011","unstructured":"Calheiros, R.N., Ranjan, R., Beloglazov, A., De Rose, C.A.F., Buyya, R.: CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. J. Softw. Pract. Experience 41(1), 23\u201350 (2011)","journal-title":"J. Softw. Pract. Experience"},{"key":"41_CR3","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. Inf. Sci. 357, 201\u2013216 (2016)","journal-title":"J. Inf. Sci."},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-46000-4_28","volume-title":"Coordination Models and Languages","author":"N Sample","year":"2002","unstructured":"Sample, N., Keyani, P., Wiederhold, G.: Scheduling under uncertainty: planning for the ubiquitous grid. In: Arbab, F., Talcott, C. (eds.) Coordination Models and Languages. LNCS, vol. 2315, pp. 300\u2013316. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46000-4_28"},{"key":"41_CR5","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., et al. (eds.) Computational Science \u2013 ICCS 2018. LNCS, vol. 10861, pp. 574\u2013583. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93701-4_45"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"102228","DOI":"10.1016\/j.simpat.2020.102228","volume":"107","author":"V Toporkov","year":"2021","unstructured":"Toporkov, V., Yemelyanov, D., Toporkova, A.: Coordinated global and private job-flow scheduling in Grid virtual organizations. Simul. Model. Pract. Theory 107, 102228 (2021)","journal-title":"Simul. Model. Pract. Theory"},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-45540-X_6","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D Jackson","year":"2001","unstructured":"Jackson, D., Snell, Q., Clement, M.: Core Algorithms of the Maui Scheduler. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 87\u2013102. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45540-X_6"},{"issue":"6","key":"41_CR8","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":"41_CR9","doi-asserted-by":"publisher","first-page":"100581","DOI":"10.1016\/j.jocs.2016.11.011","volume":"36","author":"A Tchernykh","year":"2019","unstructured":"Tchernykh, A., Schwiegelsohn, U., El-ghazali, T., Babenko, M.: Towards understanding uncertainty in cloud computing with risks of confidentiality, integrity, and availability. J. Comput. Sci. 36, 100581 (2019)","journal-title":"J. Comput. Sci."},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Chaari, T., Chaabane, S., Aissani, N., Trentesaux, D.: Scheduling under uncertainty: survey and research directions. In: 2014 International Conference on Advanced Logistics and Transport (ICALT), pp. 229\u2013234 (2014)","DOI":"10.1109\/ICAdLT.2014.6866316"},{"issue":"4","key":"41_CR11","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10723-017-9410-6","volume":"15","author":"R Ram\u00edrez-Velarde","year":"2017","unstructured":"Ram\u00edrez-Velarde, R., Tchernykh, A., Barba-Jimenez, C., Hirales-Carbajal, A., Nolazco-Flores, J.: Adaptive resource allocation with job runtime uncertainty. J. Grid Comput. 15(4), 415\u2013434 (2017)","journal-title":"J. Grid Comput."},{"issue":"8","key":"41_CR12","doi-asserted-by":"publisher","first-page":"2348","DOI":"10.1016\/j.cor.2008.08.008","volume":"36","author":"CW Wu","year":"2009","unstructured":"Wu, C.W., Brown, K.N., Beck, J.C.: Scheduling with uncertain durations: modeling beta-robust scheduling with constraints. J. Comput. Oper. Res. 36(8), 2348\u20132356 (2009)","journal-title":"J. Comput. Oper. Res."},{"key":"41_CR13","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10723-009-9135-2","volume":"7","author":"B Rood","year":"2009","unstructured":"Rood, B., Lewis, M.J.: Grid resource availability prediction-based scheduling and task replication. J. Grid Comput. 7, 479\u2013500 (2009)","journal-title":"J. Grid Comput."},{"key":"41_CR14","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-030-64616-5_47","volume-title":"Supercomputing","author":"V Toporkov","year":"2020","unstructured":"Toporkov, V., Yemelyanov, D.: Availability-based resources allocation algorithms in distributed computing. In: Voevodin, V., Sobolev, S. (eds.) Supercomputing. CCIS, vol. 1331, pp. 551\u2013562. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64616-5_47"},{"key":"41_CR15","unstructured":"https:\/\/www.cse.huji.ac.il\/labs\/parallel\/workload\/ (2021)"},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Feitelson, D.G.: Workload Modeling for Computer Systems Performance Evaluation, pp. 501\u2013540. Cambridge university press, New York (2015)","DOI":"10.1017\/CBO9781139939690"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77980-1_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T22:03:36Z","timestamp":1749420216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77980-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030779795","9783030779801"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77980-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 June 2021","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":"Krakow","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2021\/","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":"156","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":"48","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":"14","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":"31% - 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.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)"}},{"value":"212 full and 43 short papers were selected from 479 submissions to the workshops\/ thematic tracks. The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}