{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:07:47Z","timestamp":1759133267514,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1109\/ipdps.2008.4536170","type":"proceedings-article","created":{"date-parts":[[2008,6,6]],"date-time":"2008-06-06T16:44:52Z","timestamp":1212770692000},"page":"1-7","source":"Crossref","is-referenced-by-count":9,"title":["Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model"],"prefix":"10.1109","author":[{"given":"Olivier","family":"Beaumont","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Bonichon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lionel","family":"Eyraud-Dubois","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","article-title":"on the complexity of multi-round divisible load scheduling","author":"yang","year":"2007","journal-title":"Research Report"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/71.674315"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/277851.277867"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(94)00068-L"},{"key":"14","article-title":"np-completeness of the divisible load scheduling problem on heterogeneous star platforms with affine costs","author":"legrand","year":"2005","journal-title":"Research Report"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2004.1302974"},{"journal-title":"Linux Advanced Routing & Traffic Control","year":"2002","author":"hubert","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1"},{"key":"2","first-page":"197","article-title":"optimal scheduling algorithms for communication constrained parallel processing","volume":"2400","author":"altilar","year":"2002","journal-title":"LNCS"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.1109\/MMCS.1998.693650","article-title":"an optimal scheduling algorithm for parallel video processing","author":"altilar","year":"1998","journal-title":"IEEE Multimedia Computing and Systems Conference"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1991","author":"garey","key":"10"},{"year":"0","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(98)00104-5"},{"key":"5","article-title":"scheduling divisible loads in parallel and distributed systems","author":"bharadwaj","year":"1996","journal-title":"IEEE Computer Society Press"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.35"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/88.218176"},{"journal-title":"Selected Problems of Scheduling Tasks in Multiprocessor Computing Systems","year":"1997","author":"drozdowski","key":"8"}],"event":{"name":"Distributed Processing Symposium (IPDPS)","start":{"date-parts":[[2008,4,14]]},"location":"Miami, FL, USA","end":{"date-parts":[[2008,4,18]]}},"container-title":["2008 IEEE International Symposium on Parallel and Distributed Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4519061\/4536075\/04536170.pdf?arnumber=4536170","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T08:55:10Z","timestamp":1497776110000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4536170\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2008.4536170","relation":{},"ISSN":["1530-2075"],"issn-type":[{"type":"print","value":"1530-2075"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}