{"id":"https://openalex.org/W7160266726","doi":"https://doi.org/10.48550/arxiv.2605.01614","title":"CvxCluster: Solving Large, Complex, Granular Resource Allocation Problems 100-1000x Faster","display_name":"CvxCluster: Solving Large, Complex, Granular Resource Allocation Problems 100-1000x Faster","publication_year":2026,"publication_date":"2026-05-02","ids":{"openalex":"https://openalex.org/W7160266726","doi":"https://doi.org/10.48550/arxiv.2605.01614"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.01614","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01614","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.01614","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135308258","display_name":"Obi Nnorom","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nnorom, Obi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135363021","display_name":"Stephen Boyd","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Boyd, Stephen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108245984","display_name":"Philip Levis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Levis, Philip","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.2732999920845032,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.2732999920845032,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.11980000138282776,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.07829999923706055,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.6547999978065491},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6330000162124634},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5354999899864197},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5098999738693237},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.49050000309944153},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.48330000042915344},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4544000029563904},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.4480000138282776},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42170000076293945}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7236999869346619},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.6547999978065491},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6330000162124634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6208000183105469},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5354999899864197},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5098999738693237},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.49050000309944153},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.48330000042915344},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4544000029563904},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.4480000138282776},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42170000076293945},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.38370001316070557},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.3797000050544739},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.36340001225471497},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.33230000734329224},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3278999924659729},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.30649998784065247},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2946000099182129},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.27129998803138733},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.25999999046325684},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2547999918460846},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.01614","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01614","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.01614","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01614","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.5884429812431335,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Cluster":[0],"resource":[1,64,103],"allocation":[2,12,65],"is":[3,58,184],"a":[4,28,34,44,67,82,89,98,113,153,189],"multidimensional":[5],"search":[6,19,38],"problem":[7,69,95,194],"that":[8,70,126,185,199],"finds":[9],"the":[10,18,93,143,162],"best":[11],"of":[13,37,92,101,161],"tasks":[14],"to":[15,61,96,111,117,129,141,149],"servers.":[16,178],"Because":[17],"space":[20],"grows":[21],"exponentially,":[22],"modern":[23],"approaches":[24],"frame":[25],"it":[26],"as":[27,171,188,203],"mixed":[29],"integer":[30],"program":[31],"(MIP)":[32],"or":[33,205],"complex":[35,168],"set":[36,100],"heuristics.":[39,209],"This":[40],"paper":[41],"proposes":[42],"using":[43],"different":[45],"approach:":[46],"convex":[47,68,90],"optimization,":[48],"which":[49,77],"has":[50],"extremely":[51],"fast":[52],"solution":[53],"methods.":[54],"The":[55,85,105,179],"research":[56],"challenge":[57],"devising":[59],"how":[60],"transform":[62],"cluster":[63,79],"into":[66],"generates":[71],"good":[72,204],"placements.":[73],"We":[74],"describe":[75],"CvxCluster,":[76],"allocates":[78],"resources":[80],"with":[81,122],"two-stage":[83],"algorithm.":[84],"first":[86],"stage":[87,107],"solves":[88],"relaxation":[91],"placement":[94,187],"yield":[97],"principled":[99],"per-machine":[102],"prices.":[104],"second":[106],"uses":[108],"these":[109],"prices":[110],"drive":[112],"lightweight":[114],"greedy":[115],"procedure":[116],"place":[118],"tasks.":[119],"Experimental":[120],"results":[121],"Azure":[123],"traces":[124],"find":[125,200],"CvxCluster":[127,146,165,183],"scales":[128],"100,480":[130],"servers":[131],"under":[132],"proportional":[133],"workload":[134],"growth":[135],"and":[136,176],"sustains":[137],"arrival":[138],"rates":[139],"up":[140],"500,000x":[142],"baseline":[144],"trace.":[145],"runs":[147],"100":[148],"2,500x":[150],"faster":[151,197],"than":[152,192,207],"state-of-the-art":[154],"MIP":[155],"solver":[156],"while":[157],"remaining":[158],"within":[159],"3%":[160],"optimal":[163],"objective.":[164],"can":[166],"support":[167],"constraints":[169],"such":[170],"job":[172],"anti-affinity,":[173],"machine":[174],"types,":[175],"GPU":[177],"key":[180],"insight":[181],"behind":[182],"reformulating":[186],"continuous":[190],"rather":[191],"discrete":[193],"enables":[195],"much":[196],"methods":[198],"solutions":[201],"just":[202],"better":[206],"prior":[208]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-06T00:00:00"}