On the public citation graph

Deadlock-Free Adaptive Routing in Meshes Based on Cost-Effective Deadlock Avoidance Schemes

0 signed · 30 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.1109/12.392844openalex-snapshot
Fault-tolerant wormhole routing algorithms for mesh networks
inferredcites →https://doi.org/10.1109/12.506422openalex-snapshot
Distributed, deadlock-free routing in faulty, pipelined, direct interconnection networks
inferredcites →https://doi.org/10.1109/12.67315openalex-snapshot
An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
inferredcites →https://doi.org/10.1109/40.988687openalex-snapshot
The Alpha 21364 network architecture
inferredcites →https://doi.org/10.1109/71.250114openalex-snapshot
A new theory of deadlock-free adaptive routing in wormhole networks
inferredcites →https://doi.org/10.1109/icpp.2005.40openalex-snapshot
Fault-Tolerant Routing in Meshes/Tori Using Planarly Constructed Fault Blocks
inferredcites →https://doi.org/10.1109/icpp.2005.9openalex-snapshot
A New Fault Information Model for Fault-Tolerant Adaptive and Minimal Routing in 3-D Meshes
inferredcites →https://doi.org/10.1109/ipdps.2006.1639341openalex-snapshot
Segment-based routing: an efficient fault-tolerant routing algorithm for meshes and tori
inferredcites →https://doi.org/10.1109/mascot.2000.876581openalex-snapshot
A cost-effective load balanced adaptive routing scheme for mesh-connected 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/tc.2003.1183946openalex-snapshot
A rectilinear-monotone polygonal fault block model for fault-tolerant minimal routing in mesh
inferredcites →https://doi.org/10.1109/tc.2006.46openalex-snapshot
A routing methodology for achieving fault tolerance in direct networks
inferredcites →https://doi.org/10.1145/1028176.1006718openalex-snapshot
Immunet
inferredcites →https://doi.org/10.1145/200836.200856openalex-snapshot
Planar-adaptive routing
inferredcites →https://doi.org/10.1147/sj.402.0310openalex-snapshot
Blue Gene: A vision for protein science using a petaflop supercomputer

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-65407-8_14openalex-snapshot
An Overview of Multicast Routing Algorithms in Network on Chip
inferred← citeshttps://doi.org/10.1007/978-3-540-69501-1_8openalex-snapshot
Deadlock-Free Adaptive Routing in 2D Tori with a New Turn Model
inferred← citeshttps://doi.org/10.1007/s42514-019-00009-5openalex-snapshot
Low-power and high-performance adaptive routing in on-chip networks
inferred← citeshttps://doi.org/10.1049/iet-com.2019.0269openalex-snapshot
Deadlock‐free adaptive 3D network‐on‐chips routing algorithm with repetitive turn concept
inferred← citeshttps://doi.org/10.1109/cit.2010.442openalex-snapshot
A Novel Routing Algorithm for Achieving Static Fault-Tolerance in 2-D Meshes
inferred← citeshttps://doi.org/10.1109/compsac.2018.00103openalex-snapshot
The Column-Partition and Row-Partition Turn Model
inferred← citeshttps://doi.org/10.1109/i-span.2012.21openalex-snapshot
Fault-tolerant Routing for Irregular Faulty Patterns in 2D-Mesh Without Virtual Channel
inferred← citeshttps://doi.org/10.1109/icdcs.2008.106openalex-snapshot
Deadlock-Free Fully Adaptive Routing in 2-Dimensional Tori Based on New Virtual Network Partitioning Scheme
inferred← citeshttps://doi.org/10.1109/prdc.2009.50openalex-snapshot
A New Multiple-Round DOR Routing for 2D Network-on-Chip Meshes
inferred← citeshttps://doi.org/10.1109/tc.2008.211openalex-snapshot
Practical Deadlock-Free Fault-Tolerant Routing in Meshes Based on the Planar Network Fault Model
inferred← citeshttps://doi.org/10.1109/tcc.2015.2440242openalex-snapshot
CSR: Classified Source Routing in Distributed Networks
inferred← citeshttps://doi.org/10.1109/tdsc.2009.3openalex-snapshot
Deadlock-Free Adaptive Routing in Meshes with Fault-Tolerance Ability Based on Channel Overlapping
inferred← citeshttps://doi.org/10.1109/tdsc.2017.2693372openalex-snapshot
Fault-Tolerant Adaptive Routing in Dragonfly Networks
inferred← citeshttps://doi.org/10.1587/transfun.e99.a.1334openalex-snapshot
An Efficient Highly Adaptive and Deadlock-Free Routing Algorithm for 3D Network-on-Chip
inferred← citeshttps://doi.org/10.47839/ijc.10.3.752openalex-snapshot
AN IMPROVED SELECTION TECHNIQUE FOR FAST PACKET ROUTING IN COMPUTER NETWORK
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.