On the public citation graph

Deadlock-free message routing in multicomputer networks

https://doi.org/10.1007/bf01784886
0 signed · 17 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01660031openalex-snapshot
The torus routing chip
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.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.1095021openalex-snapshot
Prevention of Deadlocks in Packet-Switched Data Transport Systems
inferredcites →https://doi.org/10.1109/tse.1987.232560openalex-snapshot
Local Distributed Deadlock Detection by Cycle Detection and Clusterng
inferredcites →https://doi.org/10.7907/9evc-2x08.openalex-snapshot
The extension of object-oriented languages to a homogeneous, concurrent architecture

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-53065-7_127openalex-snapshot
A deadlock free routing algorithm with network size independent buffering space
inferred← citeshttps://doi.org/10.1007/bfb0032936openalex-snapshot
Performance benefits from locally adaptive interval routing in dynamically switched interconnection networks
inferred← citeshttps://doi.org/10.1007/s002240010011openalex-snapshot
On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00094-5openalex-snapshot
Performance evaluation of deterministic wormhole routing in k-ary n-cubes
inferred← citeshttps://doi.org/10.1109/12.338097openalex-snapshot
Storage-efficient, deadlock-free packet routing algorithms for torus networks
inferred← citeshttps://doi.org/10.1109/71.532115openalex-snapshot
A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks
inferred← citeshttps://doi.org/10.1109/icpp.1997.622669openalex-snapshot
An Euler path based technique for deadlock-free multicasting
inferred← citeshttps://doi.org/10.1137/s0097539792231830openalex-snapshot
Requirements for Deadlock-Free, Adaptive Packet Routing
inferred← citeshttps://doi.org/10.1145/135419.135425openalex-snapshot
Requirements for deadlock-free, adaptive packet routing
inferred← citeshttps://doi.org/10.1145/277651.277671openalex-snapshot
Deadlock-free routing in arbitrary networks via the flattest common supersequence method
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.