{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T01:35:54Z","timestamp":1763429754459,"version":"3.41.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030779603"},{"type":"electronic","value":"9783030779610"}],"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-77961-0_62","type":"book-chapter","created":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T19:07:58Z","timestamp":1623352078000},"page":"779-793","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Monte Carlo Approach to the Computational Capacities Analysis of the Computing Continuum"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9437-1790","authenticated-orcid":false,"given":"Vladislav","family":"Kashansky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7145-5630","authenticated-orcid":false,"given":"Gleb","family":"Radchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8247-5426","authenticated-orcid":false,"given":"Radu","family":"Prodan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"issue":"1","key":"62_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"62_CR2","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/j.future.2017.01.002","volume":"75","author":"V Arabnejad","year":"2017","unstructured":"Arabnejad, V., Bubendorfer, K., Ng, B.: Scheduling deadline constrained scientific workflows on dynamically provisioned cloud resources. Future Gener. Comput. Syst. 75, 348\u2013364 (2017)","journal-title":"Future Gener. Comput. Syst."},{"issue":"4","key":"62_CR3","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1177\/1094342018778123","volume":"32","author":"M Asch","year":"2018","unstructured":"Asch, M., et al.: Big data and extreme-scale computing: pathways to convergence-toward a shaping strategy for a future software and data ecosystem for scientific inquiry. Int. J. High Perform. Comput. Appl. 32(4), 435\u2013479 (2018)","journal-title":"Int. J. High Perform. Comput. Appl."},{"issue":"2","key":"62_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1177\/0022002797041002001","volume":"41","author":"R Axelrod","year":"1997","unstructured":"Axelrod, R.: The dissemination of culture: a model with local convergence and global polarization. J. Conflict Resolut. 41(2), 203\u2013226 (1997)","journal-title":"J. Conflict Resolut."},{"key":"62_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791383","volume-title":"Dynamical Processes on Complex Networks","author":"A Barrat","year":"2008","unstructured":"Barrat, A., Barthelemy, M., Vespignani, A.: Dynamical Processes on Complex Networks. Cambridge University Press, Cambridge (2008)"},{"key":"62_CR6","doi-asserted-by":"publisher","unstructured":"Beckman, P., et al.: Harnessing the computing continuum for programming our world. In: Fog Computing: Theory and Practice, pp. 215\u2013230 (2020). https:\/\/doi.org\/10.1002\/9781119551713.ch7","DOI":"10.1002\/9781119551713.ch7"},{"issue":"8","key":"62_CR7","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.future.2011.05.001","volume":"27","author":"EK Byun","year":"2011","unstructured":"Byun, E.K., Kee, Y.S., Kim, J.S., Maeng, S.: Cost optimized provisioning of elastic resources for application workflows. Future Gener. Comput. Syst. 27(8), 1011\u20131026 (2011)","journal-title":"Future Gener. Comput. Syst."},{"key":"62_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-642-45005-1_31","volume-title":"Service-Oriented Computing","author":"G Copil","year":"2013","unstructured":"Copil, G., Moldovan, D., Truong, H.-L., Dustdar, S.: Multi-level elasticity control of cloud services. In: Basu, S., Pautasso, C., Zhang, L., Fu, X. (eds.) ICSOC 2013. LNCS, vol. 8274, pp. 429\u2013436. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45005-1_31"},{"issue":"9","key":"62_CR9","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1109\/TAC.2003.816954","volume":"48","author":"R D\u2019Andrea","year":"2003","unstructured":"D\u2019Andrea, R., Dullerud, G.E.: Distributed control design for spatially interconnected systems. IEEE Trans. Autom. Control 48(9), 1478\u20131495 (2003)","journal-title":"IEEE Trans. Autom. Control"},{"key":"62_CR10","doi-asserted-by":"crossref","unstructured":"Fruchterman, T.M., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exper. 21(11), 1129\u20131164 (1991)","DOI":"10.1002\/spe.4380211102"},{"key":"62_CR11","unstructured":"Gleixner, A., et al.: The scip optimization suite 6.0. Technical Report, pp. 18\u201326, ZIB, Takustr. 7, 14195 Berlin (2018)"},{"issue":"9","key":"62_CR12","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1088\/0031-9112\/28\/9\/027","volume":"28","author":"H Haken","year":"1977","unstructured":"Haken, H.: Synergetics. Phys. Bull. 28(9), 412 (1977)","journal-title":"Phys. Bull."},{"issue":"1","key":"62_CR13","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/568438.568455","volume":"32","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation. Acm Sigact News 32(1), 60\u201365 (2001)","journal-title":"Acm Sigact News"},{"key":"62_CR14","doi-asserted-by":"crossref","unstructured":"Ilyushkin, A., et al.: An experimental performance evaluation of autoscaling policies for complex workflows. In: Proceedings of the 8th ACM\/SPEC on International Conference on Performance Engineering, pp. 75\u201386 (2017)","DOI":"10.1145\/3030207.3030214"},{"key":"62_CR15","doi-asserted-by":"crossref","unstructured":"Kadanoff, L.P.: Statistical Physics: Statics, Dynamics and Renormalization. World Scientific Publishing Company, Singapore (2000)","DOI":"10.1142\/4016"},{"key":"62_CR16","unstructured":"Kashansky, V.: Modular architecture for complex computing systems analysis. http:\/\/www.edmware.org\/macs\/, Accessed 29 Jan 2021"},{"key":"62_CR17","doi-asserted-by":"crossref","unstructured":"Kashansky, V., et al.: M3at: Monitoring agents assignment model for data-intensive applications. In: 2020 28th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp. 72\u201379. IEEE (2020)","DOI":"10.1109\/PDP50117.2020.00018"},{"key":"62_CR18","unstructured":"Klimontovich, Y.L.: Statistical Theory of Open Systems: Volume 1: A Unified Approach to Kinetic Description of Processes in Active Systems, vol. 67. Springer, Dordrecht (2012)"},{"issue":"11","key":"62_CR19","first-page":"987","volume":"29","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., Drexl, A.: Local search for nonpreemptive multi-mode resource-constrained project scheduling. IIE Trans. 29(11), 987\u2013999 (1997)","journal-title":"IIE Trans."},{"key":"62_CR20","doi-asserted-by":"publisher","unstructured":"Kolisch, R., Hartmann, S.: Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis. In: W\u0229glarz, J. (eds) Project scheduling, International Series in Operations Research & Management Science, vol. 14, pp. 147\u2013178. Springer, Boston (1999) https:\/\/doi.org\/10.1007\/978-1-4615-5533-9_7","DOI":"10.1007\/978-1-4615-5533-9_7"},{"issue":"1","key":"62_CR21","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., Sprecher, A.: Psplib-a project scheduling problem library: or software-orsep operations research software exchange program. Eur. J. Oper. Res. 96(1), 205\u2013216 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"62_CR22","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1088\/0022-3719\/6\/7\/010","volume":"6","author":"JM Kosterlitz","year":"1973","unstructured":"Kosterlitz, J.M., Thouless, D.J.: Ordering, metastability and phase transitions in two-dimensional systems. J. Phys. C Solid State Phys. 6(7), 1181 (1973)","journal-title":"J. Phys. C Solid State Phys."},{"key":"62_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139696463","volume-title":"A Guide to Monte Carlo Simulations in Statistical Physics","author":"DP Landau","year":"2014","unstructured":"Landau, D.P., Binder, K.: A Guide to Monte Carlo Simulations in Statistical Physics. Cambridge University Press, Cambridge (2014)"},{"issue":"9","key":"62_CR24","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/TAC.2004.834123","volume":"49","author":"C Langbort","year":"2004","unstructured":"Langbort, C., Chandra, R.S., D\u2019Andrea, R.: Distributed control design for systems interconnected over an arbitrary graph. IEEE Trans. Autom. Control 49(9), 1502\u20131519 (2004)","journal-title":"IEEE Trans. Autom. Control"},{"key":"62_CR25","doi-asserted-by":"crossref","unstructured":"Mao, M., Humphrey, M.: Auto-scaling to minimize cost and meet application deadlines in cloud workflows. In: SC 2011: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201312. IEEE (2011)","DOI":"10.1145\/2063384.2063449"},{"key":"62_CR26","doi-asserted-by":"crossref","unstructured":"Medvedyeva, K., Holme, P., Minnhagen, P., Kim, B.J.: Dynamic critical behavior of the xy model in small-world networks. Phys. Rev. E 67(3), 036118 (2003)","DOI":"10.1103\/PhysRevE.67.036118"},{"issue":"6740","key":"62_CR27","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R Monasson","year":"1999","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic \u2018phase transitions\u2019. Nature 400(6740), 133\u2013137 (1999)","journal-title":"Nature"},{"key":"62_CR28","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical Report, Stanford InfoLab (1999)"},{"key":"62_CR29","unstructured":"Peixoto, T.P.: Graph-tool - efficient network analysis. https:\/\/graph-tool.skewed.de\/. Accessed: 29 Jan 2021"},{"issue":"7","key":"62_CR30","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/2699414","volume":"58","author":"DA Reed","year":"2015","unstructured":"Reed, D.A., Dongarra, J.: Exascale computing and big data. Commun. ACM 58(7), 56\u201368 (2015)","journal-title":"Commun. ACM"},{"key":"62_CR31","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.jpdc.2017.06.009","volume":"111","author":"A Reuther","year":"2018","unstructured":"Reuther, A., et al.: Scalable system scheduling for hpc and big data. J. Parallel Distrib. Comput. 111, 76\u201392 (2018)","journal-title":"J. Parallel Distrib. Comput."},{"key":"62_CR32","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.future.2017.09.054","volume":"79","author":"V Singh","year":"2018","unstructured":"Singh, V., Gupta, I., Jana, P.K.: A novel cost-efficient approach for deadline-constrained workflow scheduling by dynamic provisioning of resources. Future Gener. Comput. Syst. 79, 95\u2013110 (2018)","journal-title":"Future Gener. Comput. Syst."}],"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-77961-0_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:04:59Z","timestamp":1749506699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77961-0_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030779603","9783030779610"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77961-0_62","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)"}}]}}