{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:27Z","timestamp":1750306047571,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T00:00:00Z","timestamp":1494374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61376024 and 61306024"],"award-info":[{"award-number":["61376024 and 61306024"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["S2013040014366 and 2015A030313743"],"award-info":[{"award-number":["S2013040014366 and 2015A030313743"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Special Program for Applied Research on Super Computation of the NSFC-Guangdong Joint Fund (the second phase)"},{"name":"Basic Research Programme of Shenzhen","award":["No. JCYJ20140417113430642 and JCYJ20140901003939020"],"award-info":[{"award-number":["No. JCYJ20140417113430642 and JCYJ20140901003939020"]}]},{"name":"Science and Technology Research Grant of Guangdong Province","award":["2016A010101011"],"award-info":[{"award-number":["2016A010101011"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,5,10]]},"DOI":"10.1145\/3060403.3060419","type":"proceedings-article","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T19:56:07Z","timestamp":1494964567000},"page":"451-454","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Throughput Optimization for Lifetime Budgeting in Many-Core Systems"],"prefix":"10.1145","author":[{"given":"Liang","family":"Wang","sequence":"first","affiliation":[{"name":"Chinese University of Hong Kong & South China University of Technology, Shatin, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohang","family":"Wang","sequence":"additional","affiliation":[{"name":"South China University of Technology & Chinese Academy of Sciences, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ho-fung","family":"Leung","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong, Shatin, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Terrence","family":"Mak","sequence":"additional","affiliation":[{"name":"University of Southampton & Chinese Academy of Sciences, Southampton , United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,5,10]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"58","volume-title":"Proc. of DFTS","author":"Bolchini C.","year":"2013","unstructured":"C. Bolchini and et al. Run-time mapping for reliable many-cores based on energy\/performance trade-offs. In Proc. of DFTS, pages 58--64, 2013."},{"key":"e_1_3_2_1_2_1","first-page":"166","volume-title":"Proc. of ICCD","author":"Bolchini C.","year":"2014","unstructured":"C. Bolchini and et al. A lightweight and open-source framework for the lifetime estimation of multicore systems. In Proc. of ICCD, pages 166--172, 2014."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2012.6378665"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744849"},{"key":"e_1_3_2_1_5_1","first-page":"509","volume-title":"Proc. of ICCD","author":"Haghbayan M. H.","year":"2014","unstructured":"M. H. Haghbayan and et al. Dark silicon aware power management for manycore systems under dynamic workloads. In Proc. of ICCD, pages 509--512, 2014."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2971808.2972005"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1874620.1874635"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1870926.1871307"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488735"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/EUC.2014.59"},{"key":"e_1_3_2_1_11_1","unstructured":"F. Suter. Daggen: A synthethic task graph generator. https:\/\/github.com\/frs69wq\/daggen."}],"event":{"name":"GLSVLSI '17: Great Lakes Symposium on VLSI 2017","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA","IEEE CASS"],"location":"Banff Alberta Canada","acronym":"GLSVLSI '17"},"container-title":["Proceedings of the Great Lakes Symposium on VLSI 2017"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3060403.3060419","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3060403.3060419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:20Z","timestamp":1750215800000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3060403.3060419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,10]]},"references-count":11,"alternative-id":["10.1145\/3060403.3060419","10.1145\/3060403"],"URL":"https:\/\/doi.org\/10.1145\/3060403.3060419","relation":{},"subject":[],"published":{"date-parts":[[2017,5,10]]},"assertion":[{"value":"2017-05-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}