{"id":"https://openalex.org/W3191289409","doi":"https://doi.org/10.1145/3595286","title":"Algorithms for Right-sizing Heterogeneous Data Centers","display_name":"Algorithms for Right-sizing Heterogeneous Data Centers","publication_year":2023,"publication_date":"2023-05-10","ids":{"openalex":"https://openalex.org/W3191289409","doi":"https://doi.org/10.1145/3595286","mag":"3191289409"},"language":"en","primary_location":{"id":"doi:10.1145/3595286","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3595286","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3595286","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":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3595286","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":false,"raw_author_name":"Susanne Albers","raw_affiliation_strings":["Technical University of Munich, Germany"],"raw_orcid":"https://orcid.org/0000-0001-5848-5360","affiliations":[{"raw_affiliation_string":"Technical University of 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, Germany"],"raw_orcid":"https://orcid.org/0000-0001-9690-0123","affiliations":[{"raw_affiliation_string":"Technical University of Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00242562,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"4","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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.9997000098228455,"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.9952999949455261,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9943000078201294,"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.7835097312927246},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7361810207366943},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.735300600528717},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6805463433265686},{"id":"https://openalex.org/keywords/data-center","display_name":"Data center","score":0.6452705264091492},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5065683126449585},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.49642521142959595},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4963093400001526},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42660409212112427},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40050753951072693},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3843686282634735},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.37156474590301514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20246028900146484},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11436456441879272}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7835097312927246},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7361810207366943},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.735300600528717},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6805463433265686},{"id":"https://openalex.org/C153740404","wikidata":"https://www.wikidata.org/wiki/Q671224","display_name":"Data center","level":2,"score":0.6452705264091492},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5065683126449585},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.49642521142959595},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4963093400001526},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42660409212112427},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40050753951072693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3843686282634735},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37156474590301514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20246028900146484},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11436456441879272},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3595286","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3595286","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3595286","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":{"id":"doi:10.1145/3595286","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3595286","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3595286","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"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.9100000262260437,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3191289409.pdf","grobid_xml":"https://content.openalex.org/works/W3191289409.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W1580267013","https://openalex.org/W1589691128","https://openalex.org/W1969353386","https://openalex.org/W2019492625","https://openalex.org/W2020196954","https://openalex.org/W2034039215","https://openalex.org/W2078303776","https://openalex.org/W2112694890","https://openalex.org/W2120881346","https://openalex.org/W2168245849","https://openalex.org/W2292935145","https://openalex.org/W2345314460","https://openalex.org/W2528252365","https://openalex.org/W2532349384","https://openalex.org/W2611254621","https://openalex.org/W2736371045","https://openalex.org/W2738074097","https://openalex.org/W2783741611","https://openalex.org/W2795096513","https://openalex.org/W2795236957","https://openalex.org/W2809197406","https://openalex.org/W2884611814","https://openalex.org/W2951159619","https://openalex.org/W2954026074","https://openalex.org/W2963192016","https://openalex.org/W2964034592","https://openalex.org/W2975380042","https://openalex.org/W2987263449","https://openalex.org/W2994697260","https://openalex.org/W3000871882","https://openalex.org/W3001363793","https://openalex.org/W3001440696","https://openalex.org/W3003098876","https://openalex.org/W3029775994","https://openalex.org/W3096329823","https://openalex.org/W3158344587","https://openalex.org/W4292329843"],"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":{"Power":[0],"consumption":[1,21],"is":[2,77,196,211,228],"a":[3,33,70,158,164,197,220],"dominant":[4],"and":[5,40,54,76,123],"still":[6],"growing":[7],"cost":[8,68,149,182],"factor":[9],"in":[10,130,203],"data":[11,49,59,115,143],"centers.":[12],"In":[13,88,137],"time":[14],"periods":[15],"with":[16,51,61,145],"low":[17],"load,":[18],"the":[19,95,99,121,124,184,215],"energy":[20],"can":[22,187],"be":[23,105,188],"reduced":[24,189],"by":[25,36,79],"powering":[26],"down":[27],"unused":[28],"servers.":[29],"We":[30,151],"resort":[31],"to":[32,57,90,190,230],"model":[34],"introduced":[35],"Lin,":[37],"Wierman,":[38],"Andrew,":[39],"Thereska":[41],"[":[42,132,205],"23":[43],",":[44,134],"24":[45],"]":[46],"that":[47,162],"considers":[48],"centers":[50,60,116,144],"identical":[52],"machines":[53],"generalize":[55],"it":[56],"heterogeneous":[58,142],"d":[62,118,169,192],"different":[63],"server":[64,71,86],"types.":[65],"The":[66],"operating":[67,148,181],"of":[69,101,167,200],"depends":[72],"on":[73,157],"its":[74],"load":[75],"modeled":[78],"an":[80,153],"increasing,":[81],"convex":[82],"function":[83,160],"for":[84,174],"each":[85],"type.":[87],"contrast":[89],"earlier":[91],"work,":[92],"we":[93,108,140,218],"consider":[94],"discrete":[96],"setting,":[97],"where":[98],"number":[100],"active":[102],"servers":[103],"must":[104],"integral.":[106],"Thereby,":[107],"seek":[109],"truly":[110],"feasible":[111],"solutions.":[112],"For":[113,179,214],"homogeneous":[114],"(":[117],"=1),":[119],"both":[120],"offline":[122,216,226],"online":[125,154],"problem":[126],"were":[127],"solved":[128],"optimally":[129],"References":[131],"3":[133],"4":[135],"].":[136],"this":[138],"article,":[139],"study":[141],"general":[146],"time-dependent":[147],"functions.":[150],"develop":[152],"algorithm":[155,210,227],"based":[156],"work":[159],"approach":[161],"achieves":[163],"competitive":[165,185],"ratio":[166,186],"2":[168,191],"+":[170,172,193],"1":[171],"\u03b5":[173,176],"any":[175],">":[177],"0.":[178],"time-independent":[180],"functions,":[183],"1.":[194],"There":[195],"lower":[198],"bound":[199],"2d":[201],"shown":[202],"Reference":[204],"5":[206],"],":[207],"so":[208],"our":[209,225],"nearly":[212],"optimal.":[213],"version,":[217],"give":[219],"graph-based":[221],"(1+\u03b5)-approximation":[222],"algorithm.":[223],"Additionally,":[224],"able":[229],"handle":[231],"time-variable":[232],"data-center":[233],"sizes.":[234]},"counts_by_year":[],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}