{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T23:42:42Z","timestamp":1768520562873,"version":"3.49.0"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,3,16]],"date-time":"2020-03-16T00:00:00Z","timestamp":1584316800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,16]],"date-time":"2020-03-16T00:00:00Z","timestamp":1584316800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s11227-020-03246-6","type":"journal-article","created":{"date-parts":[[2020,3,16]],"date-time":"2020-03-16T13:07:23Z","timestamp":1584364043000},"page":"10212-10239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Two-level utilization-based processor allocation for scheduling moldable jobs"],"prefix":"10.1007","volume":"76","author":[{"given":"Ying-Jhih","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuo-Ting","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuan-Chou","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Chhabra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsi-Ya","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuo-Chan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,16]]},"reference":[{"key":"3246_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-63574-2_14","volume":"1291","author":"DG Feitelson","year":"1997","unstructured":"Feitelson DG, Rudolph L, Schweigelshohn U, Sevcik K, Wong P (1997) Theory and practice in parallel job scheduling. Lect Notes Comput Sci 1291:1\u201334","journal-title":"Lect Notes Comput Sci"},{"key":"3246_CR2","doi-asserted-by":"crossref","unstructured":"Kessler C, Melot N, Eitschberger P, Keller J (2013) Crown scheduling: energy-efficient resource allocation, mapping and discrete frequency scaling for collections of malleable streaming tasks. In: Proceedings of the 23rd international workshop on power and timing modeling, optimization and simulation","DOI":"10.1109\/PATMOS.2013.6662176"},{"key":"3246_CR3","doi-asserted-by":"crossref","unstructured":"Wu X, Loiseau P (2015). Algorithms for scheduling deadline-sensitive malleable tasks. In: Proceedings of the fifty-third annual Allerton conference","DOI":"10.1109\/ALLERTON.2015.7447050"},{"key":"3246_CR4","doi-asserted-by":"crossref","unstructured":"Asghar S, Aubanel E, Bremner D (2013) A dynamic moldable job scheduling based parallel SAT solver. Proceedings of the international conference on parallel processing, pp 110\u2013119","DOI":"10.1109\/ICPP.2013.20"},{"key":"3246_CR5","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/MC.2012.293","volume":"45","author":"M AbdelBaky","year":"2012","unstructured":"AbdelBaky M, Parashar M, Kim H, JordanKirk EJ, Sachdeva V, Sexton J, Jamjoom H, Shae ZY, Pencheva G, Tavakoli R, Wheeler MF (2012) Enabling high performance computing as a service. IEEE Comput 45:72\u201380","journal-title":"IEEE Comput"},{"key":"3246_CR6","doi-asserted-by":"crossref","unstructured":"Bagga S, Garg D, Arora A (2014) Moldable load scheduling using demand adjustable policies. Proceedings of the international conference on advances in computing communications and informatics","DOI":"10.1109\/ICACCI.2014.6968207"},{"issue":"4","key":"3246_CR7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.4236\/jcc.2013.15003","volume":"4","author":"KC Huang","year":"2013","unstructured":"Huang KC, Huang TC, Tsai MJ, Chang HY, Tung YH (2013) Moldable job scheduling for HPC as a service with application speedup model and execution time information. J Converg Sect A Comput Commun 4(4):14\u201322","journal-title":"J Converg Sect A Comput Commun"},{"key":"3246_CR8","doi-asserted-by":"crossref","unstructured":"Wu S, Tuo Q, Jin H, Yan C, Weng Q (2015) HRF: a resource allocation scheme for moldable jobs. In: Proceedings of the 12th ACM international conference on computing frontiers","DOI":"10.1145\/2742854.2742870"},{"key":"3246_CR9","unstructured":"Kwon OH, Kim J, Hong SJ, Lee SG (1997) Real-time job scheduling in hypercube systems. In: Proceedings of international conference on parallel processing, p 166"},{"issue":"9","key":"3246_CR10","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1109\/71.722219","volume":"9","author":"OH Kwon","year":"1998","unstructured":"Kwon OH, Chwa KY (1998) An algorithm for scheduling jobs in hypercube systems. IEEE Trans Parallel Distrib Syst 9(9):856\u2013860","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"8","key":"3246_CR11","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1109\/12.403722","volume":"44","author":"LM Ni","year":"1995","unstructured":"Ni LM, Turner SW, Cheng BHC (1995) Contention-free 2D-mesh cluster allocation in hypercubes. IEEE Trans Comput 44(8):1051\u20131055","journal-title":"IEEE Trans Comput"},{"issue":"10","key":"3246_CR12","doi-asserted-by":"publisher","first-page":"1108","DOI":"10.1109\/71.473519","volume":"6","author":"DD Sharma","year":"1995","unstructured":"Sharma DD, Pradhan DK (1995) Processor allocation in hypercube multicomputers: fast and efficient strategies for cubic and noncubic allocation. IEEE Trans Parallel Distrib Syst 6(10):1108\u20131122","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"6","key":"3246_CR13","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"AW Mu\u2019alem","year":"2001","unstructured":"Mu\u2019alem AW, Feitelson DG (2001) Utilization, predictability, workloads, and user runtime estimate in scheduling the IBM SP2 with backfilling. IEEE Trans Parallel Distrib Syst 12(6):529\u2013543","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3246_CR14","unstructured":"Feitelson DG, Rudolph L (1995) Parallel job scheduling: issues and approaches. In: Proceedings of job scheduling strategies for parallel processing, pp 1\u201318"},{"key":"3246_CR15","doi-asserted-by":"crossref","unstructured":"Lifka D (1995) The ANL\/IBM SP scheduling system. In: Proceedings of the job scheduling strategies for parallel processing, pp 295\u2013303","DOI":"10.1007\/3-540-60153-8_35"},{"key":"3246_CR16","doi-asserted-by":"crossref","unstructured":"Skovira J, Chan W, Zhou H, Lifka D (1996) The EASY-LoadLeveler API project. In: Proceedings of the job scheduling strategies for parallel processing, pp 41\u201347","DOI":"10.1007\/BFb0022286"},{"key":"3246_CR17","doi-asserted-by":"crossref","unstructured":"Feitelson, D.G., Weil, A.M. (1998). Utilization and predictability in scheduling the IBM SP2 with backfilling. In: Proceedings of the 12th Int\u2019l parallel processing symposium, pp 542\u2013546","DOI":"10.1109\/IPPS.1998.669970"},{"key":"3246_CR18","doi-asserted-by":"crossref","unstructured":"Srinivasan S, Kettimuthu R, Subrarnani V, Sadayappan P (2002) Characterization of backfilling strategies for parallel job scheduling. In: Proceeding of the conference on parallel processing (ICPP), pp 514\u2013522","DOI":"10.1109\/ICPPW.2002.1039773"},{"key":"3246_CR19","unstructured":"Wong AKL, Goscinski AM (2007) Evaluating the EASY-backfill job scheduling of static workloads on clusters. In: Proceedings of the IEEE international conference in cluster computing, pp 64\u201373"},{"key":"3246_CR20","doi-asserted-by":"crossref","unstructured":"Wong AK, Goscinski AM (2008) The impact of under-estimated length of jobs on EASY-backfill scheduling. In: Proceedings of the IEEE parallel, distributed and network-based processing","DOI":"10.1109\/PDP.2008.53"},{"key":"3246_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1109\/TPDS.2005.18","volume":"16","author":"DG Feitelson","year":"2005","unstructured":"Feitelson DG (2005) Experimental analysis of the root causes of performance evaluation results: a backfilling case study. IEEE Trans Parallel Distrib Syst 16:175\u2013182","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3246_CR22","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 DG (2005) Backfilling with lookahead to optimize the packing of parallel jobs. J Parallel Distrib Comput 65:1090\u20131107","journal-title":"J Parallel Distrib Comput"},{"key":"3246_CR23","doi-asserted-by":"crossref","unstructured":"Jackson DB, Snell Q, Clement MJ (2001) Core algorithms of the Maui scheduler. In: Proceedings of the job scheduling strategies for parallel processing","DOI":"10.1007\/3-540-45540-X_6"},{"key":"3246_CR24","doi-asserted-by":"crossref","unstructured":"Feitelson DG, Rudolph L, Schwiegelshohn U (2005) Parallel job scheduling\u2014a status report. In: Proceedings of the job scheduling strategies for parallel processing, pp 1\u201316","DOI":"10.1007\/11407522_1"},{"key":"3246_CR25","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 DG (2007) Backfilling using system-generated predictions rather than user runtime estimates. IEEE Trans Parallel Distrib Syst 18:789\u2013803","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3246_CR26","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1109\/TPDS.2008.48","volume":"19","author":"SH Chiang","year":"2008","unstructured":"Chiang SH, Vasupongayya S (2008) Design and potential performance of goal-oriented job scheduling policies for parallel computer workloads. IEEE Trans Parallel Distrib Syst 19:1642\u20131656","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3246_CR27","doi-asserted-by":"crossref","unstructured":"Stanzani S, C\u00f3be R, Fialho J, Iope R, Gomes M, Baruchi A, Amaral J (2019) Towards a strategy for performance prediction on heterogeneous architectures. In: Senger H et al (eds) High performance computing for computational science\u2014VECPAR 2018. Lecture notes in computer science, vol 11333, pp 247\u2013253","DOI":"10.1007\/978-3-030-15996-2_18"},{"key":"3246_CR28","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1007\/s10586-017-1385-3","volume":"21","author":"C Shen","year":"2018","unstructured":"Shen C, Tong W, Choo KR et al (2018) Performance prediction of parallel computing models to analyze cloud-based big data applications. Cluster Comput 21:1439\u20131454","journal-title":"Cluster Comput"},{"key":"3246_CR29","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez V, Serpa M, Dupros F, Padoin EL, Navaux P (2018). Performance prediction of acoustic wave numerical kernel on Intel Xeon Phi processor. In: Mocskos E, Nesmachnow S (eds) High performance computing. CARLA 2017. Communications in computer and information science, vol 796, pp 101\u2013110","DOI":"10.1007\/978-3-319-73353-1_7"},{"key":"3246_CR30","unstructured":"Caron E, Chouhan PK, Desprez F (2004) Deadline scheduling with priority for client-server systems on the grid. In: Proceedings of the fifth IEEE\/ACM international workshop on grid computing"},{"key":"3246_CR31","unstructured":"Le G, Xu K, Song J (2013) Dynamic resource provisioning and scheduling with deadline constraint in elastic cloud. In: Proceedings of the international conference on service science"},{"key":"3246_CR32","doi-asserted-by":"crossref","unstructured":"Perret Q, Charlemagne G, Sotiriadis S, Bessis N (2013) A deadline scheduler for jobs in distributed systems. In: Proceedings of the 27th international conference on advanced information networking and applications workshops","DOI":"10.1109\/WAINA.2013.194"},{"issue":"5","key":"3246_CR33","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/TSE.1987.233201","volume":"13","author":"W Zhao","year":"1987","unstructured":"Zhao W, Ramamritham K, Stankovic JA (1987) Scheduling tasks with resource requirements in hard real-time systems. IEEE Trans Softw Eng 13(5):564\u2013577","journal-title":"IEEE Trans Softw Eng"},{"issue":"4","key":"3246_CR34","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s12239-015-0065-7","volume":"16","author":"H Yoon","year":"2015","unstructured":"Yoon H, Ryu M (2015) Guaranteeing end-to-end deadlines for AUTOSAR-based automotive software. Int J Automot Technol 16(4):635\u2013644","journal-title":"Int J Automot Technol"},{"issue":"4","key":"3246_CR35","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11241-014-9213-9","volume":"51","author":"J Li","year":"2014","unstructured":"Li J, Luo Z, Ferry D, Agrawal K, Gill C, Lu C (2014) Global EDF scheduling for parallel real-time tasks. Real Time Syst 51(4):395\u2013439","journal-title":"Real Time Syst"},{"key":"3246_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TC.2013.3","volume":"62","author":"J Li","year":"2013","unstructured":"Li J, Xiong M, Lee VCS, Shu L, Li G (2013) Workload efficient deadline and period assignment for maintaining temporal consistency under EDF. IEEE Trans Comput 62:1\u201314","journal-title":"IEEE Trans Comput"},{"key":"3246_CR37","unstructured":"Herrtwich RG (1990) An introduction to real-time scheduling. ICSI Technique report, TR-90-035"},{"key":"3246_CR38","doi-asserted-by":"crossref","unstructured":"Pop F (2013) Scheduling of sporadic tasks with deadline constrains in cloud environments. In: Proceedings of the IEEE 27th international conference on advanced information networking and applications","DOI":"10.1109\/AINA.2013.103"},{"key":"3246_CR39","doi-asserted-by":"crossref","unstructured":"Srinivasan S, Krishnamoorthy S, Sadayappan P (2003) A robust scheduling strategy for moldable scheduling of parallel jobs. In: Proceedings of the 5th IEEE international conference on cluster computing, pp 92\u201399","DOI":"10.1109\/CLUSTR.2003.1253304"},{"key":"3246_CR40","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-36265-7_17","volume":"2552","author":"S Srinivasan","year":"2002","unstructured":"Srinivasan S, Subramani V, Kettimuthu R, Holenarsipur P, Sadayappan P (2002) Effective selection of partition sizes for moldable scheduling of parallel jobs. Lect Notes Comput Sci 2552:174\u2013183","journal-title":"Lect Notes Comput Sci"},{"key":"3246_CR41","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-39997-6_12","volume":"1911","author":"W Cirne","year":"2000","unstructured":"Cirne W, Berman F (2000) Adaptive selection of partition size for supercomputer requests. Lect Notes Comput Sci 1911:187\u2013207","journal-title":"Lect Notes Comput Sci"},{"key":"3246_CR42","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1016\/S0743-7315(02)91869-1","volume":"62","author":"W Cirne","year":"2002","unstructured":"Cirne W, Berman F (2002) Using moldability to improve the performance of supercomputer jobs. J Parallel Distrib Comput 62:1571\u20131601","journal-title":"J Parallel Distrib Comput"},{"key":"3246_CR43","unstructured":"Sabin G, Lang M, Sadayappan P (2006) Moldable parallel job scheduling using job efficiency: an iterative approach. In: Proceedings of the job scheduling strategies for parallel processing, Saint Malo, France"},{"key":"3246_CR44","unstructured":"Caniou Y, Charrier G, Desprez F (2011) Evaluation of reallocation heuristics for moldable tasks in computational grids. In: Proceedings of the 9th Australasian symposium on parallel and distributed computing"},{"key":"3246_CR45","unstructured":"Huang KC (2006) Performance evaluation of adaptive processor allocation policies for moldable parallel batch jobs. In: Proceedings of the 3th workshop on grid technologies and applications"},{"key":"3246_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-020-03209-x","author":"M Beheshti Roui","year":"2020","unstructured":"Beheshti Roui M, Shekofteh SK, Noori H et al (2020) Efficient scheduling of streams on GPGPUs. J Supercomput. https:\/\/doi.org\/10.1007\/s11227-020-03209-x","journal-title":"J Supercomput"},{"key":"3246_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-019-02969-3","author":"Q Chen","year":"2019","unstructured":"Chen Q, Oh J, Kim S et al (2019) Design of an adaptive GPU sharing and scheduling scheme in container-based cluster. Cluster Comput. https:\/\/doi.org\/10.1007\/s10586-019-02969-3","journal-title":"Cluster Comput"},{"key":"3246_CR48","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1007\/s11227-013-0870-6","volume":"65","author":"HJ Choi","year":"2013","unstructured":"Choi HJ, Son DO, Kang SG et al (2013) An efficient scheduling scheme using estimated execution time for heterogeneous computing systems. J Supercomput 65:886\u2013902","journal-title":"J Supercomput"},{"key":"3246_CR49","doi-asserted-by":"crossref","unstructured":"Chen L, Ye D, Zhang G (2013). Online scheduling on a CPU\u2013GPU cluster. In: Chan TH, Lau LC, Trevisan L (eds) Theory and applications of models of computation, TAMC 2013, Lecture notes in computer science, vol 7876, pp 1\u20139","DOI":"10.1007\/978-3-642-38236-9_1"},{"key":"3246_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04119-7","author":"Z Zhou","year":"2019","unstructured":"Zhou Z, Li F, Zhu H et al (2019) An improved genetic algorithm using greedy strategy toward task scheduling optimization in cloud environments. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-019-04119-7","journal-title":"Neural Comput Appl"},{"key":"3246_CR51","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10586-019-02908-2","volume":"23","author":"M Mortazavi-Dehkordi","year":"2020","unstructured":"Mortazavi-Dehkordi M, Zamanifar K (2020) Efficient deadline-aware scheduling for the analysis of Big Data streams in public Cloud. Cluster Comput 23:241\u2013263","journal-title":"Cluster Comput"},{"key":"3246_CR52","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10586-009-0119-6","volume":"13","author":"S Baskiyar","year":"2010","unstructured":"Baskiyar S, Abdel-Kader R (2010) Energy aware DAG scheduling on heterogeneous systems. Cluster Comput 13:373\u2013383","journal-title":"Cluster Comput"},{"key":"3246_CR53","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10586-013-0297-0","volume":"17","author":"J Mei","year":"2014","unstructured":"Mei J, Li K, Li K (2014) Energy-aware task scheduling in heterogeneous computing environments. Cluster Comput 17:537\u2013550","journal-title":"Cluster Comput"},{"key":"3246_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-019-02965-7","author":"AK Maurya","year":"2019","unstructured":"Maurya AK, Modi K, Kumar V et al (2019) Energy-aware scheduling using slack reclamation for cluster systems. Cluster Comput. https:\/\/doi.org\/10.1007\/s10586-019-02965-7","journal-title":"Cluster Comput"},{"issue":"5","key":"3246_CR55","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1109\/32.135776","volume":"18","author":"L Kleinrock","year":"1992","unstructured":"Kleinrock L, Huang JH (1992) On parallel processing systems: Amdahl\u2019s law generalized and some results on optimal design. IEEE Trans Softw Eng 18(5):434\u2013447","journal-title":"IEEE Trans Softw Eng"},{"key":"3246_CR56","doi-asserted-by":"crossref","unstructured":"Downey AB (1997a) A model for speedup of parallel programs. UC Berkeley EECS Technical Report No. UCB\/CSD-97-933","DOI":"10.21236\/ADA637068"},{"key":"3246_CR57","unstructured":"Downey AB (1997b) A parallel workload model and its implications for processor allocation. In: Proceedings of the 6th international symposium on high performance distributed computing"},{"key":"3246_CR58","volume-title":"Introduction to parallel computing","author":"TG Lewis","year":"1992","unstructured":"Lewis TG, Rewini HE (1992) Introduction to parallel computing. Prentice-Hall International, Upper Saddle River"},{"key":"3246_CR59","doi-asserted-by":"crossref","unstructured":"Radulescu A, Nicolescu C, van Gemund AJC, Jonker PP (2001) CPR: mixed task and data parallel scheduling for distributed systems. In: Proceedings of the 15th international parallel and distributed processing symposium","DOI":"10.1109\/ICPP.2001.952048"},{"key":"3246_CR60","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1007\/s00607-018-0614-9","volume":"101","author":"S Memeti","year":"2019","unstructured":"Memeti S, Pllana S, Binotto A et al (2019) Using meta-heuristics and machine learning for software optimization of parallel computing systems: a systematic literature review. Computing 101:893\u2013936","journal-title":"Computing"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03246-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-020-03246-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03246-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T22:07:40Z","timestamp":1666130860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-020-03246-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,16]]},"references-count":60,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["3246"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03246-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,16]]},"assertion":[{"value":"16 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}