{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:22Z","timestamp":1750307302801,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,4]]},"DOI":"10.1145\/1989493.1989512","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"135-136","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief announcement"],"prefix":"10.1145","author":[{"given":"Guilaume","family":"Aupy","sequence":"first","affiliation":[{"name":"LIP, ENS Lyon, Lyon, France"}]},{"given":"Anne","family":"Benoit","sequence":"additional","affiliation":[{"name":"LIP, ENS Lyon, Lyon, France"}]},{"given":"Fanny","family":"Dufoss\u00e9","sequence":"additional","affiliation":[{"name":"LIP, ENS Lyon, Lyon, France"}]},{"given":"Yves","family":"Robert","sequence":"additional","affiliation":[{"name":"LIP, ENS Lyon, Lyon, France"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"INRIA","author":"Aupy G.","year":"2011","unstructured":"G. Aupy , A. Benoit , F. Dufoss\u00e9 , and Y. Robert . Reclaiming the energy of a schedule: models and algorithms. Research report , INRIA , Lyon, France , Apr. 2011 . Available at http:\/\/graal.ens-lyon.fr\/ abenoit. G. Aupy, A. Benoit, F. Dufoss\u00e9, and Y. Robert. Reclaiming the energy of a schedule: models and algorithms. Research report, INRIA, Lyon, France, Apr. 2011. Available at http:\/\/graal.ens-lyon.fr\/ abenoit."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1206035.1206038"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.5555\/993483"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/378239.378467"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/280756.280894"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/978-3-540-74442-9_54"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/54.914613"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"acronym":"SPAA '11","name":"SPAA '11: 23rd ACM Symposium on Parallelism in Algorithms and Architectures","location":"San Jose California USA"},"container-title":["Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989512","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989493.1989512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:56Z","timestamp":1750244396000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989512"}},"subtitle":["reclaiming the energy of a schedule, models and algorithms"],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":7,"alternative-id":["10.1145\/1989493.1989512","10.1145\/1989493"],"URL":"https:\/\/doi.org\/10.1145\/1989493.1989512","relation":{},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}