{"id":"https://openalex.org/W1987300873","doi":"https://doi.org/10.1145/2755573.2755576","title":"Scheduling in Bandwidth Constrained Tree Networks","display_name":"Scheduling in Bandwidth Constrained Tree Networks","publication_year":2015,"publication_date":"2015-06-12","ids":{"openalex":"https://openalex.org/W1987300873","doi":"https://doi.org/10.1145/2755573.2755576","mag":"1987300873"},"language":"en","primary_location":{"id":"doi:10.1145/2755573.2755576","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2755576","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/A5006392819","display_name":"Sungjin Im","orcid":"https://orcid.org/0000-0001-5994-7280"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sungjin Im","raw_affiliation_strings":["University of California, Merced, Merced, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Merced, Merced, CA, USA","institution_ids":["https://openalex.org/I156087764"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044201440","display_name":"Benjamin Moseley","orcid":"https://orcid.org/0000-0001-8162-017X"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Moseley","raw_affiliation_strings":["Washington University in St. Louis, St. Louis, MO, USA"],"affiliations":[{"raw_affiliation_string":"Washington University in St. Louis, St. Louis, MO, USA","institution_ids":["https://openalex.org/I204465549"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006392819"],"corresponding_institution_ids":["https://openalex.org/I156087764"],"apc_list":null,"apc_paid":null,"fwci":1.6641,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85722661,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"171","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.996399998664856,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9959999918937683,"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/computer-science","display_name":"Computer science","score":0.8347919583320618},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6290022134780884},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5391199588775635},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3721553087234497},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18344417214393616},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08039635419845581}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8347919583320618},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6290022134780884},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5391199588775635},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3721553087234497},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18344417214393616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08039635419845581}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2755573.2755576","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2755576","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","id":"https://metadata.un.org/sdg/8","score":0.5}],"awards":[{"id":"https://openalex.org/G691689332","display_name":null,"funder_award_id":"CCF-1409130","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":35,"referenced_works":["https://openalex.org/W148964820","https://openalex.org/W165387623","https://openalex.org/W619094676","https://openalex.org/W1501066815","https://openalex.org/W1544574065","https://openalex.org/W1698388015","https://openalex.org/W1851201406","https://openalex.org/W1972868674","https://openalex.org/W1983347794","https://openalex.org/W1983616616","https://openalex.org/W1994553105","https://openalex.org/W1998382156","https://openalex.org/W2010882308","https://openalex.org/W2016361428","https://openalex.org/W2040040773","https://openalex.org/W2044304745","https://openalex.org/W2048898205","https://openalex.org/W2049916336","https://openalex.org/W2050977060","https://openalex.org/W2051586153","https://openalex.org/W2074798342","https://openalex.org/W2080167233","https://openalex.org/W2084427019","https://openalex.org/W2088632781","https://openalex.org/W2100283019","https://openalex.org/W2102252987","https://openalex.org/W2112288559","https://openalex.org/W2120354662","https://openalex.org/W2130531694","https://openalex.org/W2138593964","https://openalex.org/W2139739478","https://openalex.org/W2168550848","https://openalex.org/W2170045213","https://openalex.org/W2258448061","https://openalex.org/W4238465620"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W4402327032","https://openalex.org/W2382290278"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,97,120],"introduce":[4,121],"a":[5,19,77,102,135,142],"new":[6],"network":[7,32,37],"scheduling":[8,140],"model.":[9],"Here":[10],"jobs":[11],"need":[12],"to":[13,21,23,100,141],"be":[14,24],"sent":[15],"via":[16],"routers":[17,83,108],"on":[18,99],"tree":[20,139],"machines":[22,88,113],"scheduled,":[25],"and":[26,39,86,111,128],"the":[27,64,72,107,112],"communication":[28,38],"is":[29,47],"constrained":[30],"by":[31],"bandwidth.":[33],"The":[34],"scheduler":[35,46],"coordinates":[36],"job":[40,60],"machine":[41],"scheduling.":[42],"This":[43],"type":[44],"of":[45,67,125,137,145],"highly":[48],"desirable":[49],"in":[50,71],"practice;":[51],"yet":[52],"few":[53],"works":[54],"have":[55],"considered":[56],"combing":[57],"networking":[58],"with":[59],"processing.":[61],"We":[62,75],"consider":[63],"popular":[65],"objective":[66],"total":[68],"flow":[69],"time":[70],"online":[73],"setting.":[74],"give":[76],"(1+\u03b5)-speed":[78],"O(1/\u03b57)-competitive":[79,104],"algorithm":[80,105],"when":[81,106],"all":[82,87],"are":[84,89,109,114],"identical":[85,90,110],"for":[91],"any":[92],"fixed":[93],"eps":[94],">0.":[95],"Then":[96],"go":[98],"show":[101,117],"(2+\u03b5)-speed":[103],"unrelated.":[115],"To":[116],"these":[118],"results":[119],"an":[122],"interesting":[123],"combination":[124],"potential":[126],"function":[127],"dual":[129],"fitting":[130],"techniques":[131],"as":[132,134],"well":[133],"reduction":[136],"general":[138],"special":[143],"case":[144],"trees.":[146]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"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"}