{"id":"https://openalex.org/W2795054147","doi":"https://doi.org/10.1145/3205289.3205307","title":"High-Performance, Low-Complexity Deadlock Avoidance for Arbitrary Topologies/Routings","display_name":"High-Performance, Low-Complexity Deadlock Avoidance for Arbitrary Topologies/Routings","publication_year":2018,"publication_date":"2018-06-12","ids":{"openalex":"https://openalex.org/W2795054147","doi":"https://doi.org/10.1145/3205289.3205307","mag":"2795054147"},"language":"en","primary_location":{"id":"doi:10.1145/3205289.3205307","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3205289.3205307","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 International Conference on Supercomputing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.manchester.ac.uk/files/67366606/high_performance_low.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101889047","display_name":"Jos\u00e9 A. Pascual","orcid":"https://orcid.org/0000-0001-5355-6537"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jose A. Pascual","raw_affiliation_strings":["The University of Manchester, Manchester, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Manchester, Manchester, United Kingdom","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068556222","display_name":"Javier Navaridas","orcid":"https://orcid.org/0000-0001-7272-6597"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Javier Navaridas","raw_affiliation_strings":["The University of Manchester, Manchester, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Manchester, Manchester, United Kingdom","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I28407311"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"129","last_page":"138"},"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9957000017166138,"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.9948999881744385,"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.7727154493331909},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.7322208285331726},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6780830025672913},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.6052889823913574},{"id":"https://openalex.org/keywords/virtual-channel","display_name":"Virtual channel","score":0.4737991690635681},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.4325619339942932},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41049110889434814},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.38678765296936035},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.37876784801483154},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.28516334295272827},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16355237364768982},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13710147142410278}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7727154493331909},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.7322208285331726},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6780830025672913},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.6052889823913574},{"id":"https://openalex.org/C2777076873","wikidata":"https://www.wikidata.org/wiki/Q2291875","display_name":"Virtual channel","level":3,"score":0.4737991690635681},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.4325619339942932},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41049110889434814},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.38678765296936035},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.37876784801483154},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.28516334295272827},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16355237364768982},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13710147142410278},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3205289.3205307","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3205289.3205307","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 International Conference on Supercomputing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/c73d4178-15c1-45cd-a310-cc58eb314c2b","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/c73d4178-15c1-45cd-a310-cc58eb314c2b","pdf_url":"https://research.manchester.ac.uk/files/67366606/high_performance_low.pdf","source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pascual Saiz, J & Navaridas, J 2018, High-Performance, Low-Complexity Deadlock Avoidance for Arbitrary Topologies/Routings. in ACM International Conference on Supercomputing. https://doi.org/10.1145/3205289.3205307","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.atira.dk:publications/c73d4178-15c1-45cd-a310-cc58eb314c2b","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/highperformance-lowcomplexity-deadlock-avoidance-for-arbitrary-topologiesroutings(c73d4178-15c1-45cd-a310-cc58eb314c2b).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/c73d4178-15c1-45cd-a310-cc58eb314c2b","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/c73d4178-15c1-45cd-a310-cc58eb314c2b","pdf_url":"https://research.manchester.ac.uk/files/67366606/high_performance_low.pdf","source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pascual Saiz, J & Navaridas, J 2018, High-Performance, Low-Complexity Deadlock Avoidance for Arbitrary Topologies/Routings. in ACM International Conference on Supercomputing. https://doi.org/10.1145/3205289.3205307","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2795054147.pdf","grobid_xml":"https://content.openalex.org/works/W2795054147.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W954146035","https://openalex.org/W1583687333","https://openalex.org/W1585716122","https://openalex.org/W1687042661","https://openalex.org/W2003860501","https://openalex.org/W2025854428","https://openalex.org/W2046940417","https://openalex.org/W2087589181","https://openalex.org/W2091091642","https://openalex.org/W2099273701","https://openalex.org/W2106038398","https://openalex.org/W2107997203","https://openalex.org/W2117086555","https://openalex.org/W2124906592","https://openalex.org/W2126210439","https://openalex.org/W2128452435","https://openalex.org/W2136590668","https://openalex.org/W2143065961","https://openalex.org/W2143404251","https://openalex.org/W2154323564","https://openalex.org/W2154712057","https://openalex.org/W2155861865","https://openalex.org/W2163769126","https://openalex.org/W2167935944","https://openalex.org/W2418378282","https://openalex.org/W2570245881","https://openalex.org/W2613073681","https://openalex.org/W2741794334","https://openalex.org/W2745518244","https://openalex.org/W2757522925","https://openalex.org/W2789312982","https://openalex.org/W3147460469","https://openalex.org/W4232093111"],"related_works":["https://openalex.org/W397120980","https://openalex.org/W2086397253","https://openalex.org/W1528537929","https://openalex.org/W3021060317","https://openalex.org/W2971368204","https://openalex.org/W2133122801","https://openalex.org/W4200402473","https://openalex.org/W2083551465","https://openalex.org/W2198124394","https://openalex.org/W3158095734"],"abstract_inverted_index":{"Recently,":[0],"the":[1,36,81,88,91,109,112],"use":[2,156],"of":[3,38,71,90,161],"graph-based":[4],"network":[5,49],"topologies":[6],"has":[7],"been":[8],"proposed":[9,97],"as":[10,17,35],"an":[11,103],"alternative":[12],"to":[13,22,107,138],"traditional":[14],"networks":[15,140],"such":[16,34],"tori":[18],"or":[19,51],"fat-trees":[20],"due":[21],"their":[23],"very":[24],"good":[25],"topological":[26],"characteristics.":[27],"However":[28],"they":[29],"pose":[30],"practical":[31],"implementation":[32],"challenges":[33],"lack":[37,52],"deadlock":[39,60],"avoidance":[40,61],"strategies.":[41],"Previous":[42],"proposals":[43,101],"are":[44,74],"either":[45],"exceedingly":[46],"complex,":[47],"underutilise":[48],"resources":[50],"flexibility.":[53],"We":[54,94],"propose--and":[55],"prove":[56],"formally--three":[57],"generic,":[58],"low-complexity":[59],"mechanisms":[62,98,145],"that":[63,80,143,167],"only":[64],"require":[65],"local":[66],"information.":[67],"The":[68],"main":[69],"strengths":[70],"our":[72,96,144,168],"method":[73],"its":[75],"topology-":[76],"and":[77,79,117,130,141,174],"routing-independence":[78],"virtual":[82,162],"channel":[83],"count":[84],"is":[85],"bounded":[86],"by":[87],"length":[89],"longest":[92],"path.":[93],"evaluate":[95],"against":[99,123],"previous":[100],"through":[102],"extensive":[104],"simulation":[105],"study":[106],"measure":[108],"impact":[110],"on":[111],"performance":[113,133,176],"using":[114],"both":[115],"synthetic":[116],"realistic":[118],"traffic.":[119],"First":[120],"we":[121,136,165],"compare":[122],"a":[124,157,171],"well-known":[125],"HPC":[126],"mechanism":[127],"for":[128],"dragonfly":[129],"achieved":[131],"similar":[132],"level.":[134],"Then":[135],"moved":[137],"Graph-based":[139],"show":[142],"can":[146],"greatly":[147],"outperform":[148],"traditional,":[149],"spanning-tree":[150],"based":[151],"mechanisms,":[152],"even":[153],"if":[154],"these":[155],"much":[158],"larger":[159],"number":[160],"channels.":[163],"Overall,":[164],"find":[166],"proposal":[169],"provides":[170],"simple,":[172],"flexible":[173],"high":[175],"deadlock-avoidance":[177],"solution.":[178]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}