{"id":"https://openalex.org/W1967733447","doi":"https://doi.org/10.1109/infcom.2013.6566945","title":"An efficient distributed algorithm for resource allocation in large-scale coupled systems","display_name":"An efficient distributed algorithm for resource allocation in large-scale coupled systems","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W1967733447","doi":"https://doi.org/10.1109/infcom.2013.6566945","mag":"1967733447"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2013.6566945","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6566945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Proceedings IEEE 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/A5032424832","display_name":"Di Niu","orcid":"https://orcid.org/0000-0002-5250-7327"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Di Niu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Alberta, Canada","Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB, Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB, Canada#TAB#","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083596391","display_name":"Baochun Li","orcid":"https://orcid.org/0000-0003-2404-0974"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Baochun Li","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Toronto, Canada","Dept. of Electr. & Comput. Eng., Univ. of Toronto, Toronto, ON, Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Toronto, Toronto, ON, Canada#TAB#","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032424832"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":7.4135,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.9679988,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"24","issue":null,"first_page":"1501","last_page":"1509"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.995199978351593,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/computer-science","display_name":"Computer science","score":0.8181570768356323},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.7156204581260681},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.7117683291435242},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6450214385986328},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6184105277061462},{"id":"https://openalex.org/keywords/reservation","display_name":"Reservation","score":0.597402811050415},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5923665761947632},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5559873580932617},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.5356924533843994},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.5084065794944763},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.4745826721191406},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.470802903175354},{"id":"https://openalex.org/keywords/resource-management","display_name":"Resource management (computing)","score":0.4587341845035553},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4514178931713104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3817373514175415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1045721173286438},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08804571628570557}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8181570768356323},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.7156204581260681},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7117683291435242},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6450214385986328},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6184105277061462},{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.597402811050415},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5923665761947632},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5559873580932617},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.5356924533843994},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.5084065794944763},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.4745826721191406},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.470802903175354},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.4587341845035553},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4514178931713104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3817373514175415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1045721173286438},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08804571628570557},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2013.6566945","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6566945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.305.1306","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.305.1306","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://iqua.ece.toronto.edu/~bli/papers/dniu-infocom13.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1583497301","https://openalex.org/W1603765807","https://openalex.org/W1987497363","https://openalex.org/W2035536069","https://openalex.org/W2097882016","https://openalex.org/W2108548906","https://openalex.org/W2109168557","https://openalex.org/W2112486185","https://openalex.org/W2123893388","https://openalex.org/W2138772603","https://openalex.org/W2143477261","https://openalex.org/W2158893758","https://openalex.org/W2162986857","https://openalex.org/W2167217653","https://openalex.org/W4292363360","https://openalex.org/W6676214487"],"related_works":["https://openalex.org/W2360483549","https://openalex.org/W4289866588","https://openalex.org/W2923452570","https://openalex.org/W2099904406","https://openalex.org/W206598027","https://openalex.org/W2978610750","https://openalex.org/W2022931285","https://openalex.org/W1589966275","https://openalex.org/W2086872282","https://openalex.org/W2137789903"],"abstract_inverted_index":{"In":[0],"modern":[1],"large-scale":[2,47],"systems,":[3],"fast":[4],"distributed":[5,57],"resource":[6,58,100],"allocation":[7,59],"and":[8,24,37,74,89],"utility":[9],"maximization":[10],"are":[11],"becoming":[12],"increasingly":[13],"important.":[14],"Traditional":[15],"solutions":[16],"to":[17,31,42,56,71],"such":[18],"problems":[19],"rely":[20],"on":[21,103],"primal/dual":[22],"decomposition":[23],"gradient":[25],"methods,":[26],"whose":[27],"convergence":[28,76,87],"is":[29,69],"sensitive":[30],"the":[32,35,44,66,84],"choice":[33],"of":[34,46,97],"stepsize":[36],"may":[38],"not":[39],"be":[40],"sufficient":[41],"satisfy":[43],"requirement":[45],"real-time":[48],"applications.":[49],"We":[50,81],"propose":[51],"a":[52,95],"new":[53,67],"iterative":[54],"approach":[55,68],"in":[60,94],"coupled":[61],"systems.":[62],"Without":[63],"complicating":[64],"message-passing,":[65],"robust":[70],"parameter":[72],"choices":[73],"expedites":[75],"by":[77],"exploiting":[78],"problem":[79],"structures.":[80],"theoretically":[82],"analyze":[83],"asynchronous":[85],"algorithm":[86],"conditions,":[88],"empirically":[90],"evaluate":[91],"its":[92],"benefits":[93],"case":[96],"cloud":[98],"network":[99],"reservation":[101],"based":[102],"real-world":[104],"data.":[105]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}