{"id":"https://openalex.org/W1490557056","doi":"https://doi.org/10.1109/infocom.2015.7218529","title":"Fast optimal nonconcave resource allocation","display_name":"Fast optimal nonconcave resource allocation","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1490557056","doi":"https://doi.org/10.1109/infocom.2015.7218529","mag":"1490557056"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2015.7218529","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2015.7218529","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Communications (INFOCOM)","raw_type":"proceedings-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/A5014790039","display_name":"Pan Lai","orcid":"https://orcid.org/0000-0002-4967-5573"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Pan Lai","raw_affiliation_strings":["School of Computer Engineering Nanyang Technological University, Singapore","School of Computer Engineering, Nanyang Technological University,,Singapore"],"affiliations":[{"raw_affiliation_string":"School of Computer Engineering Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"School of Computer Engineering, Nanyang Technological University,,Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043078695","display_name":"Rui Fan","orcid":"https://orcid.org/0000-0003-3369-2448"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Rui Fan","raw_affiliation_strings":["School of Computer Engineering Nanyang Technological University, Singapore","School of Computer Engineering, Nanyang Technological University,,Singapore"],"affiliations":[{"raw_affiliation_string":"School of Computer Engineering Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"School of Computer Engineering, Nanyang Technological University,,Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014790039"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":0.9985,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78028349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6329455375671387},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6276300549507141},{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.5740392208099365},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5654210448265076},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46412137150764465},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4455201029777527},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4013960659503937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27223631739616394}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6329455375671387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6276300549507141},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.5740392208099365},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5654210448265076},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46412137150764465},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4455201029777527},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4013960659503937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27223631739616394},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"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.1109/infocom.2015.7218529","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2015.7218529","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Communications (INFOCOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321026","display_name":"Ministry of Earth Sciences","ror":"https://ror.org/013cf5k59"},{"id":"https://openalex.org/F4320322724","display_name":"Ministry of Education, India","ror":"https://ror.org/048xjjh50"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1692732447","https://openalex.org/W1705251487","https://openalex.org/W1967474856","https://openalex.org/W1974875356","https://openalex.org/W2019176509","https://openalex.org/W2020590137","https://openalex.org/W2024427769","https://openalex.org/W2036971780","https://openalex.org/W2064359039","https://openalex.org/W2070218576","https://openalex.org/W2072753794","https://openalex.org/W2076512004","https://openalex.org/W2108525418","https://openalex.org/W2113195911","https://openalex.org/W2120070938","https://openalex.org/W2123039860","https://openalex.org/W2126543901","https://openalex.org/W2129816520","https://openalex.org/W2130434445","https://openalex.org/W2134789631","https://openalex.org/W2143773524","https://openalex.org/W2144941482","https://openalex.org/W3148691794","https://openalex.org/W4236127247","https://openalex.org/W4240125563","https://openalex.org/W6679907205"],"related_works":["https://openalex.org/W2076743759","https://openalex.org/W4235144492","https://openalex.org/W2756744637","https://openalex.org/W2756792282","https://openalex.org/W2757282711","https://openalex.org/W2759493398","https://openalex.org/W4254767272","https://openalex.org/W2026076591","https://openalex.org/W2759073630","https://openalex.org/W4243761232"],"abstract_inverted_index":{"Efficient":[0],"use":[1],"of":[2,13,24,73,100,128,175,180,185],"shared":[3,186],"resources":[4,25],"is":[5,38,172,190,196],"a":[6,10,97,148],"key":[7],"problem":[8],"in":[9,30,39,71,135,159,199,227],"wide":[11],"range":[12],"computer":[14],"systems,":[15],"from":[16],"cloud":[17],"computing":[18],"to":[19,55],"multicore":[20],"processors.":[21],"Optimized":[22],"allocation":[23,37,115,153],"among":[26],"users":[27],"can":[28,93],"result":[29],"dramatically":[31],"improved":[32],"overall":[33],"system":[34],"performance.":[35],"Resource":[36],"general":[40],"NP-complete,":[41],"and":[42,76,111,143,188,203,212,255],"past":[43],"works":[44],"have":[45,69,206],"mostly":[46],"focused":[47],"on":[48],"studying":[49],"concave":[50,101],"performance":[51,85,261],"curves,":[52,57],"applying":[53],"heuristics":[54],"nonconcave":[56],"or":[58,102],"finding":[59,248],"optimal":[60,110,113,132,152,249],"solutions":[61,250,257],"using":[62],"slow":[63],"dynamic":[64,245],"programming":[65,246],"methods.":[66],"These":[67],"approaches":[68],"drawbacks":[70],"terms":[72],"generality,":[74],"accuracy":[75],"efficiency.":[77],"In":[78],"this":[79,117],"paper,":[80],"we":[81],"observe":[82],"that":[83,125,195,237],"realistic":[84],"curves":[86],"are":[87,224,240],"often":[88],"not":[89],"concave,":[90],"but":[91],"rather":[92],"be":[94,127],"broken":[95],"into":[96],"small":[98],"number":[99,174,179],"convex":[103],"segments.":[104],"We":[105,119],"present":[106],"efficient":[107],"algorithms":[108,205,223,239],"for":[109,154,247],"approximately":[112],"resource":[114],"leveraging":[116],"idea.":[118],"also":[120],"introduce":[121],"several":[122],"algorithmic":[123],"techniques":[124],"may":[126],"independent":[129],"interest.":[130],"Our":[131],"algorithm":[133,146],"runs":[134],"O(sn\u03b1(m)m(log":[136],"m)":[137,168],"<sup":[138,162,208,214],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[139,163,209,215],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[140,164,210,216],")":[141,211],"time,":[142],"our":[144,222,238],"approximation":[145,204],"finds":[147],"1":[149],"-":[150],"\u03b5":[151,156],"any":[155],">":[157],"0":[158],"O(s/\u03b5":[160],"\u03b1(n/\u03b5)n":[161],"log":[165,167],"n/\u03b5":[166],"time;":[169],"here,":[170],"s":[171],"the":[173,178,183,191,228],"segments,":[176],"n":[177,232],"processes,":[181],"m":[182,252],"amount":[184],"resource,":[187],"\u03b1":[189],"inverse":[192],"Ackermann":[193],"function":[194],"\u2264":[197],"4":[198],"practice.":[200],"Existing":[201],"exact":[202],"O(nm":[207],"O(n":[213],"m/\u03b5)":[217],"running":[218],"times,":[219],"resp.,":[220],"so":[221],"much":[225],"faster":[226,243],"practical":[229],"case":[230],"where":[231],"<;<;":[233],"m.":[234],"Experiments":[235],"show":[236],"215":[241],"times":[242],"than":[244,262],"when":[251],"=":[253],"1M,":[254],"produce":[256],"with":[258],"33%":[259],"better":[260],"greedy":[263],"algorithms.":[264]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}