{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:25:12Z","timestamp":1766269512200,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Collaborative Research Center (CRC) 1404 - FONDA"],"award-info":[{"award-number":["Collaborative Research Center (CRC) 1404 - FONDA"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,12]]},"DOI":"10.1145\/3673038.3673068","type":"proceedings-article","created":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T18:29:01Z","timestamp":1723141741000},"page":"305-316","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Mapping Large Memory-constrained Workflows onto Heterogeneous Platforms\u2731"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2108-9425","authenticated-orcid":false,"given":"Svetlana","family":"Kulagina","sequence":"first","affiliation":[{"name":"Department of Computer Science, Humboldt-Universit\u00e4t zu Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7769-726X","authenticated-orcid":false,"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Humboldt-Universit\u00e4t zu Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2910-3540","authenticated-orcid":false,"given":"Anne","family":"Benoit","sequence":"additional","affiliation":[{"name":"LIP laboratory, ENS Lyon, France"}]}],"member":"320","published-online":{"date-parts":[[2024,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3325097"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-016-1917-2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3538712.3538739"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.11.1_27"},{"key":"e_1_3_2_1_5_1","first-page":"171","article-title":"Contention awareness and fault tolerant scheduling for precedence constrained tasks in heterogeneous systems","volume":"23","author":"Benoit Anne","year":"2009","unstructured":"Anne Benoit, Mourad Hakem, and Yves Robert. 2009. Contention awareness and fault tolerant scheduling for precedence constrained tasks in heterogeneous systems. Parallel Comput. 23 (2009), 171\u2013187.","journal-title":"Parallel Comput."},{"key":"e_1_3_2_1_6_1","volume-title":"Scheduling in distributed systems: A cloud computing perspective. Computer science review 30","author":"Bittencourt F","year":"2018","unstructured":"Luiz\u00a0F Bittencourt, Alfredo Goldman, Edmundo\u00a0RM Madeira, Nelson\u00a0LS da Fonseca, and Rizos Sakellariou. 2018. Scheduling in distributed systems: A cloud computing perspective. Computer science review 30 (2018), 31\u201354."},{"volume-title":"Scheduling Algorithms","author":"Brucker Peter","key":"e_1_3_2_1_7_1","unstructured":"Peter Brucker. 2004. Scheduling Algorithms. Springer-Verlag."},{"key":"e_1_3_2_1_8_1","first-page":"12","article-title":". More Recent Advances in (Hyper)Graph Partitioning","volume":"55","author":"\u00c7ataly\u00fcrek V.","year":"2022","unstructured":"\u00dcmit\u00a0V. \u00c7ataly\u00fcrek, Karen\u00a0D. Devine, Marcelo Faraj, 2022. More Recent Advances in (Hyper)Graph Partitioning. ACM Comput. Surv. 55, 12 (Nov 2022).","journal-title":"ACM Comput. Surv."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2021.09.043"},{"key":"e_1_3_2_1_10_1","volume-title":"The nf-core framework for community-curated bioinformatics pipelines. Nature biotechnology 38, 3","author":"Ewels A","year":"2020","unstructured":"Philip\u00a0A Ewels, Alexander Peltzer, Sven Fillinger, Harshil Patel, Johannes Alneberg, Andreas Wilm, Maxime\u00a0Ulysse Garcia, Paolo Di\u00a0Tommaso, and Sven Nahnsen. 2020. The nf-core framework for community-curated bioinformatics pipelines. Nature biotechnology 38, 3 (2020), 276\u2013278."},{"key":"e_1_3_2_1_11_1","first-page":"13","article-title":"Parallel scheduling of task trees with limited memory","volume":"2","author":"Eyraud-Dubois Lionel","year":"2015","unstructured":"Lionel Eyraud-Dubois, Loris Marchal, Oliver Sinnen, and Fr\u00e9d\u00e9ric Vivien. 2015. Parallel scheduling of task trees with limited memory. ACM Trans. on Par. Computing 2, 2 (2015), 13.","journal-title":"ACM Trans. on Par. Computing"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICINIS.2015.42"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey R.","key":"e_1_3_2_1_13_1","unstructured":"M.\u00a0R. Garey and D.\u00a0S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.2971200"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Suna He Jigang Wu Bing Wei and Jiaxin Wu. 2021. Task Tree Partition and Subtree Allocation for Heterogeneous Multiprocessors. In 2021 IEEE Intl. Conf. on Par. Distr. Processing with Applic. Big Data Cloud Comp Sustainable Comp Communications Social Comp Networking. 571\u2013577.","DOI":"10.1109\/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00084"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1176865"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.60"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.09.037"},{"key":"e_1_3_2_1_19_1","volume-title":"Mapping tree-shaped workflows on systems with different memory sizes and processor speeds. Concurrency and Computation: Practice and Experience","author":"Kulagina Svetlana","year":"2023","unstructured":"Svetlana Kulagina, Henning Meyerhenke, and Anne Benoit. 2023. Mapping tree-shaped workflows on systems with different memory sizes and processor speeds. Concurrency and Computation: Practice and Experience (2023)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.02.012"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13222-021-00397-5"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCC49832.2020.00026"},{"key":"e_1_3_2_1_23_1","volume-title":"A Survey of Scheduling Frameworks in Big Data Systems. Intl. J. of Cloud Computing 7 (01","author":"Liu Ji","year":"2018","unstructured":"Ji Liu, Esther Pacitti, and Patrick Valduriez. 2018. A Survey of Scheduling Frameworks in Big Data Systems. Intl. J. of Cloud Computing 7 (01 2018)."},{"key":"e_1_3_2_1_24_1","volume-title":"Graph Partitioning with Acyclicity Constraints. In 16th Intl. Symp. on Experim. Algorithms, SEA 2017(LIPIcs, Vol.\u00a075)","author":"Moreira Orlando","year":"2017","unstructured":"Orlando Moreira, Merten Popp, and Christian Schulz. 2017. Graph Partitioning with Acyclicity Constraints. In 16th Intl. Symp. on Experim. Algorithms, SEA 2017(LIPIcs, Vol.\u00a075). Schloss Dagstuhl - Leibniz-Zentrum f. Informatik, 30:1\u201330:15."},{"key":"e_1_3_2_1_25_1","volume-title":"Processing Symp. (IPDPS). IEEE, 155\u2013165","author":"\u00d6zkaya M\u00a0Yusuf","year":"2019","unstructured":"M\u00a0Yusuf \u00d6zkaya, Anne Benoit, Bora U\u00e7ar, Julien Herrmann, and \u00dcmit\u00a0V \u00c7ataly\u00fcrek. 2019. A scalable clustering-based task scheduler for homogeneous processors using DAG partitioning. In 2019 IEEE Intl. Parallel and Distrib. Processing Symp. (IPDPS). IEEE, 155\u2013165."},{"volume-title":"Task scheduling for parallel systems. Vol.\u00a060","author":"Sinnen Oliver","key":"e_1_3_2_1_26_1","unstructured":"Oliver Sinnen. 2007. Task scheduling for parallel systems. Vol.\u00a060. John Wiley & Sons."},{"key":"e_1_3_2_1_27_1","volume-title":"Principles for data analysis workflows. PLOS Computational Biology 17, 3 (03","author":"Stoudt Sara","year":"2021","unstructured":"Sara Stoudt, V\u00e1leri\u00a0N. V\u00e1squez, and Ciera\u00a0C. Martinez. 2021. Principles for data analysis workflows. PLOS Computational Biology 17, 3 (03 2021), 1\u201326."}],"event":{"name":"ICPP '24: the 53rd International Conference on Parallel Processing","acronym":"ICPP '24","location":"Gotland Sweden"},"container-title":["Proceedings of the 53rd International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3673038.3673068","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3673038.3673068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T17:32:03Z","timestamp":1758648723000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3673038.3673068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,12]]},"references-count":27,"alternative-id":["10.1145\/3673038.3673068","10.1145\/3673038"],"URL":"https:\/\/doi.org\/10.1145\/3673038.3673068","relation":{},"subject":[],"published":{"date-parts":[[2024,8,12]]},"assertion":[{"value":"2024-08-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}