{"id":"https://openalex.org/W2809197406","doi":"https://doi.org/10.1145/3210377.3210385","title":"Optimal Algorithms for Right-Sizing Data Centers","display_name":"Optimal Algorithms for Right-Sizing Data Centers","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2809197406","doi":"https://doi.org/10.1145/3210377.3210385","mag":"2809197406"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210385","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210385","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210385","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210385","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074909595","display_name":"Susanne Albers","orcid":"https://orcid.org/0000-0001-5848-5360"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Susanne Albers","raw_affiliation_strings":["Technical University of Munich, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066005269","display_name":"Jens Quedenfeld","orcid":"https://orcid.org/0000-0001-9690-0123"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jens Quedenfeld","raw_affiliation_strings":["Technical University of Munich, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074909595"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":2.5835,"has_fulltext":true,"cited_by_count":23,"citation_normalized_percentile":{"value":0.90509773,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"363","last_page":"372"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10273","display_name":"IoT and Edge/Fog Computing","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.73228919506073},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.7292526960372925},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6697669625282288},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6378301978111267},{"id":"https://openalex.org/keywords/data-center","display_name":"Data center","score":0.5597147345542908},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5387734770774841},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5365967750549316},{"id":"https://openalex.org/keywords/provisioning","display_name":"Provisioning","score":0.5174363255500793},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46306151151657104},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4508667588233948},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4405973553657532},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2461082637310028},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19222360849380493},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11738574504852295}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.73228919506073},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.7292526960372925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6697669625282288},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6378301978111267},{"id":"https://openalex.org/C153740404","wikidata":"https://www.wikidata.org/wiki/Q671224","display_name":"Data center","level":2,"score":0.5597147345542908},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5387734770774841},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5365967750549316},{"id":"https://openalex.org/C172191483","wikidata":"https://www.wikidata.org/wiki/Q1071806","display_name":"Provisioning","level":2,"score":0.5174363255500793},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46306151151657104},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4508667588233948},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4405973553657532},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2461082637310028},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19222360849380493},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11738574504852295},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3210377.3210385","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210385","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210385","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3210377.3210385","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210385","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210385","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.7300000190734863,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[{"id":"https://openalex.org/G4002716516","display_name":null,"funder_award_id":"691672","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2809197406.pdf","grobid_xml":"https://content.openalex.org/works/W2809197406.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1996600352","https://openalex.org/W2020196954","https://openalex.org/W2056930089","https://openalex.org/W2076268125","https://openalex.org/W2120881346","https://openalex.org/W2128085284","https://openalex.org/W2131629857","https://openalex.org/W2134807578","https://openalex.org/W2135798231","https://openalex.org/W2151484814","https://openalex.org/W2153230844","https://openalex.org/W2261313794","https://openalex.org/W2283764194","https://openalex.org/W2284351912","https://openalex.org/W2345314460","https://openalex.org/W2552083296","https://openalex.org/W2553398864","https://openalex.org/W2736578080","https://openalex.org/W2795096513","https://openalex.org/W4214894150"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W3211256740"],"abstract_inverted_index":{"Electricity":[0],"cost":[1,268],"is":[2,18,212],"a":[3,31,38,57,70,74,84,97,112,165,181,224,261,284],"dominant":[4],"and":[5,66,89,176,190,282,315],"rapidly":[6],"growing":[7],"expense":[8],"in":[9,100,158,180,238,245,260],"data":[10,39],"centers.":[11],"Unfortunately,":[12],"much":[13],"of":[14,27,44,79,86,104,132,172,292],"the":[15,42,48,102,121,124,130,152,173,187,192,205,239,246,254,279,289,325],"consumed":[16],"energy":[17],"wasted":[19],"because":[20],"servers":[21,46],"are":[22],"idle":[23],"for":[24,51,120],"extended":[25],"periods":[26],"time.":[28,160],"We":[29,54,208,251,317],"study":[30,186],"capacity":[32],"management":[33],"problem":[34,60,128,154,175,189,248,262],"that":[35,151,210,217,253,322],"dynamically":[36],"right-sizes":[37],"center,":[40],"matching":[41],"number":[43,103,131],"active":[45,105,133],"with":[47,264,327],"varying":[49],"demand":[50],"computing":[52],"capacity.":[53],"resort":[55],"to":[56,204,324],"data-center":[58,126],"optimization":[59,127,174],"introduced":[61,270],"by":[62,83,199,271,300,313],"Lin,":[63],"Wierman,":[64],"Andrew":[65],"Thereska~\\citeW1a,W1":[67],"that,":[68],"over":[69],"time":[71,123],"horizon,":[72],"minimizes":[73],"combined":[75],"objective":[76],"function":[77],"consisting":[78],"operating":[80,267,330],"cost,":[81],"modeled":[82],"sequence":[85],"convex":[87],"functions,":[88,269],"server":[90],"switching":[91],"cost.":[92,331],"All":[93],"prior":[94],"work":[95],"addresses":[96],"continuous":[98,240,280],"setting":[99,281],"which":[101],"servers,":[106,134],"at":[107,135],"any":[108,136],"time,":[109,137],"may":[110],"take":[111],"fractional":[113],"value.":[114],"In":[115],"this":[116],"paper,":[117],"we":[118,143,149,185,215,277],"investigate":[119],"first":[122],"discrete":[125,206,247],"where":[129],"must":[138],"be":[139,156],"integer":[140],"valued.":[141],"Thereby":[142],"seek":[144],"truly":[145],"feasible":[146],"solutions.":[147],"First,":[148],"show":[150,216],"offline":[153],"can":[155,222],"solved":[157],"polynomial":[159],"Our":[161],"algorithm":[162,193,221],"relies":[163],"on":[164,288],"new,":[166],"yet":[167],"intuitive":[168],"graph":[169],"theoretic":[170],"model":[171],"performs":[177],"binary":[178],"search":[179],"layered":[182],"graph.":[183],"Second,":[184],"online":[188,220,293],"extend":[191],"\\em":[194],"Lazy":[195],"Capacity":[196],"Provisioning":[197],"(LCP)":[198],"Lin":[200,272],"et":[201,273,302],"al.":[202,274,303],"\\citeW1a,W1":[203],"setting.":[207],"prove":[209,252],"LCP":[211,231],"3-competitive.":[213],"Moreover,":[214],"no":[218],"deterministic":[219],"achieve":[223],"competitive":[225],"ratio":[226],"smaller":[227],"than~3.":[228],"Hence,":[229],"while":[230],"does":[232,243],"not":[233],"attain":[234],"an":[235,297,319],"optimal":[236],"competitiveness":[237,291],"setting,":[241],"it":[242],"so":[244],"examined":[249],"here.":[250],"lower":[255,285,306],"bound":[256,286,299,307],"of~3":[257],"also":[258,310],"holds":[259],"variant":[263],"more":[265,328],"restricted":[266,329],"\\citeW1a.":[275],"Finally,":[276],"address":[278],"give":[283],"of~2":[287,308],"best":[290],"algorithms.":[294],"This":[295],"matches":[296],"upper":[298],"Bansal":[301],"\\citeB+.":[304],"A":[305],"was":[309],"recently":[311],"shown":[312],"Antoniadis":[314],"Schewior~\\citeA2.":[316],"develop":[318],"independent":[320],"proof":[321],"extends":[323],"scenario":[326]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}