{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T04:50:42Z","timestamp":1773982242606,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031312083","type":"print"},{"value":"9783031312090","type":"electronic"}],"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-31209-0_7","type":"book-chapter","created":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T15:11:26Z","timestamp":1682953886000},"page":"97-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Programming Heterogeneous Architectures Using Hierarchical Tasks"],"prefix":"10.1007","author":[{"given":"Mathieu","family":"Faverge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathalie","family":"Furmento","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdou","family":"Guermouche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gwenol\u00e9","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raymond","family":"Namyst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Thibault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Andr\u00e9","family":"Wacrenier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,2]]},"reference":[{"key":"7_CR1","first-page":"473","volume":"2","author":"E Agullo","year":"2011","unstructured":"Agullo, E., Augonnet, C., Dongarra, J., Ltaief, H., Namyst, R., Thibault, S., Tomov, S.: A hybridization methodology for high-performance linear algebra software for GPUs. GPU Comput. Gems Jade Edition 2, 473\u2013484 (2011)","journal-title":"GPU Comput. Gems Jade Edition"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Akbudak, K., Ltaief, H., Mikhalev, A., Keyes, D.: Tile low rank cholesky factorization for climate\/weather modeling applications on manycore architectures (2017)","DOI":"10.1007\/978-3-319-58667-0_2"},{"key":"7_CR3","unstructured":"Allen, R., Kennedy, K.: Optimizing Compilers for Modern Architectures: A Dependence-Based Approach. Morgan Kaufmann, Burlington (2002)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"\u00c1lvarez, D., Sala, K., Maro\u00f1as, M., Roca, A., Beltran, V.: Advanced synchronization techniques for task-based runtime systems. In: Proceedings of PPoPP 2021, pp. 334\u2013347 (2021)","DOI":"10.1145\/3437801.3441601"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/cpe.1631","volume":"23","author":"C Augonnet","year":"2011","unstructured":"Augonnet, C., Thibault, S., Namyst, R., Wacrenier, P.A.: StarPU: a unified platform for task scheduling on heterogeneous multicore architectures. Concurr. Comput. Pract. Exper. 23, 187\u2013198 (2011)","journal-title":"Concurr. Comput. Pract. Exper."},{"key":"7_CR6","unstructured":"Augonnet, C., Goudin, D., Kuhn, M., Lacoste, X., Namyst, R., Ramet, P.: A hierarchical fast direct solver for distributed memory machines with manycore nodes. Technical Report, October 2019. https:\/\/hal-cea.archives-ouvertes.fr\/cea-02304706"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bosilca, G., et al.: Flexible development of dense linear algebra algorithms on massively parallel architectures with DPLASMA. In: IEEE IPDPS Workshops and Phd Forum, pp. 1432\u20131441 (2011)","DOI":"10.1109\/IPDPS.2011.299"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jocs.2019.02.004","volume":"33","author":"R Carratala-Saez","year":"2019","unstructured":"Carratala-Saez, R., Christophersen, S., Aliaga, J.I., Beltran, V., Borm, S., Quintana-Orti, E.S.: Exploiting nested task-parallelism in the H-LU factorization. J. Comput. Sci. 33, 20\u201333 (2019)","journal-title":"J. Comput. Sci."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.parco.2018.10.007","volume":"83","author":"T Cojean","year":"2019","unstructured":"Cojean, T., Guermouche, A., Hugo, A., Namyst, R., Wacrenier, P.: Resource aggregation for task-based Cholesky Factorization on top of modern architectures. Parallel Comput. 83, 73\u201392 (2019)","journal-title":"Parallel Comput."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Cosnard, M., Jeannot, E., Yang, T.: Slc: symbolic scheduling for executing parameterized task graphs on multiprocessors. In: Proceedings of ICPP 1999, pp. 413\u2013421 (1999)","DOI":"10.1109\/ICPP.1999.797429"},{"issue":"4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1177\/1094342021997558","volume":"35","author":"H Elshazly","year":"2021","unstructured":"Elshazly, H., Lordan, F., Ejarque, J., Badia, R.M.: Accelerated execution via eager-release of dependencies in task-based workflows. Int. J. High Perform. Comput. Appl. 35(4), 325\u2013343 (2021)","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Gautier, T., Lima, J.V.F., Maillard, N., Raffin, B.: Xkaapi: a runtime system for data-flow task programming on heterogeneous architectures. In: Proceedings of IPDPS 2013, pp. 1299\u20131308 (2013)","DOI":"10.1109\/IPDPS.2013.66"},{"issue":"6","key":"7_CR13","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1109\/TPDS.2021.3104255","volume":"33","author":"TW Huang","year":"2021","unstructured":"Huang, T.W., Lin, D.L., Lin, C.X., Lin, Y.: Taskflow: a lightweight parallel and heterogeneous task graph computing system. IEEE Trans. Parallel Distrib. Syst. 33(6), 1303\u20131320 (2021)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Kim, J., Lee, S., Johnston, B., Vetter, J.S.: Iris: a portable runtime system exploiting multiple heterogeneous programming systems. In: Proceedings of HPEC 2021, pp. 1\u20138 (2021)","DOI":"10.1109\/HPEC49654.2021.9622873"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Maro\u00f1as, M., Sala, K., Mateo, S., Ayguad\u00e9, E., Beltran, V.: Worksharing tasks: an efficient way to exploit irregular and fine-grained loop parallelism. In: Proceedings of of HiPC 2019, pp. 383\u2013394 (2019)","DOI":"10.1109\/HiPC.2019.00053"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Perez, J.M., Beltran, V., Labarta, J., Ayguad\u00e9, E.: Improving the integration of task nesting and dependencies in OpenMP. In: Proceedings of IPDPS 2017, pp. 809\u2013818 (2017)","DOI":"10.1109\/IPDPS.2017.69"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.jpdc.2019.12.002","volume":"138","author":"P Valero-Lara","year":"2020","unstructured":"Valero-Lara, P., Catal\u00e1n, S., Martorell, X., Usui, T., Labarta, J.: sLASs: a fully automatic auto-tuned linear algebra library based on OpenMP extensions implemented in OmpSs. J. Parallel Distrib. Comput. 138, 153\u2013171 (2020)","journal-title":"J. Parallel Distrib. Comput."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Wu, W., Bouteiller, A., Bosilca, G., Faverge, M., Dongarra, J.: Hierarchical DAG scheduling for hybrid distributed systems. In: Proceedings of IPDPS 2015, pp. 156\u2013165 (2015)","DOI":"10.1109\/IPDPS.2015.56"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2022: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-31209-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T14:51:53Z","timestamp":1729349513000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-31209-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031312083","9783031312090"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-31209-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"2 May 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":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.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":"102","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":"25","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":"25% - 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-4","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)"}},{"value":"For the workshops, 24 papers have been accepted from a total of 35 submissions.","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)"}}]}}