{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:07:32Z","timestamp":1759334852971,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031971952"},{"type":"electronic","value":"9783031971969"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"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":[[2026]]},"DOI":"10.1007\/978-3-031-97196-9_5","type":"book-chapter","created":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T22:23:56Z","timestamp":1759271036000},"page":"56-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Futures in\u00a0Task Graphs \u2013 Extending Taskflow with Dynamic Data Dependencies"],"prefix":"10.1007","author":[{"given":"R\u00fcdiger","family":"Nather","sequence":"first","affiliation":[]},{"given":"Claudia","family":"Fohry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"5_CR1","unstructured":"Aiken, A., Bauer, M.: Programming with Legion (2023). https:\/\/legion.stanford.edu\/pdfs\/legion-manual.pdf. Accessed 02 Apr 2025"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/872736.806932","volume":"64","author":"HC Baker","year":"1977","unstructured":"Baker, H.C., Hewitt, C.: The incremental garbage collection of processes. ACM SIGART Bull. 64, 55\u201359 (1977). https:\/\/doi.org\/10.1145\/872736.806932","journal-title":"ACM SIGART Bull."},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Blelloch, G.E., Reid-Miller, M.: Pipelining with futures. In: Proceedings of the ACM Symposium on Parallel Algorithms and Architectures - SPAA (1997). https:\/\/doi.org\/10.1145\/258492.258517","DOI":"10.1145\/258492.258517"},{"issue":"8","key":"5_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/209937.209958","volume":"30","author":"RD Blumofe","year":"1995","unstructured":"Blumofe, R.D., Joerg, C.F., Kuszmaul, B.C., Leiserson, C.E., Randall, K.H., Zhou, Y.: Cilk: an efficient multithreaded runtime system. ACM SigPlan Not. 30(8), 207\u2013216 (1995)","journal-title":"ACM SigPlan Not."},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Carratal\u00e1-S\u00e1ez, R., Faverge, M., Pichon, G., Sylvand, G., Quintana-Ort\u00ed, E.S.: Tiled algorithms for efficient task-parallel H-Matrix solvers. In: IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 757\u2013766 (2020). https:\/\/doi.org\/10.1109\/IPDPSW50202.2020.00131","DOI":"10.1109\/IPDPSW50202.2020.00131"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Hackbusch, W.: A Sparse Matrix Arithmetic Based on $$\\cal H\\it $$-matrices. Part I: Introduction to $$\\cal H\\it $$-matrices. Computing 62(2), 89\u2013108 (1999)","DOI":"10.1007\/s006070050015"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/4472.4478","volume":"7","author":"RH Halstead","year":"1985","unstructured":"Halstead, R.H.: MULTILISP: a language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7(4), 501\u2013538 (1985). https:\/\/doi.org\/10.1145\/4472.4478","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"6","key":"5_CR8","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":"5_CR9","doi-asserted-by":"publisher","unstructured":"Kaiser, H., Heller, T., Adelstein-Lelbach, B., Serio, A., Fey, D.: HPX: a task based programming model in a global address space. In: Proceedings of the 8th International Conference on Partitioned Global Address Space Programming Models (2014). https:\/\/doi.org\/10.1145\/2676870.2676883","DOI":"10.1145\/2676870.2676883"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Nather, R., Fohry, C.: Futures for dynamic dependencies\u2013parallelizing the $$\\cal{H}$$-LU factorization. In: Workshop on Asynchronous Many-Task Systems and Applications, pp. 9\u201321. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-61763-8_2"},{"key":"5_CR11","unstructured":"OpenMP Architecture Review Board: OpenMP. http:\/\/www.openmp.org\/"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Singer, K., Xu, Y., Lee, I.T.A.: Proactive work stealing for futures. In: Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming (2019). https:\/\/doi.org\/10.1145\/3293883.3295735","DOI":"10.1145\/3293883.3295735"}],"container-title":["Lecture Notes in Computer Science","Asynchronous Many-Task Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97196-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T22:23:57Z","timestamp":1759271037000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97196-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783031971952","9783031971969"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97196-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Asynchronous Many-Task Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Louis, MO","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wamta2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wamta25.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}