On the public citation graph
On the design of deadlock-free adaptive routing algorithms for multicomputers: Theoretical aspects
0 signed · 55 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4613-1995-5openalex-snapshot
A VLSI Architecture for Concurrent Data Structures
inferredcites →https://doi.org/10.1016/0141-9331(88)90091-9openalex-snapshot
A VLSI architecture for concurrent data structures
inferredcites →https://doi.org/10.1016/0376-5075(79)90032-1openalex-snapshot
Virtual cut-through: A new computer communication switching technique
inferredcites →https://doi.org/10.1038/scientificamerican0687-108openalex-snapshot
The Connection Machine
inferredcites →https://doi.org/10.1109/12.53599openalex-snapshot
Performance analysis of k-ary n-cube interconnection networks
inferredcites →https://doi.org/10.1109/2.73openalex-snapshot
Multicomputers: message-passing concurrent computers
inferredcites →https://doi.org/10.1109/tc.1981.1675690openalex-snapshot
A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks
inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
inferredcites →https://doi.org/10.1109/tcom.1980.1094666openalex-snapshot
Deadlock Avoidance in Store-and-Forward Networks--I: Store-and-Forward Deadlock
inferredcites →https://doi.org/10.1109/tcom.1981.1095005openalex-snapshot
The Need for Adaptive Routing in the Chaotic and Unbalanced Traffic Environment
inferredcites →https://doi.org/10.1109/tcom.1981.1095021openalex-snapshot
Prevention of Deadlocks in Packet-Switched Data Transport Systems
inferredcites →https://doi.org/10.1145/62297.62382openalex-snapshot
Adaptive packet routing in a hypercube
inferredcites →https://doi.org/10.1145/62297.62385openalex-snapshot
Message routing schemes in a hypercube machine
inferredcites →https://doi.org/10.1145/633625.52411openalex-snapshot
Hyperswitch network for the hypercube computer
inferredcites →https://doi.org/10.1145/633625.52429openalex-snapshot
Deadlock avoidance for systolic communication
inferredcites →https://doi.org/10.1145/74925.74943openalex-snapshot
High performance communications in processor networks
inferredcites →https://doi.org/10.5555/62972.63015openalex-snapshot
iWarp: an integrated solution to high-speed parallel computing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199908)34:1<47::aid-net5>3.0.co;2-3openalex-snapshot
Deadlock-free interval routing schemes
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_115openalex-snapshot
Improving the efficiency of virtual channels with time-dependent selection functions
inferred← citeshttps://doi.org/10.1007/3-540-56731-3_15openalex-snapshot
An experimental study of wormhole routing in parallel computers
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_91openalex-snapshot
On the theory of interconnection networks for parallel computers
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_136openalex-snapshot
Wormhole versus deflection routing: A case study on the mesh
inferred← citeshttps://doi.org/10.1007/978-3-540-46642-0_56openalex-snapshot
Counter-Based Routing Policies
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_26openalex-snapshot
On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Design Methodologies
inferred← citeshttps://doi.org/10.1007/bfb0023472openalex-snapshot
Deadlock-free interval routing schemes
inferred← citeshttps://doi.org/10.1007/bfb0024487openalex-snapshot
Acyclic orientations for deadlock prevention in interconnection networks
inferred← citeshttps://doi.org/10.1016/0167-739x(94)90050-7openalex-snapshot
Improving the efficiency of virtual channels with time-dependent selection functions
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00232-9openalex-snapshot
Deadlock prevention by acyclic orientations
inferred← citeshttps://doi.org/10.1016/s1383-7621(00)00010-2openalex-snapshot
YOMNA – An efficient deadlock-free multicast wormhole algorithm in 2-D mesh multicomputers
inferred← citeshttps://doi.org/10.1109/12.485379openalex-snapshot
A fault-tolerant routing strategy in hypercube multicomputers
inferred← citeshttps://doi.org/10.1109/12.506423openalex-snapshot
Adaptive fault-tolerant deadlock-free routing in meshes and hypercubes
inferred← citeshttps://doi.org/10.1109/12.506426openalex-snapshot
A theory of wormhole routing in parallel computers
inferred← citeshttps://doi.org/10.1109/71.219761openalex-snapshot
Deadlock-free adaptive routing in multicomputer networks using virtual channels
inferred← citeshttps://doi.org/10.1109/71.395404openalex-snapshot
The message flow model for routing in wormhole-routed networks
inferred← citeshttps://doi.org/10.1109/71.466634openalex-snapshot
A theory of deadlock-free adaptive multicast routing in wormhole networks
inferred← citeshttps://doi.org/10.1109/71.707539openalex-snapshot
A general theory for deadlock avoidance in wormhole-routed networks
inferred← citeshttps://doi.org/10.1109/ftcs.1994.315622openalex-snapshot
Fault-tolerant routing strategy in hypercube systems
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2018.00103openalex-snapshot
An Efficient Distributed Minimal Routing Algorithm for Triplet-Based WK-recursive Network
inferred← citeshttps://doi.org/10.1109/icpads.1996.517587openalex-snapshot
Fault-tolerant routing strategy using routing capability in hypercube multicomputers
inferred← citeshttps://doi.org/10.1109/icpp.1994.36openalex-snapshot
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks
inferred← citeshttps://doi.org/10.1109/ipps.1993.262919openalex-snapshot
New wormhole routing algorithms for multicomputers
inferred← citeshttps://doi.org/10.1109/isca.1993.698575openalex-snapshot
A Comparison Of Adaptive Wormhole Routing Algorithms
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205158openalex-snapshot
Wormhole routing in de Bruijn networks and hyper-de Bruijn networks
inferred← citeshttps://doi.org/10.1109/istcs.1993.253469openalex-snapshot
Hot-potato worm routing is almost as easy as store-and-forward packet routing
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267795openalex-snapshot
A theory of wormhole routing in parallel computers
inferred← citeshttps://doi.org/10.1109/spdp.1993.395453openalex-snapshot
Scalable architectures with k-ary n-cube cluster-c organization
inferred← citeshttps://doi.org/10.1109/spdp.1993.395549openalex-snapshot
A new theory of deadlock-free adaptive multicast routing in wormhole networks
inferred← citeshttps://doi.org/10.1109/tc.2012.255openalex-snapshot
Path-Based Partitioning Methods for 3D Networks-on-Chip with Minimal Adaptive Routing
inferred← citeshttps://doi.org/10.1145/164051.164062openalex-snapshot
Fast deflection routing for packets and worms
inferred← citeshttps://doi.org/10.1145/165123.165177openalex-snapshot
A comparison of adaptive wormhole routing algorithms
inferred← citeshttps://doi.org/10.1145/191995.192050openalex-snapshot
Compressionless routing: a framework for adaptive and fault-tolerant routing
inferred← citeshttps://doi.org/10.1145/1999946.1999958openalex-snapshot
Exploring partitioning methods for 3D Networks-on-Chip utilizing adaptive routing model
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.