{"id":"https://openalex.org/W4304190022","doi":"https://doi.org/10.1145/3565513","title":"Optimal Algorithms for Right-sizing Data Centers","display_name":"Optimal Algorithms for Right-sizing Data Centers","publication_year":2022,"publication_date":"2022-10-11","ids":{"openalex":"https://openalex.org/W4304190022","doi":"https://doi.org/10.1145/3565513"},"language":"en","primary_location":{"id":"doi:10.1145/3565513","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3565513","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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, Garching, Germany"],"raw_orcid":"https://orcid.org/0000-0001-5848-5360","affiliations":[{"raw_affiliation_string":"Technical University of Munich, Garching, 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, Garching, Germany"],"raw_orcid":"https://orcid.org/0000-0001-9690-0123","affiliations":[{"raw_affiliation_string":"Technical University of Munich, Garching, 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":0.1424,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.50139014,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"9","issue":"4","first_page":"1","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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.9969000220298767,"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.996399998664856,"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.7220920324325562},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.6833078265190125},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6360546946525574},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6331892013549805},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5494548082351685},{"id":"https://openalex.org/keywords/data-center","display_name":"Data center","score":0.5375224351882935},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5344663262367249},{"id":"https://openalex.org/keywords/provisioning","display_name":"Provisioning","score":0.5166559815406799},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4529992938041687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43669429421424866},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4191816449165344},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.41705307364463806},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2356073260307312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2195490598678589},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10174062848091125}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7220920324325562},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.6833078265190125},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6360546946525574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6331892013549805},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5494548082351685},{"id":"https://openalex.org/C153740404","wikidata":"https://www.wikidata.org/wiki/Q671224","display_name":"Data center","level":2,"score":0.5375224351882935},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5344663262367249},{"id":"https://openalex.org/C172191483","wikidata":"https://www.wikidata.org/wiki/Q1071806","display_name":"Provisioning","level":2,"score":0.5166559815406799},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4529992938041687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43669429421424866},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4191816449165344},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.41705307364463806},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2356073260307312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2195490598678589},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10174062848091125},{"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/3565513","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3565513","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.7599999904632568,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1996600352","https://openalex.org/W2076268125","https://openalex.org/W2114538202","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/W2283764194","https://openalex.org/W2284351912","https://openalex.org/W2345314460","https://openalex.org/W2402477580","https://openalex.org/W2552083296","https://openalex.org/W2553398864","https://openalex.org/W2795236957","https://openalex.org/W2887376719","https://openalex.org/W2954026074","https://openalex.org/W2963192016","https://openalex.org/W2964034592","https://openalex.org/W2975380042","https://openalex.org/W3001363793","https://openalex.org/W3001440696","https://openalex.org/W3003098876","https://openalex.org/W3164916608","https://openalex.org/W4214894150","https://openalex.org/W4242370499"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2970577745","https://openalex.org/W2583614279","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"Electricity":[0],"cost":[1,278],"is":[2,18,220,297,304,338,353],"a":[3,31,38,57,75,79,89,102,117,170,186,232,271,292,339,376],"dominant":[4],"and":[5,66,94,181,195,324,374,410],"rapidly":[6],"growing":[7],"expense":[8],"in":[9,105,163,185,247,254,270],"data":[10,39],"centers.":[11],"Unfortunately,":[12],"much":[13],"of":[14,27,44,84,91,109,137,177,266,309,346,379,385,403],"the":[15,42,48,107,126,129,135,157,178,192,197,213,248,255,263,307,321,343,358,364,371,382,423],"consumed":[16],"energy":[17],"wasted,":[19],"because":[20],"servers":[21,46],"are":[22],"idle":[23],"for":[24,51,125,320,342,363],"extended":[25],"periods":[26],"time.":[28,165],"We":[29,54,216,260,355,415],"study":[30,191],"capacity":[32],"management":[33],"problem":[34,60,133,159,180,194,257,272],"that":[35,156,218,225,262,296,336,357,420],"dynamically":[36],"right-sizes":[37],"center,":[40],"matching":[41],"number":[43,108,136],"active":[45,110,138],"with":[47,274,425],"varying":[49],"demand":[50],"computing":[52],"capacity.":[53],"resort":[55],"to":[56,212,328,422],"data-center":[58,131],"optimization":[59,132,179],"introduced":[61,280],"by":[62,88,203,281,393,408],"Lin,":[63],"Wierman,":[64],"Andrew,":[65],"Thereska":[67],"[":[68,207,285,313,397,412],"25":[69,208,286],",":[70,209],"27":[71,210],"]":[72,211,315],"that,":[73],"over":[74],"time":[76,128],"horizon,":[77],"minimizes":[78],"combined":[80],"objective":[81],"function":[82],"consisting":[83],"operating":[85,277,428],"cost,":[86],"modeled":[87],"sequence":[90],"convex":[92],"functions,":[93,279],"server":[95],"switching":[96],"cost.":[97,429],"All":[98],"prior":[99],"work":[100],"addresses":[101],"continuous":[103,249,322,372],"setting":[104,373],"which":[106],"servers,":[111,139],"at":[112,140],"any":[113,141],"time,":[114,142],"may":[115],"take":[116],"fractional":[118],"value.":[119],"In":[120,288],"this":[121],"article,":[122],"we":[123,148,154,190,223,290,334,369],"investigate":[124],"first":[127],"discrete":[130,214,256],"where":[134],"must":[143],"be":[144,161],"integer":[145],"valued.":[146],"Thereby,":[147],"seek":[149],"truly":[150],"feasible":[151],"solutions.":[152],"First,":[153],"show":[155,224],"offline":[158],"can":[160,230],"solved":[162],"polynomial":[164],"Our":[166],"algorithm":[167,198,229,295,308,319,352],"relies":[168],"on":[169,306,381],"new,":[171],"yet":[172],"intuitive":[173],"graph":[174],"theoretic":[175],"model":[176],"performs":[182],"binary":[183],"search":[184],"layered":[187],"graph.":[188],"Second,":[189],"online":[193,228,294,348,386],"extend":[196],"Lazy":[199],"Capacity":[200],"Provisioning":[201],"(LCP)":[202],"Lin":[204,282],"et":[205,283,311,395],"al.":[206,284,312,396],"setting.":[215],"prove":[217,261,335,356],"LCP":[219,240],"3-competitive.":[221],"Moreover,":[222,333],"no":[226],"deterministic":[227],"achieve":[231],"competitive":[233,344],"ratio":[234,345],"smaller":[235],"than":[236],"3.":[237],"Hence,":[238],"while":[239],"does":[241,252],"not":[242],"attain":[243],"an":[244,300,330,390,417],"optimal":[245],"competitiveness":[246,384],"setting,":[250],"it":[251],"so":[253,350],"examined":[258],"here.":[259],"lower":[264,340,359,377,401],"bound":[265,341,360,378,392,402],"3":[267],"also":[268,406],"holds":[269,362],"variant":[273],"more":[275,365,426],"restricted":[276,366,427],"].":[287,399,414],"addition,":[289],"develop":[291,416],"randomized":[293,326,347],"2-competitive":[298,318],"against":[299],"oblivious":[301],"adversary.":[302],"It":[303],"based":[305],"Bansal":[310,394],"7":[314,398],"(a":[316],"deterministic,":[317],"setting)":[323],"uses":[325],"rounding":[327],"obtain":[329],"integral":[331],"solution.":[332],"2":[337,380,404],"algorithms,":[349],"our":[351],"optimal.":[354],"still":[361],"model.":[367],"Finally,":[368],"address":[370],"give":[375],"best":[383],"algorithms.":[387],"This":[388],"matches":[389],"upper":[391],"A":[400],"was":[405],"shown":[407],"Antoniadis":[409],"Schewior":[411],"4":[413],"independent":[418],"proof":[419],"extends":[421],"scenario":[424]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}