{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:31:18Z","timestamp":1729657878137,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1109\/ipdpsw.2010.5470711","type":"proceedings-article","created":{"date-parts":[[2010,5,28]],"date-time":"2010-05-28T14:25:42Z","timestamp":1275056742000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling instructions on hierarchical machines"],"prefix":"10.1109","author":[{"given":"Florent","family":"Blachot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Huard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johnatan","family":"Pecero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"Saule","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1","author":"lenstra","year":"1995","journal-title":"Scheduling Theory and its Applications chapter 1 - Computing Near-Optimal Schedules"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2000.888353"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.1998.742792"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(87)90042-4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISSS.2000.874027"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/71.308533"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00328-6"},{"key":"ref3","first-page":"87","article-title":"Scheduling precedence graphs in systems with interprocessor communication times","volume":"18","author":"anger","year":"1989","journal-title":"SIAM Journal on Computing"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.1999.744349"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781165"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1998.669967"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1109\/MICRO.2001.991114","article-title":"Graph partitioning based instruction scheduling for clustered processors","author":"aleta","year":"2001","journal-title":"Proc 34th Int l Symp Microarchitecture"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2001.968606"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2002.1176243"}],"event":{"name":"Distributed Processing, Workshops and Phd Forum (IPDPSW)","start":{"date-parts":[[2010,4,19]]},"location":"Atlanta, GA, USA","end":{"date-parts":[[2010,4,23]]}},"container-title":["2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5465895\/5470678\/05470711.pdf?arnumber=5470711","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T04:48:44Z","timestamp":1497847724000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5470711\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/ipdpsw.2010.5470711","relation":{},"subject":[],"published":{"date-parts":[[2010,4]]}}}