{"id":"https://openalex.org/W2136249948","doi":"https://doi.org/10.1109/ipdps.2009.5161081","title":"Disjoint-path routing: Efficient communication for streaming applications","display_name":"Disjoint-path routing: Efficient communication for streaming applications","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2136249948","doi":"https://doi.org/10.1109/ipdps.2009.5161081","mag":"2136249948"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2009.5161081","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2009.5161081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Parallel & Distributed Processing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5111981884","display_name":"Daeho Seo","orcid":null},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DaeHo Seo","raw_affiliation_strings":["Intel Corporation, Austin, TX, USA","Intel Corp., Austin TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intel Corporation, Austin, TX, USA","institution_ids":["https://openalex.org/I1343180700"]},{"raw_affiliation_string":"Intel Corp., Austin TX, USA","institution_ids":["https://openalex.org/I1343180700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069139257","display_name":"Mithuna Thottethodi","orcid":"https://orcid.org/0000-0003-4164-4542"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mithuna Thottethodi","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","School of Electrical and Computer Engineering. Purdue University, West Lafayette, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"School of Electrical and Computer Engineering. Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2803,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.80243519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"220","issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9965999722480774,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9958000183105469,"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.8522009253501892},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5872162580490112},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5711464881896973},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.549338161945343},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4950644075870514},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4188719391822815},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.41474607586860657},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.26250404119491577}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8522009253501892},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5872162580490112},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5711464881896973},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.549338161945343},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4950644075870514},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4188719391822815},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.41474607586860657},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.26250404119491577},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2009.5161081","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2009.5161081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Parallel & Distributed Processing","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.5699999928474426}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1568192366","https://openalex.org/W1971006600","https://openalex.org/W2002886574","https://openalex.org/W2004076644","https://openalex.org/W2024060531","https://openalex.org/W2032309817","https://openalex.org/W2043389883","https://openalex.org/W2080285119","https://openalex.org/W2108824541","https://openalex.org/W2126495708","https://openalex.org/W2134408405","https://openalex.org/W2156864916","https://openalex.org/W2159456929","https://openalex.org/W2162180547","https://openalex.org/W2172212694","https://openalex.org/W4241513866"],"related_works":["https://openalex.org/W2108305519","https://openalex.org/W3035942111","https://openalex.org/W2347665962","https://openalex.org/W2138640781","https://openalex.org/W2162880363","https://openalex.org/W2351097701","https://openalex.org/W1971663816","https://openalex.org/W2555559350","https://openalex.org/W2001312276","https://openalex.org/W4237143639"],"abstract_inverted_index":{"Streaming":[0,10],"is":[1,102],"emerging":[2],"as":[3,28],"an":[4,12,103],"important":[5],"programming":[6],"model":[7],"for":[8,50,97,132,170,175],"multicores.":[9],"provides":[11],"elegant":[13],"way":[14],"to":[15,35,93],"express":[16],"task":[17],"decomposition":[18],"and":[19,37,122,164,174],"inter-task":[20],"communication,":[21],"while":[22],"hiding":[23],"laborious":[24],"orchestration":[25],"details":[26],"such":[27],"load":[29],"balancing,":[30],"assignment":[31],"(of":[32],"stream":[33,98],"computation":[34],"nodes)":[36],"computation/communication":[38],"scheduling":[39],"from":[40],"the":[41,55,78,109,124],"programmer.":[42],"This":[43],"paper":[44],"develops":[45],"a":[46,83,150],"novel":[47],"communication":[48],"optimization":[49],"streaming":[51,58,134,172,177],"applications":[52],"based":[53],"on":[54],"observation":[56],"that":[57,88],"computations":[59],"typically":[60],"involve":[61],"large,":[62],"systematic":[63],"data":[64],"transfers":[65],"between":[66],"known":[67],"communicating":[68],"pairs":[69],"of":[70,75,85,111,120,126,140],"nodes":[71],"over":[72,91,117],"extended":[73],"periods":[74,119],"time.":[76],"From":[77],"above":[79],"observation,":[80],"we":[81],"advocate":[82],"family":[84],"routing":[86,101,129,142,159],"algorithms":[87],"expend":[89],"some":[90],"overheads":[92,110],"compute":[94],"disjoint":[95,113,127],"paths":[96,114],"communication.":[99],"Disjoint-path":[100],"attractive":[104],"design":[105],"point":[106],"because":[107],"(a)":[108],"discovering":[112],"are":[115,130],"amortized":[116],"large":[118],"time":[121],"(b)":[123],"benefits":[125],"path":[128],"significant":[131],"bandwidth-sensitive":[133],"applications.":[135],"We":[136],"develop":[137],"one":[138],"instance":[139],"disjoint-path":[141],"called":[143],"tentacle":[144,158],"routing-a":[145],"backtracking,":[146],"best-effort":[147],"technique.":[148],"On":[149],"4":[151,153],"times":[152,155],"(6":[154],"6)":[156],"system,":[157],"results":[160],"in":[161],"55%":[162],"(84%)":[163],"28%":[165],"(41%)":[166],"mean":[167],"throughput":[168],"improvement":[169],"high-network-contention":[171],"applications,":[173,178],"all":[176],"respectively.":[179]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}