{"id":"https://openalex.org/W1993293519","doi":"https://doi.org/10.1142/s012962640500212x","title":"A Performance Model of Software-Based Deadlock Recovery Routing Algorithm in Hypercubes","display_name":"A Performance Model of Software-Based Deadlock Recovery Routing Algorithm in Hypercubes","publication_year":2005,"publication_date":"2005-03-01","ids":{"openalex":"https://openalex.org/W1993293519","doi":"https://doi.org/10.1142/s012962640500212x","mag":"1993293519"},"language":"en","primary_location":{"id":"doi:10.1142/s012962640500212x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962640500212x","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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/A5091782280","display_name":"Ahmad Khonsari","orcid":"https://orcid.org/0000-0002-8669-4001"},"institutions":[{"id":"https://openalex.org/I4210146419","display_name":"Institute for Research in Fundamental Sciences","ror":"https://ror.org/04xreqs31","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210146419"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"A. KHONSARI","raw_affiliation_strings":["School of Computer Science,  Institute for Studies in Fundamental Science (IPM), Iran","School of Computer Science, Institute for Studies in Fundamental Science (IPM), Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science,  Institute for Studies in Fundamental Science (IPM), Iran","institution_ids":["https://openalex.org/I4210146419"]},{"raw_affiliation_string":"School of Computer Science, Institute for Studies in Fundamental Science (IPM), Iran","institution_ids":["https://openalex.org/I4210146419"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040238844","display_name":"Hamid Sarbazi\u2010Azad","orcid":"https://orcid.org/0000-0003-4079-8603"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]},{"id":"https://openalex.org/I4210146419","display_name":"Institute for Research in Fundamental Sciences","ror":"https://ror.org/04xreqs31","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210146419"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"H. SARBAZI-AZAD","raw_affiliation_strings":["Department of Computer Engineering,  Sharif University of Technology, School of Computer Science, Institute for Studies in Fundamental Science (IPM), Iran","Department of Computer Engineering, Sharif University of Technology, School of Computer Science, Institute for Studies in Fundamental Science (IPM), Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering,  Sharif University of Technology, School of Computer Science, Institute for Studies in Fundamental Science (IPM), Iran","institution_ids":["https://openalex.org/I133529467","https://openalex.org/I4210146419"]},{"raw_affiliation_string":"Department of Computer Engineering, Sharif University of Technology, School of Computer Science, Institute for Studies in Fundamental Science (IPM), Iran","institution_ids":["https://openalex.org/I133529467","https://openalex.org/I4210146419"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112010073","display_name":"M. Ould\u2010Khaoua","orcid":null},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"M. OULD-KHAOUA","raw_affiliation_strings":["Department of Computing Science,  University of Glasgow, Glasgow, G12 8RZ, U.K","Department of Computing Science, University of Glasgow, Glasgow, G12 8RZ, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science,  University of Glasgow, Glasgow, G12 8RZ, U.K","institution_ids":["https://openalex.org/I7882870"]},{"raw_affiliation_string":"Department of Computing Science, University of Glasgow, Glasgow, G12 8RZ, U.K","institution_ids":["https://openalex.org/I7882870"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0826,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.89634751,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"01n02","first_page":"153","last_page":"168"},"is_retracted":false,"is_paratext":false,"is_xpac":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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9983000159263611,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.996999979019165,"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/timeout","display_name":"Timeout","score":0.832263708114624},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.8093922138214111},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7917616367340088},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.757075309753418},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.6088434457778931},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5385125875473022},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5332083106040955},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.5109075903892517},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.48528262972831726},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.4740804433822632},{"id":"https://openalex.org/keywords/adaptive-routing","display_name":"Adaptive routing","score":0.4672045111656189},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4630233645439148},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.4503718912601471},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4477706253528595},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.3514958322048187},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2977193593978882},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.24433693289756775}],"concepts":[{"id":"https://openalex.org/C31691690","wikidata":"https://www.wikidata.org/wiki/Q1753979","display_name":"Timeout","level":2,"score":0.832263708114624},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.8093922138214111},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7917616367340088},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.757075309753418},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.6088434457778931},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5385125875473022},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5332083106040955},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.5109075903892517},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.48528262972831726},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.4740804433822632},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.4672045111656189},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4630233645439148},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.4503718912601471},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4477706253528595},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.3514958322048187},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2977193593978882},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.24433693289756775},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012962640500212x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962640500212x","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1994644723","https://openalex.org/W2057759849","https://openalex.org/W2085381789","https://openalex.org/W2092709579","https://openalex.org/W2093343353","https://openalex.org/W2102146383","https://openalex.org/W2104674486","https://openalex.org/W2127272160","https://openalex.org/W2128513214","https://openalex.org/W2154323564","https://openalex.org/W3169463464","https://openalex.org/W4255559771"],"related_works":["https://openalex.org/W4233563968","https://openalex.org/W2948211145","https://openalex.org/W1993293519","https://openalex.org/W131232702","https://openalex.org/W2136826008","https://openalex.org/W3117346514","https://openalex.org/W2397529362","https://openalex.org/W2034798120","https://openalex.org/W1522654193","https://openalex.org/W2987832837"],"abstract_inverted_index":{"Recent":[0],"studies":[1],"have":[2],"revealed":[3],"that":[4],"deadlocks":[5],"are":[6,23],"generally":[7],"infrequent":[8],"in":[9,55,97],"the":[10,13,28,34,70,74,78,90,93,107],"network.":[11],"Thus":[12],"hardware":[14],"resources,":[15],"e.g.":[16],"virtual":[17],"channels,":[18],"dedicated":[19],"for":[20,101],"deadlock":[21,42,66,102],"avoidance":[22],"not":[24],"utilised":[25],"most":[26],"of":[27,36,69,73,80,92,106],"time.":[29],"This":[30,44],"consideration":[31],"has":[32],"motivated":[33],"development":[35],"novel":[37],"adaptive":[38,61],"routing":[39,62,99],"algorithms":[40],"with":[41,57,64,85,115],"recovery.":[43,67],"paper":[45],"describes":[46],"a":[47,58],"new":[48],"analytical":[49,113],"model":[50,76,108],"to":[51,88],"predict":[52],"message":[53],"latency":[54],"hypercubes":[56],"true":[59],"fully":[60],"algorithm":[63,100],"progressive":[65],"One":[68],"main":[71],"features":[72],"proposed":[75],"is":[77,109],"use":[79],"results":[81,114],"from":[82],"queueing":[83],"systems":[84],"impatient":[86],"customers":[87],"capture":[89],"effects":[91],"timeout":[94],"mechanism":[95],"used":[96],"this":[98],"detection.":[103],"The":[104],"validity":[105],"demonstrated":[110],"by":[111],"comparing":[112],"those":[116],"obtained":[117],"through":[118],"simulation":[119],"experiments.":[120]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}