{"id":"https://openalex.org/W2062428974","doi":"https://doi.org/10.1145/2755573.2755592","title":"Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks","display_name":"Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks","publication_year":2015,"publication_date":"2015-06-12","ids":{"openalex":"https://openalex.org/W2062428974","doi":"https://doi.org/10.1145/2755573.2755592","mag":"2062428974"},"language":"en","primary_location":{"id":"doi:10.1145/2755573.2755592","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2755592","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures","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/A5045614063","display_name":"Zhen Qiu","orcid":"https://orcid.org/0000-0002-0226-7855"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zhen Qiu","raw_affiliation_strings":["Columbia University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054641291","display_name":"Clifford Stein","orcid":"https://orcid.org/0000-0002-0614-6620"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cliff Stein","raw_affiliation_strings":["Columbia University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101087537","display_name":"Yuan Zhong","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuan Zhong","raw_affiliation_strings":["Columbia University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5045614063"],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":33.3729,"has_fulltext":false,"cited_by_count":104,"citation_normalized_percentile":{"value":0.9964718,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"294","last_page":"303"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987999796867371,"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/heuristics","display_name":"Heuristics","score":0.7960877418518066},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6790915727615356},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6566677093505859},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6434058547019958},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4975915253162384},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4841669201850891},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4319230020046234},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4274025559425354},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.38648054003715515},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3229601979255676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1409892737865448}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7960877418518066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6790915727615356},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6566677093505859},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6434058547019958},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4975915253162384},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4841669201850891},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4319230020046234},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4274025559425354},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.38648054003715515},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3229601979255676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1409892737865448},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2755573.2755592","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2755592","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G2819666176","display_name":null,"funder_award_id":"CCF-1349602","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W24985204","https://openalex.org/W169464267","https://openalex.org/W1546279261","https://openalex.org/W1965437596","https://openalex.org/W1982055457","https://openalex.org/W1994317365","https://openalex.org/W2013932952","https://openalex.org/W2016432178","https://openalex.org/W2056273707","https://openalex.org/W2082521007","https://openalex.org/W2092252886","https://openalex.org/W2092844320","https://openalex.org/W2106863923","https://openalex.org/W2110514750","https://openalex.org/W2112486185","https://openalex.org/W2117884704","https://openalex.org/W2119738171","https://openalex.org/W2122465391","https://openalex.org/W2122967269","https://openalex.org/W2131975293","https://openalex.org/W2136380306","https://openalex.org/W2143692116","https://openalex.org/W2148204686","https://openalex.org/W2149939304","https://openalex.org/W2151632247","https://openalex.org/W2154203494","https://openalex.org/W2159158649","https://openalex.org/W2167444644","https://openalex.org/W2168427242","https://openalex.org/W2485138090","https://openalex.org/W2490627488","https://openalex.org/W2611147814","https://openalex.org/W2743045177","https://openalex.org/W3162452290","https://openalex.org/W4232284301","https://openalex.org/W4251459357"],"related_works":["https://openalex.org/W1581479499","https://openalex.org/W2031161030","https://openalex.org/W4256526124","https://openalex.org/W2009870120","https://openalex.org/W2795923574","https://openalex.org/W2943856120","https://openalex.org/W2505019705","https://openalex.org/W3127756288","https://openalex.org/W3020502198","https://openalex.org/W2626912061"],"abstract_inverted_index":{"Communications":[0],"in":[1,9,30,35],"datacenter":[2],"jobs":[3],"(such":[4],"as":[5,76],"the":[6,42,66,79,96,116,152,172],"shuffle":[7],"operations":[8],"MapReduce":[10],"applications)":[11],"often":[12],"involve":[13],"many":[14],"parallel":[15,24],"flows,":[16],"which":[17,84],"may":[18],"be":[19,89],"processed":[20],"simultaneously.":[21],"This":[22],"highly":[23],"structure":[25],"presents":[26],"new":[27],"scheduling":[28,70,130],"challenges":[29],"optimizing":[31],"job-level":[32],"performance":[33,154],"objectives":[34],"data":[36],"centers.":[37],"Chowdhury":[38,52],"and":[39,50,111,131,134,174],"Stoica":[40],"introduced":[41],"coflow":[43],"abstraction":[44],"to":[45,58,77,88,150],"capture":[46],"these":[47],"communication":[48],"patterns,":[49],"recently":[51],"et":[53],"al.":[54],"developed":[55],"effective":[56,169],"heuristics":[57],"schedule":[59],"coflows.":[60,141],"In":[61],"this":[62,103],"paper,":[63],"we":[64],"consider":[65],"problem":[67],"of":[68,109,115,121,140,155,171],"efficiently":[69],"coflows":[71],"with":[72,105,118],"release":[73],"dates":[74],"so":[75],"minimize":[78],"total":[80],"weighted":[81],"completion":[82],"time,":[83],"has":[85,179],"been":[86],"shown":[87],"strongly":[90],"NP-hard.":[91],"Our":[92,123,162],"main":[93],"result":[94],"is":[95],"first":[97],"polynomial-time":[98],"deterministic":[99,160,177],"approximation":[100,107],"algorithm":[101,178],"for":[102],"problem,":[104],"an":[106],"ratio":[108,120],"67/3,":[110],"a":[112,119,137,147],"randomized":[113],"version":[114],"algorithm,":[117],"9+16\u221a2/3.":[122],"results":[124],"use":[125],"techniques":[126],"from":[127],"both":[128],"combinatorial":[129],"matching":[132],"theory,":[133],"rely":[135],"on":[136,146],"clever":[138],"grouping":[139],"We":[142],"also":[143],"run":[144],"experiments":[145,163],"Facebook":[148],"trace":[149],"test":[151],"practical":[153],"several":[156],"algorithms,":[157],"including":[158],"our":[159,176],"algorithm.":[161],"suggest":[164],"that":[165,175],"simple":[166],"algorithms":[167],"provide":[168],"approximations":[170],"optimal,":[173],"near-optimal":[180],"performance.":[181]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}