{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T09:10:33Z","timestamp":1758705033191,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031396977"},{"type":"electronic","value":"9783031396984"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-39698-4_8","type":"book-chapter","created":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T06:02:40Z","timestamp":1692770560000},"page":"111-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hierarchical Management of\u00a0Extreme-Scale Task-Based Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9845-8890","authenticated-orcid":false,"given":"Francesc","family":"Lordan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5576-9912","authenticated-orcid":false,"given":"Gabriel","family":"Puigdemunt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4109-1071","authenticated-orcid":false,"given":"Pere","family":"Verg\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6401-6229","authenticated-orcid":false,"given":"Javier","family":"Conejero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4725-5097","authenticated-orcid":false,"given":"Jorge","family":"Ejarque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2941-5499","authenticated-orcid":false,"given":"Rosa M.","family":"Badia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,24]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1093\/nar\/gky379","volume":"46","author":"E Afgan","year":"2018","unstructured":"Afgan, E., et al.: The galaxy platform for accessible, reproducible and collaborative biomedical analyses: 2018 update. Nucleic Acids Res. 46(1), 537\u2013544 (2018)","journal-title":"Nucleic Acids Res."},{"key":"8_CR2","unstructured":"Cid-Fuentes, J.\u00c1., et al.: dislib: Large scale high performance machine learning in python. In: Proceedings of the 15th International Conference on eScience, pp. 96\u2013105 (2019)"},{"key":"8_CR3","unstructured":"Dask Development Team: Dask: Library for dynamic task scheduling (2016). https:\/\/dask.org"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1038\/nbt.3820","volume":"35","author":"P Di Tommaso","year":"2017","unstructured":"Di Tommaso, P., et al.: Nextflow enables reproducible computational workflows. Nat. Biotechnol. 35(4), 316\u2013319 (2017)","journal-title":"Nat. Biotechnol."},{"issue":"02","key":"8_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1142\/S0129626411000151","volume":"21","author":"A Duran","year":"2011","unstructured":"Duran, A., et al.: OmpSs: a proposal for programming heterogeneous multi-core architectures. Parallel Process. Lett. 21(02), 173\u2013193 (2011)","journal-title":"Parallel Process. Lett."},{"issue":"5","key":"8_CR6","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1177\/1094342019845438","volume":"33","author":"J Ejarque","year":"2019","unstructured":"Ejarque, J., et al.: A hierarchic task-based programming model for distributed heterogeneous computing. Int. J. High Perform. Comput. Appl. 33(5), 987\u2013997 (2019)","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"8_CR7","unstructured":"Graf, H., et al.: Parallel support vector machines: the cascade SVM. In: Advances in Neural Information Processing Systems, vol. 17 (2004)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Herault, T., et al.: Composition of algorithmic building blocks in template task graphs. In: 2022 IEEE\/ACM Parallel Applications Workshop: Alternatives To MPI+ X (PAW-ATM), pp. 26\u201338 (2022)","DOI":"10.1109\/PAW-ATM56565.2022.00008"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Ho, T.K.: Random decision forests. In: Proceedings of 3rd International Conference on Document Analysis and Recognition, vol. 1, pp. 278\u2013282 (1995)","DOI":"10.1109\/ICDAR.1995.598994"},{"key":"8_CR10","unstructured":"Intel Corporation: OneAPI TBB Nested parallelism (2022). https:\/\/oneapi-src.github.io\/oneTBB\/main\/tbb_userguide\/Cancellation_and_Nested_Parallelism.html"},{"issue":"1","key":"8_CR11","first-page":"77","volume":"29","author":"P Lerman","year":"1980","unstructured":"Lerman, P.: Fitting segmented regression models by grid search. J. R. Stat. Soc.: Ser. C: Appl. Stat. 29(1), 77\u201384 (1980)","journal-title":"J. R. Stat. Soc.: Ser. C: Appl. Stat."},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Lordan, F., et al.: Artifact and instructions to generate experimental results for the Euro-Par 2023 proceedings paper: hierarchical management of extreme-scale task-based applications. https:\/\/doi.org\/10.6084\/m9.figshare.23552229","DOI":"10.6084\/m9.figshare.23552229"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10723-013-9272-5","volume":"12","author":"F Lordan","year":"2014","unstructured":"Lordan, F., et al.: ServiceSs: an interoperable programming framework for the cloud. J. Grid Comput. 12(1), 67\u201391 (2014)","journal-title":"J. Grid Comput."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-030-85665-6_17","volume-title":"Euro-Par 2021: Parallel Processing","author":"F Lordan","year":"2021","unstructured":"Lordan, F., Lezzi, D., Badia, R.M.: Colony: parallel functions as a service on the cloud-edge continuum. In: Sousa, L., Roma, N., Tom\u00e1s, P. (eds.) Euro-Par 2021. LNCS, vol. 12820, pp. 269\u2013284. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85665-6_17"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"M\u00f6lder, F., et al.: Sustainable data analysis with snakemake. F1000Research 10(33) (2021)","DOI":"10.12688\/f1000research.29032.2"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Perez, J.M., et al.: Improving the integration of task nesting and dependencies in OpenMP. In: 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 809\u2013818 (2017)","DOI":"10.1109\/IPDPS.2017.69"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1177\/1094342009106195","volume":"23","author":"J Planas","year":"2009","unstructured":"Planas, J., et al.: Hierarchical task-based programming with StarSs. Int J. High Perform. Comput. Appl. 23(3), 284\u2013299 (2009)","journal-title":"Int J. High Perform. Comput. Appl."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Rabenseifner, R., et al.: Hybrid MPI\/OpenMP parallel programming on clusters of multi-core SMP nodes. In: 2009 17th Euromicro International Conference on Parallel, Distributed and Network-based Processing, pp. 427\u2013436 (2009)","DOI":"10.1109\/PDP.2009.43"},{"key":"8_CR19","unstructured":"Vandierendonck, H., et al.: Parallel programming of general-purpose programs using task-based programming models. In: 3rd USENIX Workshop on Hot Topics in Parallelism (HotPar 11) (2011)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Wozniak, J.M., et al.: Swift\/t: large-scale application composition via distributed-memory dataflow processing. In: 2013 13th IEEE\/ACM International Symposium on Cluster, Cloud, and Grid Computing, pp. 95\u2013102 (2013)","DOI":"10.1109\/CCGrid.2013.99"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Yoo, A.B., et al.: SLURM: simple Linux utility for resource management. In: Job Scheduling Strategies for Parallel Processing, pp. 44\u201360 (2003)","DOI":"10.1007\/10968987_3"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2023: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39698-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T16:34:01Z","timestamp":1729960441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39698-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031396977","9783031396984"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39698-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.euro-par.org\/","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":"164","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":"49","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":"0","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":"30% - 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":"3.98","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":"4","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)"}}]}}