{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:18:08Z","timestamp":1759133888386,"version":"3.37.3"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"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":[[2020,7,1]]},"DOI":"10.1109\/tpds.2020.2971200","type":"journal-article","created":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T00:44:16Z","timestamp":1580777056000},"page":"1533-1544","source":"Crossref","is-referenced-by-count":7,"title":["Partitioning Tree-Shaped Task Graphs for Distributed Platforms With Limited Memory"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6223-1547","authenticated-orcid":false,"given":"Changjiang","family":"Gou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2910-3540","authenticated-orcid":false,"given":"Anne","family":"Benoit","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5519-9913","authenticated-orcid":false,"given":"Loris","family":"Marchal","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2779052"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2018.00094"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.07.003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58943-5_14"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32589-2_34"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007931"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9802-3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/18M1176865"},{"key":"ref19","first-page":"155","article-title":"A scalable clustering-based task scheduler for homogeneous processors using DAG partitioning","author":"\u00f6zkaya","year":"2019","journal-title":"Proc IEEE Int Parallel Distrib Process Symp"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0608031"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00100"},{"journal-title":"Handbook of Scheduling Algorithms Models and Performance Analysis","year":"2004","author":"leung","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.60"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2629641"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0611010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cl.2010.09.003"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/7921.11325"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2808959"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1990","author":"garey","key":"ref22"},{"key":"ref21","article-title":"Is acyclic directed graph partitioning effective for locality-aware scheduling?","author":"\u00f6zkaya","year":"2019","journal-title":"Proc 13th Int Conf Parallel Process Appl Math"},{"article-title":"Partitioning tree-shaped task graphs for distributed platforms with limited memory","year":"2019","author":"gou","key":"ref23"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/9003718\/08979173.pdf?arnumber=8979173","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:40:33Z","timestamp":1651070433000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8979173\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,1]]},"references-count":23,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2020.2971200","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":[[2020,7,1]]}}}