{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:38Z","timestamp":1750220198494,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,29]]},"DOI":"10.1145\/3545008.3545036","type":"proceedings-article","created":{"date-parts":[[2023,1,15]],"date-time":"2023-01-15T01:04:08Z","timestamp":1673744648000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling Fork-Join Task Graphs with Communication Delays and Equal Processing Times"],"prefix":"10.1145","author":[{"given":"Huijun","family":"Wang","sequence":"first","affiliation":[{"name":"The Department of Electrical and Computer Engineering, University of Auckland, New Zealand"}]},{"given":"Oliver","family":"Sinnen","sequence":"additional","affiliation":[{"name":"The Department of Electrical and Computer Engineering, University of Auckland, New Zealand"}]}],"member":"320","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.11.024"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.3.275"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018950911030"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480101394999"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-5595-4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90346-B"},{"volume-title":"Proceedings of the Conference on Information Sciences and Systems. IEEE","author":"Davida G.I.","key":"e_1_3_2_1_7_1","unstructured":"G.I. Davida and D.J. Linton. 1976. A new algorithm for the scheduling of tree structured tasks. In Proceedings of the Conference on Information Sciences and Systems. IEEE, Baltimore, MD, 543\u2013548."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367562"},{"volume-title":"Workshop on New Challenges in Scheduling Theory.","author":"Dutot P.-F.","key":"e_1_3_2_1_9_1","unstructured":"P.-F. Dutot, Y.-S. Fu, N. Prasad, and O. Sinnen. 2018. Scheduling algorithms for large fork-join graphs with communication delay. Workshop on New Challenges in Scheduling Theory."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322090"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0604011"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210018"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.02.011"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-011-0231-3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2008.09.001"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.22"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70743-X"},{"volume-title":"Vol.\u00a029","author":"Lov\u00e1sz L\u00e1szl\u00f3","key":"e_1_3_2_1_20_1","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz and Michael\u00a0D Plummer. 1986. Matching theory. Annals of Discrete Mathematics, Vol.\u00a029. Elsevier, Amsterdam, Netherlands."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(99)00003-6"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208031"},{"key":"e_1_3_2_1_23_1","unstructured":"The Open\u00a0MPI project. 2004. Open MPI documentation. https:\/\/www.open-mpi.org\/doc\/. Accessed: 2022-04-20."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(87)90042-4"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.04.009"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2831360.2831365"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212018"},{"volume-title":"Euro-Par 2021: Parallel Processing, Leonel Sousa, Nuno Roma, and Pedro Tom\u00e1s (Eds.)","author":"Tang Ning","key":"e_1_3_2_1_28_1","unstructured":"Ning Tang and Alix\u00a0Munier Kordon. 2021. A fixed-parameter algorithm for scheduling unit dependent tasks with unit communication delays. In Euro-Par 2021: Parallel Processing, Leonel Sousa, Nuno Roma, and Pedro Tom\u00e1s (Eds.). Springer International Publishing, Cham, 105\u2013119."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80008-0"}],"event":{"name":"ICPP '22: 51st International Conference on Parallel Processing","acronym":"ICPP '22","location":"Bordeaux France"},"container-title":["Proceedings of the 51st International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545008.3545036","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3545008.3545036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:43Z","timestamp":1750186963000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545008.3545036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,29]]},"references-count":29,"alternative-id":["10.1145\/3545008.3545036","10.1145\/3545008"],"URL":"https:\/\/doi.org\/10.1145\/3545008.3545036","relation":{},"subject":[],"published":{"date-parts":[[2022,8,29]]},"assertion":[{"value":"2023-01-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}