{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T07:33:51Z","timestamp":1766561631837,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031617621"},{"type":"electronic","value":"9783031617638"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-61763-8_2","type":"book-chapter","created":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T11:02:02Z","timestamp":1716980522000},"page":"9-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Futures for\u00a0Dynamic Dependencies \u2013 Parallelizing the\u00a0$$\\mathcal {H}$$-LU Factorization"],"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":[[2024,5,30]]},"reference":[{"key":"2_CR1","unstructured":"Aiken, A., Bauer, M.: Programming with Legion (2023). https:\/\/legion.stanford.edu\/pdfs\/legion-manual.pdf. Accessed 27 Feb 2024"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Aliaga, J.I., Carratal\u00e1-S\u00e1ez, R., Kriemann, R., Quintana-Ort\u00ed, E.S.: Task-parallel LU factorization of hierarchical matrices using OmpSs. In: IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 1148\u20131157 (2017). https:\/\/doi.org\/10.1109\/IPDPSW.2017.124","DOI":"10.1109\/IPDPSW.2017.124"},{"key":"2_CR3","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, CEA\/DAM, Total E &P, Universit\u00e9 de Bordeaux (2019). https:\/\/cea.hal.science\/cea-02304706"},{"key":"2_CR4","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":"2_CR5","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"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0024-3795(90)90302-S","volume":"129","author":"JJ Buoni","year":"1990","unstructured":"Buoni, J.J.: A stable method for the incomplete factorization of H-matrices. Linear Algebra Appl. 129, 143\u2013154 (1990). https:\/\/doi.org\/10.1016\/0024-3795(90)90302-S","journal-title":"Linear Algebra Appl."},{"key":"2_CR7","unstructured":"B\u00f6rm, S.: $$\\cal{H}2$$-lib (2023). https:\/\/www.h2lib.org\/. Accessed 28 Feb 2024"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jocs.2019.02.004","volume":"33","author":"R Carratal\u00e1-S\u00e1ez","year":"2019","unstructured":"Carratal\u00e1-S\u00e1ez, R., Christophersen, S., Aliaga, J.I., Beltran, V., B\u00f6rm, S., Quintana-Ort\u00ed, E.S.: Exploiting nested task-parallelism in the H-LU factorization. J. Comput. Sci. 33, 20\u201333 (2019). https:\/\/doi.org\/10.1016\/j.jocs.2019.02.004","journal-title":"J. Comput. Sci."},{"key":"2_CR9","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":"2_CR10","unstructured":"Barcelona Supercomputing Center: OmpSs-2 Specification (2023). https:\/\/pm.bsc.es\/ftp\/ompss-2\/doc\/spec\/. Accessed 06 Feb 2024"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00607-004-0103-1","volume":"74","author":"L Grasedyck","year":"2005","unstructured":"Grasedyck, L.: Adaptive recompression of H-matrices for BEM. Computing 74, 205\u2013223 (2005)","journal-title":"Computing"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00607-003-0019-1","volume":"70","author":"L Grasedyck","year":"2003","unstructured":"Grasedyck, L., Hackbusch, W.: Construction and arithmetics of H-matrices. Computing 70, 295\u2013334 (2003)","journal-title":"Computing"},{"issue":"4","key":"2_CR13","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."},{"key":"2_CR14","unstructured":"ISO: ISO\/IEC 14882:2011 Information Technology \u2013 Programming Languages \u2013 C++. International Organization for Standardization, Geneva, Switzerland (2011)"},{"key":"2_CR15","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"},{"issue":"3","key":"2_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s00791-014-0226-7","volume":"16","author":"R Kriemann","year":"2013","unstructured":"Kriemann, R.: H-LU factorization on many-core systems. Comput. Vis. Sci. 16(3), 105\u2013117 (2013). https:\/\/doi.org\/10.1007\/s00791-014-0226-7","journal-title":"Comput. Vis. Sci."},{"key":"2_CR17","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-61763-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T11:02:10Z","timestamp":1716980530000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-61763-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031617621","9783031617638"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-61763-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"30 May 2024","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":"Knoxville","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wamta2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wamta24.icl.utk.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}