{"id":"https://openalex.org/W1964352350","doi":"https://doi.org/10.1137/s0097539792231830","title":"Requirements for Deadlock-Free, Adaptive Packet Routing","display_name":"Requirements for Deadlock-Free, Adaptive Packet Routing","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W1964352350","doi":"https://doi.org/10.1137/s0097539792231830","mag":"1964352350"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792231830","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5008478066","display_name":"Robert Cypher","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Cypher","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5080063580","display_name":"Luis Gravano","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luis Gravano","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.029,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":15,"citation_normalized_percentile":{"value":0.845307,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":81,"max":82},"biblio":{"volume":"23","issue":"6","first_page":"1266","last_page":"1274"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10829","display_name":"Interconnection Networks and Systems","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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.997,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9949,"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/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.529013},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.5129761}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.74296224},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.62241364},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.529013},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.5129761},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.48899996},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.47937158},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46784577},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.46322444},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.45415157},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.42093408},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33982337},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.3171662},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.21418715}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792231830","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"display_name":"Peace, justice, and strong institutions","id":"https://metadata.un.org/sdg/16"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":8,"referenced_works":["https://openalex.org/W1989693809","https://openalex.org/W2042208180","https://openalex.org/W2055355743","https://openalex.org/W2065742943","https://openalex.org/W2109053145","https://openalex.org/W2154323564","https://openalex.org/W2164501624","https://openalex.org/W2164687688"],"related_works":["https://openalex.org/W2607223747","https://openalex.org/W2555559350","https://openalex.org/W2543752581","https://openalex.org/W2361465121","https://openalex.org/W2360686363","https://openalex.org/W2081964190","https://openalex.org/W2050076411","https://openalex.org/W2001478969","https://openalex.org/W1762001801","https://openalex.org/W1542183432"],"abstract_inverted_index":{"This":[0,115],"paper":[1],"studies":[2],"the":[3,24,29,37,67,117],"problem":[4],"of":[5,27,39,97,121],"deadlock-free":[6],"packet":[7,34,59,85,129],"routing":[8,60,86,130],"in":[9,112],"parallel":[10],"and":[11,99,133],"distributed":[12],"architectures.":[13],"Three":[14],"main":[15],"results":[16],"are":[17],"presented.":[18],"First,":[19],"it":[20,52,80],"is":[21,45,53,76,81,95],"shown":[22,54,82],"that":[23,32,55,83],"standard":[25],"technique":[26],"ordering":[28],"buffers":[30,111,123],"so":[31],"every":[33,56],"always":[35],"has":[36],"possibility":[38],"moving":[40],"to":[41,70],"a":[42,89],"higher-ordered":[43],"buffer":[44],"not":[46],"necessary":[47],"for":[48,88,126],"deadlock":[49,98],"freedom.":[50],"Second,":[51],"deadlock-free,":[57,127],"adaptive":[58],"algorithm":[61,74,87],"can":[62],"be":[63],"restricted,":[64],"by":[65],"limiting":[66],"adaptivity":[68],"available,":[69],"obtain":[71],"an":[72],"oblivious":[73],"which":[75,94,100],"also":[77],"deadlock-free.":[78],"Third,":[79],"any":[84],"cycle":[90,132],"or":[91],"torus":[92,134],"network":[93],"free":[96],"uses":[101],"only":[102],"minimal":[103,128],"length":[104],"paths":[105],"must":[106],"require":[107],"at":[108],"least":[109],"three":[110,122],"some":[113],"node.":[114],"matches":[116],"known":[118],"upper":[119],"bound":[120],"per":[124],"node":[125],"on":[131],"networks.":[135]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1964352350","counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2024-12-14T14:32:06.986851","created_date":"2016-06-24"}