{"id":"https://openalex.org/W1996874730","doi":"https://doi.org/10.1002/cpe.4330040204","title":"Design, implementation and evaluation of a deadlock\u2010free routing algorithm for concurrent computers","display_name":"Design, implementation and evaluation of a deadlock\u2010free routing algorithm for concurrent computers","publication_year":1992,"publication_date":"1992-04-01","ids":{"openalex":"https://openalex.org/W1996874730","doi":"https://doi.org/10.1002/cpe.4330040204","mag":"1996874730"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.4330040204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330040204","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","raw_type":"journal-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/A5004845138","display_name":"Mario Cannataro","orcid":"https://orcid.org/0000-0003-1502-2387"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. Cannataro","raw_affiliation_strings":["CRAI, Loclita S. Stefano, 87036 Rende, CS, Italy"],"affiliations":[{"raw_affiliation_string":"CRAI, Loclita S. Stefano, 87036 Rende, CS, Italy","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043809260","display_name":"Giandomenico Spezzano","orcid":"https://orcid.org/0000-0002-2518-5510"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G. Spezzano","raw_affiliation_strings":["CRAI, Loclita S. Stefano, 87036 Rende, CS, Italy"],"affiliations":[{"raw_affiliation_string":"CRAI, Loclita S. Stefano, 87036 Rende, CS, Italy","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028177734","display_name":"Domenico Talia","orcid":"https://orcid.org/0000-0003-1910-9236"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. Talia","raw_affiliation_strings":["CRAI, Loclita S. Stefano, 87036 Rende, CS, Italy"],"affiliations":[{"raw_affiliation_string":"CRAI, Loclita S. Stefano, 87036 Rende, CS, Italy","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001035396","display_name":"Edmund Gallizzi","orcid":null},"institutions":[{"id":"https://openalex.org/I88973175","display_name":"Eckerd College","ror":"https://ror.org/04d4qrf43","country_code":"US","type":"education","lineage":["https://openalex.org/I88973175"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Gallizzi","raw_affiliation_strings":["Eckerd College, St. Petersburg, FL 33733, USA"],"affiliations":[{"raw_affiliation_string":"Eckerd College, St. Petersburg, FL 33733, USA","institution_ids":["https://openalex.org/I88973175"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5004845138"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1962,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.88900033,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"2","first_page":"143","last_page":"161"},"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.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8273502588272095},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.734110951423645},{"id":"https://openalex.org/keywords/occam","display_name":"occam","score":0.5804837346076965},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5723579525947571},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5253148078918457},{"id":"https://openalex.org/keywords/distance-vector-routing-protocol","display_name":"Distance-vector routing protocol","score":0.48519328236579895},{"id":"https://openalex.org/keywords/adaptive-routing","display_name":"Adaptive routing","score":0.47469016909599304},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.47355902194976807},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.46034055948257446},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4378598928451538},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.41835179924964905},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3836834728717804},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.21275180578231812},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11416637897491455}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8273502588272095},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.734110951423645},{"id":"https://openalex.org/C78469957","wikidata":"https://www.wikidata.org/wiki/Q838062","display_name":"occam","level":2,"score":0.5804837346076965},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5723579525947571},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5253148078918457},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.48519328236579895},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.47469016909599304},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.47355902194976807},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.46034055948257446},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4378598928451538},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.41835179924964905},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3836834728717804},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.21275180578231812},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11416637897491455},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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.1002/cpe.4330040204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330040204","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W30758060","https://openalex.org/W598394737","https://openalex.org/W1500691897","https://openalex.org/W1507877526","https://openalex.org/W1968606388","https://openalex.org/W1988294273","https://openalex.org/W1991716724","https://openalex.org/W1995879535","https://openalex.org/W2084451913","https://openalex.org/W2164687688","https://openalex.org/W2460634966","https://openalex.org/W2914484629","https://openalex.org/W6921824534"],"related_works":["https://openalex.org/W4242748151","https://openalex.org/W2121563512","https://openalex.org/W2145485627","https://openalex.org/W2081911632","https://openalex.org/W3117346514","https://openalex.org/W2499499497","https://openalex.org/W2353387446","https://openalex.org/W2369931954","https://openalex.org/W2065107411","https://openalex.org/W2957789300"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"describes":[3],"the":[4,6,9,34,52,81,103],"design,":[5],"implementation,":[7],"and":[8,32,68],"performance":[10],"results":[11,100],"of":[12,45,83,93],"a":[13,21,78,91,115],"routing":[14,55,104],"algorithm":[15,28,56,105],"which":[16],"provides":[17],"deadlock\u2010free":[18],"communication":[19,40,85,113],"in":[20],"tightly":[22],"coupled":[23],"message\u2010passing":[24],"concurrent":[25,116],"computer.":[26,117],"The":[27,54,98],"is":[29,96,106],"adaptive,":[30],"isolated":[31],"uses":[33],"store\u2010and\u2010forward":[35],"technique.":[36],"It":[37,73],"allows":[38],"message":[39,66],"between":[41],"two":[42],"processes":[43],"regardless":[44],"where":[46],"they":[47],"are":[48],"physically":[49],"located":[50],"on":[51,90,114],"network.":[53],"has":[57],"many":[58],"positive":[59],"characteristics":[60],"including":[61],"provable":[62],"deadlock":[63],"freedom,":[64],"guaranteed":[65],"arrival,":[67],"automatic":[69],"local":[70],"congestion":[71],"reduction.":[72],"can":[74],"be":[75],"used":[76],"as":[77],"basis":[79],"for":[80],"design":[82],"high\u2010level":[84],"primitives.":[86],"An":[87],"Occam":[88],"implementation":[89],"network":[92],"inmos":[94],"Transputers":[95],"discussed.":[97],"experimental":[99],"show":[101],"that":[102],"effective":[107],"to":[108,111],"support":[109],"process":[110,112]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}