{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T21:35:14Z","timestamp":1765143314641,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","award":["691672"],"award-info":[{"award-number":["691672"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210385","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"363-372","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Optimal Algorithms for Right-Sizing Data Centers"],"prefix":"10.1145","author":[{"given":"Susanne","family":"Albers","sequence":"first","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}]},{"given":"Jens","family":"Quedenfeld","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Munich, Germany"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465529.2465533"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49529-2_6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"A. Antoniadis and K. Schewior. A tight lower bound for online convex optimization with switching costs.Announced at the 15th Workshop on Approximation and Online Algorithms (WAOA'17) 2017. A. Antoniadis and K. Schewior. A tight lower bound for online convex optimization with switching costs.Announced at the 15th Workshop on Approximation and Online Algorithms (WAOA'17) 2017.","DOI":"10.1007\/978-3-319-89441-6_13"},{"volume-title":"Proc. 18th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX15)","year":"2015","author":"Bansal N.","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2007.443"},{"key":"e_1_3_2_1_7_1","unstructured":"T. Bawden. Global warming: Data centres to consume three times as much energy in next decade experts warn. http:\/\/www.independent.co.uk\/environment\/global-warming-data-centres-to-consume-three-times-as-much-energy-in-next-decade- experts-warn-a6830086.html 2016. T. Bawden. Global warming: Data centres to consume three times as much energy in next decade experts warn. http:\/\/www.independent.co.uk\/environment\/global-warming-data-centres-to-consume-three-times-as-much-energy-in-next-decade- experts-warn-a6830086.html 2016."},{"key":"e_1_3_2_1_8_1","unstructured":"K.G. Brill. The Invisible Crisis in the Data Center: The Economic Meltdown of Moore's Law. white paper Uptime Institute 2--5 2007. K.G. Brill. The Invisible Crisis in the Data Center: The Economic Meltdown of Moore's Law. white paper Uptime Institute 2--5 2007."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2481183"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120299"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2010.07.004"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSDIS.2015.82"},{"key":"e_1_3_2_1_13_1","unstructured":"J. Hamilton. Cost of Power in Large-Scale Data Centers. http:\/\/perspectives.mvdirona.com\/2008\/11\/cost-of-power-in-large-scale-data-centers\/ J. Hamilton. Cost of Power in Large-Scale Data Centers. http:\/\/perspectives.mvdirona.com\/2008\/11\/cost-of-power-in-large-scale-data-centers\/"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873711"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133043"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IGCC.2012.6322266"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934885"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120298"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2226216"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2308295"},{"key":"e_1_3_2_1_21_1","unstructured":"P. Schmid and A. Roos. Overclocking Core i7: Power Versus Performance. Idle\/Peak Power Consumption Analysis. http:\/\/www.tomshardware.com\/reviews\/overclock-core-i7 2268--10.html 2009. P. Schmid and A. Roos. Overclocking Core i7: Power Versus Performance. Idle\/Peak Power Consumption Analysis. http:\/\/www.tomshardware.com\/reviews\/overclock-core-i7 2268--10.html 2009."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"A. Shehabi S. Smith D. Sartor R. Brown M. Herrlin J. Koomey E. Masanet N. Horner I. Azevedo and W. Lintner. United States data center energy usage report. Lawrence Berkeley National Laboratory LBNL-1005775 2016. A. Shehabi S. Smith D. Sartor R. Brown M. Herrlin J. Koomey E. Masanet N. Horner I. Azevedo and W. Lintner. United States data center energy usage report. Lawrence Berkeley National Laboratory LBNL-1005775 2016.","DOI":"10.2172\/1372902"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2014.12.001"}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","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"],"location":"Vienna Austria","acronym":"SPAA '18"},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210385","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:13Z","timestamp":1750208893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":22,"alternative-id":["10.1145\/3210377.3210385","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210385","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}