{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:17Z","timestamp":1750220777472,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T00:00:00Z","timestamp":1590364800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19H04081, 20H00590, 20H04160"],"award-info":[{"award-number":["19H04081, 20H00590, 20H04160"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,5,25]]},"DOI":"10.1145\/3378678.3391875","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:21:35Z","timestamp":1590452495000},"page":"7-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling of moldable fork-join tasks with inter- and intra-task communications"],"prefix":"10.1145","author":[{"given":"Hiroki","family":"Nishikawa","sequence":"first","affiliation":[{"name":"Ritumeikan University, Kusatsu, Shiga, Japan"}]},{"given":"Kana","family":"Shimada","sequence":"additional","affiliation":[{"name":"Ritsumeikan University, Kusatsu, Shiga, Japan"}]},{"given":"Ittetsu","family":"Taniguchi","sequence":"additional","affiliation":[{"name":"Osaka University, Suita, Osaka, Japan"}]},{"given":"Hiroyuki","family":"Tomiyama","sequence":"additional","affiliation":[{"name":"Ritsumeikan University, Kusatsu, Shiga, Japan"}]}],"member":"320","published-online":{"date-parts":[[2020,5,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(96)00123-3"},{"key":"e_1_3_2_1_2_1","volume-title":"Models and Performance Analysis","author":"Dutot P. F.","year":"2004","unstructured":"P. F. Dutot , G. Mounie , and D. Trystram , \" Scheduling parallel tasks approximation algorithms,\" Handbook of Scheduling: Algorithms , Models and Performance Analysis , 2004 . P. F. Dutot, G. Mounie, and D. Trystram, \"Scheduling parallel tasks approximation algorithms,\" Handbook of Scheduling: Algorithms, Models and Performance Analysis, 2004."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.4.2_279"},{"key":"e_1_3_2_1_4_1","volume-title":"ILP based data parallel multi-task mapping\/scheduling technique for MPSoC,\" International SoC Design Conference","author":"Yang H.","year":"2008","unstructured":"H. Yang and S. Ha , \" ILP based data parallel multi-task mapping\/scheduling technique for MPSoC,\" International SoC Design Conference , 2008 . H. Yang and S. Ha, \"ILP based data parallel multi-task mapping\/scheduling technique for MPSoC,\" International SoC Design Conference, 2008."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2809780"},{"issue":"8","key":"e_1_3_2_1_6_1","article-title":"A 3.42-Approximation algorithm for scheduling moldable tasks under precedence constraints","volume":"24","author":"Chen C.","year":"2012","unstructured":"C. Chen and C. Chu , \" A 3.42-Approximation algorithm for scheduling moldable tasks under precedence constraints ,\" IEEE Transactions on Parallel and Distributed Systems , vol. 24 , no. 8 , 2012 . C. Chen and C. Chu, \"A 3.42-Approximation algorithm for scheduling moldable tasks under precedence constraints,\" IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 8, 2012.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"e_1_3_2_1_7_1","volume-title":"Scheduling of moldable fork-join tasks with constraint programming,\" International Synposium on Computing and Networking","author":"Nishikawa H.","year":"2018","unstructured":"H. Nishikawa , K. Shimada , I. Taniguchi , and H. Tomiyama , \" Scheduling of moldable fork-join tasks with constraint programming,\" International Synposium on Computing and Networking , 2018 . H. Nishikawa, K. Shimada, I. Taniguchi, and H. Tomiyama, \"Scheduling of moldable fork-join tasks with constraint programming,\" International Synposium on Computing and Networking, 2018."},{"key":"e_1_3_2_1_8_1","volume-title":"Communication-aware scheduling for moldable tasks,\" International Conference on Platform Technology and Service","author":"Shimada K.","year":"2019","unstructured":"K. Shimada , I. Taniguchi , and H. Tomiyama , \" Communication-aware scheduling for moldable tasks,\" International Conference on Platform Technology and Service , 2019 . K. Shimada, I. Taniguchi, and H. Tomiyama, \"Communication-aware scheduling for moldable tasks,\" International Conference on Platform Technology and Service, 2019."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2308175"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.05.028"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.01.005"},{"key":"e_1_3_2_1_12_1","volume-title":"TGFF: task graph for free,\" International Workshop on Hardware\/Software Codesign","author":"Dick R. P.","year":"1998","unstructured":"R. P. Dick , D. L. Rhodes and W. Wolf , \" TGFF: task graph for free,\" International Workshop on Hardware\/Software Codesign , 1998 . R. P. Dick, D. L. Rhodes and W. Wolf, \"TGFF: task graph for free,\" International Workshop on Hardware\/Software Codesign, 1998."}],"event":{"name":"SCOPES '20: 23rd International Workshop on Software and Compilers for Embedded Systems","sponsor":["SIGBED ACM Special Interest Group on Embedded Systems","EDAA European Design Automation Association"],"location":"St. Goar Germany","acronym":"SCOPES '20"},"container-title":["Proceedings of the 23th International Workshop on Software and Compilers for Embedded Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3378678.3391875","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3378678.3391875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:19Z","timestamp":1750200079000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3378678.3391875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,25]]},"references-count":12,"alternative-id":["10.1145\/3378678.3391875","10.1145\/3378678"],"URL":"https:\/\/doi.org\/10.1145\/3378678.3391875","relation":{},"subject":[],"published":{"date-parts":[[2020,5,25]]},"assertion":[{"value":"2020-05-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}