On the public citation graph

Performance benefits from locally adaptive interval routing in dynamically switched interconnection networks

https://doi.org/10.1007/bfb0032936
0 signed · 24 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/978-3-642-77422-5openalex-snapshot
Architektur von Rechensystemen
inferredcites →https://doi.org/10.1007/bf01784886openalex-snapshot
Deadlock-free message routing in multicomputer networks
inferredcites →https://doi.org/10.1093/comjnl/30.4.298openalex-snapshot
Interval Routing
inferredcites →https://doi.org/10.1109/tc.1981.1675695openalex-snapshot
Performance of Processor-Memory Interconnections for Multiprocessors
inferredcites →https://doi.org/10.1109/tc.1983.1676169openalex-snapshot
The Performance of Multistage Interconnection Networks for Multiprocessors
inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

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-55599-4_115openalex-snapshot
Improving the efficiency of virtual channels with time-dependent selection functions
inferred← citeshttps://doi.org/10.1007/3-540-55895-0_441openalex-snapshot
On the practical efficiency of Randomized Shared Memory
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_27openalex-snapshot
Parallel architectures: Design and efficient use
inferred← citeshttps://doi.org/10.1007/3-540-56731-3_10openalex-snapshot
A realizable efficient parallel architecture
inferred← citeshttps://doi.org/10.1007/3-540-57307-0_29openalex-snapshot
Randomized Shared Memory—Concept and Efficiency of a Scalable Shared Memory Scheme
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_60openalex-snapshot
Communication throughput of interconnection networks
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_111openalex-snapshot
The complexity of interval routing on random graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-77422-5_16openalex-snapshot
Communication Performance of Advanced Transputer Networks for Universal Message-Passing
inferred← citeshttps://doi.org/10.1007/978-3-642-93501-5_10openalex-snapshot
Virtually Shared Memory Architectures for Scalable Universal Parallel Computers
inferred← citeshttps://doi.org/10.1007/bfb0022143openalex-snapshot
Multi-dimensional Interval Routing Schemes
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/s0304-3975(97)00070-4openalex-snapshot
Multidimensional interval routing schemes
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00283-2openalex-snapshot
A survey on interval routing
inferred← citeshttps://doi.org/10.1109/71.250114openalex-snapshot
A new theory of deadlock-free adaptive routing in wormhole networks
inferred← citeshttps://doi.org/10.1109/hicss.1992.183170openalex-snapshot
An optimized reconfigurable architecture for transputer networks
inferred← citeshttps://doi.org/10.1109/ipps.1994.288250openalex-snapshot
Encapsulating networks and routing
inferred← citeshttps://doi.org/10.1109/spdp.1991.218232openalex-snapshot
An algorithm for dynamic reconfiguration of a multicomputer network
inferred← citeshttps://doi.org/10.1109/spdp.1991.218233openalex-snapshot
Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm
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.