{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:29Z","timestamp":1740123509500,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T00:00:00Z","timestamp":1649894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T00:00:00Z","timestamp":1649894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Task graphs provide a simple way to describe scientific workflows (sets of tasks with dependencies) that can be executed on both HPC clusters and in the cloud. An important aspect of executing such graphs is the used scheduling algorithm. Many scheduling heuristics have been proposed in existing works; nevertheless, they are often tested in oversimplified environments. We provide an extensible simulation environment designed for prototyping and benchmarking task schedulers, which contains implementations of various scheduling algorithms and is open-sourced, in order to be fully reproducible. We use this environment to perform a comprehensive analysis of workflow scheduling algorithms with a focus on quantifying the effect of scheduling challenges that have so far been mostly neglected, such as delays between scheduler invocations or partially unknown task durations. Our results indicate that network models used by many previous works might produce results that are off by an order of magnitude in comparison to a more realistic model. Additionally, we show that certain implementation details of scheduling algorithms which are often neglected can have a large effect on the scheduler\u2019s performance, and they should thus be described in great detail to enable proper evaluation.<\/jats:p>","DOI":"10.1007\/s11227-022-04438-y","type":"journal-article","created":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T11:04:20Z","timestamp":1649934260000},"page":"15154-15180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of workflow schedulers in simulated distributed environments"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3758-2836","authenticated-orcid":false,"given":"Jakub","family":"Ber\u00e1nek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanislav","family":"B\u00f6hm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vojt\u011bch","family":"Cima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,14]]},"reference":[{"issue":"12","key":"4438_CR1","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/361604.361619","volume":"17","author":"TL Adam","year":"1974","unstructured":"Adam TL, Chandy KM, Dickson JR (1974) A comparison of list schedules for parallel processing systems. Commun ACM 17(12):685\u2013690. https:\/\/doi.org\/10.1145\/361604.361619","journal-title":"Commun ACM"},{"issue":"4","key":"4438_CR2","doi-asserted-by":"publisher","first-page":"5097","DOI":"10.1145\/3325097","volume":"52","author":"M Adhikari","year":"2019","unstructured":"Adhikari M, Amgoth T, Srirama SN (2019) A survey on scheduling strategies for workflows in cloud environment and emerging trends. ACM Comput Surv 52(4):5097. https:\/\/doi.org\/10.1145\/3325097","journal-title":"ACM Comput Surv"},{"key":"4438_CR3","doi-asserted-by":"publisher","unstructured":"Amstutz P, Crusoe MR, Tijani\u0107 N et\u00a0al (2016) Common workflow language, v1.0. https:\/\/doi.org\/10.6084\/m9.figshare.3115156.v2","DOI":"10.6084\/m9.figshare.3115156.v2"},{"key":"4438_CR4","doi-asserted-by":"publisher","unstructured":"Babuji Y, Woodard A, Li Z, et\u00a0al (2019) Parsl: pervasive parallel programming in python. In: Proceedings of the 28th International Symposium on High-Performance Parallel and Distributed Computing. Association for Computing Machinery, New York, NY, USA, HPDC\u201919, pp 25\u201336. https:\/\/doi.org\/10.1145\/3307681.3325400","DOI":"10.1145\/3307681.3325400"},{"key":"4438_CR5","doi-asserted-by":"publisher","unstructured":"Bauer M, Garland M (2019) Legate numpy: accelerated and distributed array computing. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. Association for Computing Machinery, New York, NY, USA, SC\u201919. https:\/\/doi.org\/10.1145\/3295500.3356175","DOI":"10.1145\/3295500.3356175"},{"key":"4438_CR6","unstructured":"Baxter J, Patel JH (1989) The LAST algorithm: a heuristic-based static task allocation algorithm. In: Proceedings of the International Conference on Parallel Processing, ICPP\u201989, The Pennsylvania State University, University Park, PA, USA, August 1989. Volume 2: Software. Pennsylvania State University Press, pp 217\u2013222"},{"key":"4438_CR7","doi-asserted-by":"publisher","DOI":"10.5555\/121104","volume-title":"Data networks","author":"D Bertsekas","year":"1992","unstructured":"Bertsekas D, Gallager R (1992) Data networks, 2nd edn. Prentice-Hall, Upper Saddle River. https:\/\/doi.org\/10.5555\/121104","edition":"2"},{"key":"4438_CR8","doi-asserted-by":"publisher","unstructured":"Ber\u00e1nek J, B\u00f6hm S, Cima V (2019) Task graphs for benchmarking schedulers. https:\/\/doi.org\/10.5281\/zenodo.2630385","DOI":"10.5281\/zenodo.2630385"},{"key":"4438_CR9","doi-asserted-by":"publisher","unstructured":"Ber\u00e1nek J, B\u00f6hm S, Cima V (2019) Task scheduler performance survey results. https:\/\/doi.org\/10.5281\/zenodo.2630589","DOI":"10.5281\/zenodo.2630589"},{"key":"4438_CR10","doi-asserted-by":"publisher","unstructured":"Bohm S, Beranek J (2020) Runtime vs scheduler: analyzing dask\u2019s overheads. In: 2020 IEEE\/ACM Workflows in Support of Large-Scale Science (WORKS) https:\/\/doi.org\/10.1109\/works51914.2020.00006","DOI":"10.1109\/works51914.2020.00006"},{"key":"4438_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s10723-016-9390-y","author":"Z Cai","year":"2017","unstructured":"Cai Z, Li Q, Li X (2017) Elasticsim: a toolkit for simulating workflows with cloud resource runtime auto-scaling and stochastic task execution times. J Grid Comput. https:\/\/doi.org\/10.1007\/s10723-016-9390-y","journal-title":"J Grid Comput"},{"issue":"1","key":"4438_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.995","volume":"41","author":"RN Calheiros","year":"2011","unstructured":"Calheiros RN, Ranjan R, Beloglazov A et al (2011) Cloudsim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. Softw Pract Exper 41(1):23\u201350. https:\/\/doi.org\/10.1002\/spe.995","journal-title":"Softw Pract Exper"},{"key":"4438_CR13","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2942909","author":"LC Canon","year":"2019","unstructured":"Canon LC, Marchal L, Simon B et al (2019) Online scheduling of task graphs on heterogeneous platforms. IEEE Trans Parallel Distrib Syst. https:\/\/doi.org\/10.1109\/TPDS.2019.2942909","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4438_CR14","doi-asserted-by":"publisher","unstructured":"Casanova H (2001) Simgrid: a toolkit for the simulation of application scheduling. In: Proceedings First IEEE\/ACM International Symposium on Cluster Computing and the Grid, pp 430\u2013437. https:\/\/doi.org\/10.1109\/CCGRID.2001.923223","DOI":"10.1109\/CCGRID.2001.923223"},{"key":"4438_CR15","doi-asserted-by":"publisher","unstructured":"Casanova H, Pandey S, Oeth J, et\u00a0al (2018) Wrench: a framework for simulating workflow management systems. https:\/\/doi.org\/10.1109\/WORKS.2018.00013","DOI":"10.1109\/WORKS.2018.00013"},{"key":"4438_CR16","doi-asserted-by":"publisher","unstructured":"Chen W, Deelman E (2012) Workflowsim: a toolkit for simulating scientific workflows in distributed environments. pp 1\u20138. https:\/\/doi.org\/10.1109\/eScience.2012.6404430","DOI":"10.1109\/eScience.2012.6404430"},{"key":"4438_CR17","doi-asserted-by":"publisher","unstructured":"Cima V, B\u00f6hm S, Martinovic J, et\u00a0al (2018) Hyperloom: a platform for defining and executing scientific pipelines in distributed environments, pp 1\u20136. https:\/\/doi.org\/10.1145\/3183767.3183768","DOI":"10.1145\/3183767.3183768"},{"issue":"1","key":"4438_CR18","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum L, Menon R (1998) Openmp: an industry standard api for shared-memory programming. IEEE Comput Sci Eng 5(1):46\u201355. https:\/\/doi.org\/10.1109\/99.660313","journal-title":"IEEE Comput Sci Eng"},{"issue":"1","key":"4438_CR19","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0196-6774(84)90039-7","volume":"5","author":"D Dolev","year":"1984","unstructured":"Dolev D, Warmuth MK (1984) Scheduling precedence graphs of bounded height. J Algorithms 5(1):48\u201359. https:\/\/doi.org\/10.1016\/0196-6774(84)90039-7","journal-title":"J Algorithms"},{"key":"4438_CR20","doi-asserted-by":"publisher","unstructured":"Fakhfakh F, Kacem HH, Kacem AH (2017) Cloudsim4dwf: a cloudsim-extension for simulating dynamic workflows in a cloud environment. In: 2017 IEEE 15th International Conference on Software Engineering Research, Management and Applications (SERA), pp 195\u2013202, https:\/\/doi.org\/10.1109\/SERA.2017.7965728","DOI":"10.1109\/SERA.2017.7965728"},{"issue":"6","key":"4438_CR21","doi-asserted-by":"publisher","first-page":"490","DOI":"10.14311\/490","volume":"43","author":"T Hagras","year":"2003","unstructured":"Hagras T, Jane\u010dek J (2003) Static vs. dynamic list-scheduling performance comparison. Acta Polytech 43(6):490. https:\/\/doi.org\/10.14311\/490","journal-title":"Acta Polytech"},{"issue":"1","key":"4438_CR22","doi-asserted-by":"publisher","first-page":"8036","DOI":"10.1145\/3368036","volume":"53","author":"MH Hilman","year":"2020","unstructured":"Hilman MH, Rodriguez MA, Buyya R (2020) Multiple workflows scheduling in multi-tenant distributed systems: a taxonomy and future directions. ACM Comput Surv 53(1):8036. https:\/\/doi.org\/10.1145\/3368036","journal-title":"ACM Comput Surv"},{"key":"4438_CR23","unstructured":"Jarry A, Casanova H, Berman F (2000) DAGSim: a simulator for DAG scheduling algorithms. Research Report LIP RR-2000-46, Laboratoire de l\u2019informatique du parall\u00e9lisme"},{"issue":"2","key":"4438_CR24","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/TPDS.2015.2407900","volume":"27","author":"Y Jiang","year":"2016","unstructured":"Jiang Y (2016) A survey of task allocation and load balancing in distributed systems. IEEE Trans Parallel Distrib Syst 27(2):585\u2013599. https:\/\/doi.org\/10.1109\/TPDS.2015.2407900","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"5","key":"4438_CR25","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/71.503776","volume":"7","author":"YK Kwok","year":"1996","unstructured":"Kwok YK, Ahmad I (1996) Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Trans Parallel Distrib Syst 7(5):506\u2013521. https:\/\/doi.org\/10.1109\/71.503776","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4438_CR26","doi-asserted-by":"publisher","unstructured":"Kwok YK, Ahmad I (1998) Benchmarking the task graph scheduling algorithms. In: Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, pp 531\u2013537. https:\/\/doi.org\/10.1109\/IPPS.1998.669967","DOI":"10.1109\/IPPS.1998.669967"},{"issue":"4","key":"4438_CR27","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"YK Kwok","year":"1999","unstructured":"Kwok YK, Ahmad I (1999) Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput Surv 31(4):406\u2013471. https:\/\/doi.org\/10.1145\/344588.344618","journal-title":"ACM Comput Surv"},{"issue":"1","key":"4438_CR28","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1186\/s13321-016-0179-6","volume":"8","author":"S Lampa","year":"2016","unstructured":"Lampa S, Alvarsson J, Spjuth O (2016) Towards agile large-scale predictive modelling in drug discovery with flow-based programming design principles. J Cheminform 8(1):67. https:\/\/doi.org\/10.1186\/s13321-016-0179-6","journal-title":"J Cheminform"},{"issue":"12","key":"4438_CR29","doi-asserted-by":"publisher","first-page":"3412","DOI":"10.1109\/TPDS.2016.2537821","volume":"27","author":"RV Lopes","year":"2016","unstructured":"Lopes RV, Menasc\u00e9 D (2016) A taxonomy of job scheduling on distributed computing systems. IEEE Trans Parallel Distrib Syst 27(12):3412\u20133428. https:\/\/doi.org\/10.1109\/TPDS.2016.2537821","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4438_CR30","doi-asserted-by":"publisher","unstructured":"Macey BS, Zomaya AY (1998) A performance evaluation of CP list scheduling heuristics for communication intensive task graphs. In: 12th International Parallel Processing Symposium\/9th Symposium on Parallel and Distributed Processing (IPPS\/SPDP\u201998), March 30\u2013April 3, 1998, Orlando, Florida, USA, Proceedings. IEEE Computer Society, pp 538\u2013541. https:\/\/doi.org\/10.1109\/IPPS.1998.669968","DOI":"10.1109\/IPPS.1998.669968"},{"key":"4438_CR31","unstructured":"Moritz P, Nishihara R, Wang S et\u00a0al (2018) Ray: A distributed framework for emerging ai applications. In: Proceedings of the 13th USENIX Conference on Operating Systems Design and Implementation. USENIX Association, USA, OSDI\u201918, pp 561\u2013577"},{"issue":"1","key":"4438_CR32","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.jpdc.2009.09.009","volume":"70","author":"FA Omara","year":"2010","unstructured":"Omara FA, Arafa MM (2010) Genetic algorithms for task scheduling problem. J Parallel Distrib Comput 70(1):13\u201322. https:\/\/doi.org\/10.1016\/j.jpdc.2009.09.009","journal-title":"J Parallel Distrib Comput"},{"key":"4438_CR33","doi-asserted-by":"crossref","unstructured":"Rocklin M (2015) Dask: parallel computation with blocked algorithms and task scheduling. In: Huff K, Bergstra J (eds) Proceedings of the 14th Python in Science Conference, pp 130\u2013136","DOI":"10.25080\/Majora-7b98e3ed-013"},{"issue":"2","key":"4438_CR34","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1109\/71.207593","volume":"4","author":"G Sih","year":"1993","unstructured":"Sih G, Lee E (1993) A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans Parallel Distrib Syst 4(2):175\u2013187. https:\/\/doi.org\/10.1109\/71.207593","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4438_CR35","doi-asserted-by":"publisher","unstructured":"Silva RFd, Chen W, Juve G et\u00a0al (2014) Community resources for enabling research in distributed scientific workflows. In: 2014 IEEE 10th International Conference on e-Science, pp 177\u2013184, https:\/\/doi.org\/10.1109\/eScience.2014.44","DOI":"10.1109\/eScience.2014.44"},{"issue":"6","key":"4438_CR36","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TPDS.2005.64","volume":"16","author":"O Sinnen","year":"2005","unstructured":"Sinnen O, Sousa LA (2005) Communication contention in task scheduling. IEEE Trans Parallel Distrib Syst 16(6):503\u2013515. https:\/\/doi.org\/10.1109\/TPDS.2005.64","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4438_CR37","doi-asserted-by":"publisher","unstructured":"Slaughter E, Aiken A (2019) Pygion: Flexible, scalable task-based parallelism with python, pp 58\u201372. https:\/\/doi.org\/10.1109\/PAW-ATM49560.2019.00011","DOI":"10.1109\/PAW-ATM49560.2019.00011"},{"issue":"1","key":"4438_CR38","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s11432-009-0010-3","volume":"52","author":"X Tang","year":"2009","unstructured":"Tang X, Li K, Padua D (2009) Communication contention in apn list scheduling algorithm. Sci China Inf Sci 52(1):59\u201369. https:\/\/doi.org\/10.1007\/s11432-009-0010-3","journal-title":"Sci China Inf Sci"},{"key":"4438_CR39","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.jpdc.2010.01.003","volume":"70","author":"X Tang","year":"2010","unstructured":"Tang X, Li K, Liao G et al (2010) List scheduling with duplication for heterogeneous computing systems. J Parallel Distrib Comput 70:323\u2013329. https:\/\/doi.org\/10.1016\/j.jpdc.2010.01.003","journal-title":"J Parallel Distrib Comput"},{"issue":"105","key":"4438_CR40","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.cor.2021.105414","volume":"134","author":"\u0130 Tarhan","year":"2021","unstructured":"Tarhan \u0130, Og\u0306uz C (2021) Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics. Comput Oper Res 134(105):414. https:\/\/doi.org\/10.1016\/j.cor.2021.105414","journal-title":"Comput Oper Res"},{"issue":"4","key":"4438_CR41","doi-asserted-by":"publisher","first-page":"1422","DOI":"10.1007\/s11227-018-2238-4","volume":"74","author":"P Thoman","year":"2018","unstructured":"Thoman P, Dichev K, Heller T et al (2018) A taxonomy of task-based parallel programming technologies for high-performance computing. J Supercomput 74(4):1422\u20131434. https:\/\/doi.org\/10.1007\/s11227-018-2238-4","journal-title":"J Supercomput"},{"issue":"3","key":"4438_CR42","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman JD (1975) Np-complete scheduling problems. J Comput Syst Sci 10(3):384\u2013393. https:\/\/doi.org\/10.1016\/S0022-0000(75)80008-0","journal-title":"J Comput Syst Sci"},{"key":"4438_CR43","doi-asserted-by":"publisher","unstructured":"Wang G, Guo H, Wang Y (2015) A novel heterogeneous scheduling algorithm with improved task priority. In: 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security, and 2015 IEEE 12th International Conference on Embedded Software and Systems, pp 1826\u20131831. https:\/\/doi.org\/10.1109\/HPCC-CSS-ICESS.2015.48","DOI":"10.1109\/HPCC-CSS-ICESS.2015.48"},{"issue":"8","key":"4438_CR44","doi-asserted-by":"publisher","first-page":"1736","DOI":"10.1109\/TPDS.2018.2808959","volume":"29","author":"H Wang","year":"2018","unstructured":"Wang H, Sinnen O (2018) List-scheduling versus cluster-scheduling. IEEE Trans Parallel Distrib Syst 29(8):1736\u20131749. https:\/\/doi.org\/10.1109\/TPDS.2018.2808959","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"4438_CR45","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/71.80160","volume":"1","author":"MY Wu","year":"1990","unstructured":"Wu MY, Gajski D (1990) Hypertool: a programming aid for message-passing systems. IEEE Trans Parallel Distrib Syst 1(3):330\u2013343. https:\/\/doi.org\/10.1109\/71.80160","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4438_CR46","doi-asserted-by":"publisher","unstructured":"Yao X, Geng P, Du X (2013) A task scheduling algorithm for multi-core processors. In: 2013 International Conference on Parallel and Distributed Computing, Applications and Technologies, pp 259\u2013264. https:\/\/doi.org\/10.1109\/PDCAT.2013.47","DOI":"10.1109\/PDCAT.2013.47"},{"key":"4438_CR47","doi-asserted-by":"publisher","unstructured":"Zulianto A, Kuspriyanto, Gondokaryono YS (2016) Hpc resources scheduling simulation using simdag. In: 2016 6th International Conference on Electronics Information and Emergency Communication (ICEIEC), pp 334\u2013337, https:\/\/doi.org\/10.1109\/ICEIEC.2016.7589751","DOI":"10.1109\/ICEIEC.2016.7589751"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04438-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04438-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04438-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T15:10:53Z","timestamp":1659971453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04438-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,14]]},"references-count":47,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["4438"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04438-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,4,14]]},"assertion":[{"value":"10 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}