{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:55:35Z","timestamp":1759334135066,"version":"build-2065373602"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1109\/tpds.2025.3605272","type":"journal-article","created":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T17:32:16Z","timestamp":1756834336000},"page":"2297-2309","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Fork-Joins With Communication Delays and Equal Processing Times on Heterogeneous Processors"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2355-6074","authenticated-orcid":false,"given":"Huijun","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Electrical, Computer, and Software Engineering, University of Auckland, Auckland, New Zealand"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1550-7416","authenticated-orcid":false,"given":"Oliver","family":"Sinnen","sequence":"additional","affiliation":[{"name":"Department of Electrical, Computer, and Software Engineering, University of Auckland, Auckland, New Zealand"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80008-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.22"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367562"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/2831360.2831365"},{"year":"2004","key":"ref5","article-title":"Open MPI documentation"},{"key":"ref6","first-page":"543","article-title":"A new algorithm for the scheduling of tree structured tasks","volume-title":"Proc. Conf. Inf. Sci. Syst.","author":"Davida"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(99)00003-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2008.09.001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/0604011"},{"issue":"3","key":"ref10","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1287\/moor.2.3.275","article-title":"Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness","volume":"2","author":"Brucker","year":"1977","journal-title":"Math. Operations Res."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0212018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3387110"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-310-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.02.011"},{"issue":"1","key":"ref15","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(87)90042-4","article-title":"UET scheduling with unit interprocessor communication delays","volume":"18","author":"Rayward-Smith","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.04.009"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0208031"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480101394999"},{"key":"ref19","first-page":"105","article-title":"A fixed-parameter algorithm for scheduling unit dependent tasks with unit communication delays","volume-title":"Proc. 27th Int. Conf. Parallel Distrib. Comput.","author":"Munier"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.11.024"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322090"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/s0167-5060(08)70743-x"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS54959.2023.00087"},{"article-title":"Scheduling and code generation for parallel architectures","year":"1993","author":"Yang","key":"ref24"},{"issue":"2","key":"ref25","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0020-0190(01)00257-5","article-title":"On scheduling send-graphs and receive-graphs under the logp-model","volume":"82","author":"Zimmermann","year":"2002","journal-title":"Inf. Process. Lett."},{"issue":"9","key":"ref26","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1016\/S0167-8191(00)00029-6","article-title":"Scheduling outtrees of height one in the logp model","volume":"26","author":"Verriet","year":"2000","journal-title":"Parallel Comput."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-017-0550-0"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_47"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585745"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48224-5_69"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29400-7_9"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5573"},{"key":"ref33","first-page":"48:1","article-title":"Scheduling fork-join task graphs with communication delays and equal processing times","volume-title":"Proc. Int. Conf. Parallel Process.","author":"Sinnen"},{"issue":"3","key":"ref34","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0377-2217(92)90346-B","article-title":"Task scheduling with interprocessor communication delays","volume":"57","author":"Chr\u00e9tienne","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-011-0231-3"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018950911030"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-5595-4"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"ref39","doi-asserted-by":"crossref","DOI":"10.1002\/0470121173","volume-title":"Task Scheduling for Parallel Systems","author":"Sinnen","year":"2007"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/71.503776"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/71\/11182288\/11146908.pdf?arnumber=11146908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T13:00:06Z","timestamp":1759237206000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11146908\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":40,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2025.3605272","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"type":"print","value":"1045-9219"},{"type":"electronic","value":"1558-2183"},{"type":"electronic","value":"2161-9883"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}