{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,27]],"date-time":"2025-12-27T03:43:46Z","timestamp":1766807026955,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000646","name":"JSPS KAKENHI","doi-asserted-by":"publisher","award":["25730077"],"award-info":[{"award-number":["25730077"]}],"id":[{"id":"10.13039\/501100000646","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2016,11,1]]},"DOI":"10.1109\/tpds.2016.2526682","type":"journal-article","created":{"date-parts":[[2016,2,8]],"date-time":"2016-02-08T14:09:42Z","timestamp":1454940582000},"page":"3144-3157","source":"Crossref","is-referenced-by-count":83,"title":["Clustering-Based Task Scheduling in a Large Number of Heterogeneous Processors"],"prefix":"10.1109","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8121-8874","authenticated-orcid":false,"given":"Hidehiro","family":"Kanemitsu","sequence":"first","affiliation":[]},{"given":"Masaki","family":"Hanada","sequence":"additional","affiliation":[]},{"given":"Hidenori","family":"Nakazato","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/71.707547"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/71.207593"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICPPW.2001.951956"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2001.924984"},{"article-title":"Metis-Unstructured graph partitioning and sparse matrix ordering system, version 2.0","year":"1995","author":"george","key":"ref36"},{"key":"ref35","first-page":"189","article-title":"An experimental investigation into the rank function of the heterogeneous earliest finish time scheduling algorithm","author":"henan","year":"2003","journal-title":"Proc 9th Int Euro-Par Parallel Process"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/EMPDP.1995.389188"},{"journal-title":"Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors","year":"1989","author":"sarkar","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/71.80160"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/71.308533"},{"key":"ref13","first-page":"152","article-title":"An efficient task clustering heuristic for scheduling DAGs on multiprocessors","author":"liou","year":"0","journal-title":"Proc Parallel Distrib Process Symp"},{"key":"ref14","first-page":"1","article-title":"A processor mapping strategy for processor utilization in a heterogeneous distributed system","volume":"3","author":"kanemitsu","year":"2011","journal-title":"J Comput"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.5772\/35842"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(93)90079-Z"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/0470121173"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/71.242154"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/344588.344618"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1999.760523"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2322354"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01209-9_23"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CCGrid.2012.114"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.09.002"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/SBAC-PAD.2004.1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2014.11.007"},{"journal-title":"Computer and Jobshop Scheduling Theory","year":"1976","author":"coffman","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1714"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA.2009.95"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(92)90012-C"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.144"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/71.993206"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2012.01.001"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.57"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICECCT.2015.7226067"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.05.015"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2015.06.016"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2015.04.005"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/7586142\/07401062.pdf?arnumber=7401062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:42:51Z","timestamp":1641987771000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7401062\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,1]]},"references-count":36,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2016.2526682","relation":{},"ISSN":["1045-9219"],"issn-type":[{"type":"print","value":"1045-9219"}],"subject":[],"published":{"date-parts":[[2016,11,1]]}}}