On the public citation graph
Fault-Tolerant Routing in Meshes/Tori Using Planarly Constructed Fault Blocks
0 signed · 36 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.1109/12.142686openalex-snapshot
Tolerating faults in hypercubes using subcube partitioning
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/71.219761openalex-snapshot
Deadlock-free adaptive routing in multicomputer networks using virtual channels
inferredcites →https://doi.org/10.1109/71.382317openalex-snapshot
A family of fault-tolerant routing protocols for direct multiprocessor networks
inferredcites →https://doi.org/10.1109/71.485506openalex-snapshot
A framework for designing deadlock-free wormhole routing algorithms
inferredcites →https://doi.org/10.1109/71.506701openalex-snapshot
Fault-tolerant routing in hypercube multicomputers using local safety information
inferredcites →https://doi.org/10.1109/71.841751openalex-snapshot
Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels
inferredcites →https://doi.org/10.1109/icpp.2000.876159openalex-snapshot
A fault-tolerant adaptive and minimal routing approach in n-D meshes
inferredcites →https://doi.org/10.1109/icpp.2002.1040878openalex-snapshot
Fault-tolerant routing in 2D tori or meshes using limited-global-safety information
inferredcites →https://doi.org/10.1109/icpp.2004.1327925openalex-snapshot
An effective fault-tolerant routing methodology for direct networks
inferredcites →https://doi.org/10.1109/icpp.2004.16openalex-snapshot
An effective fault-tolerant routing methodology for direct networks
inferredcites →https://doi.org/10.1109/ipdps.2001.925000openalex-snapshot
Adaptive fault-tolerant wormhole routing in 2D meshes
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.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-981-96-6294-4_14openalex-snapshot
A Stochastic Edge-Fault-Tolerant Routing Algorithm in Torus Networks
inferred← citeshttps://doi.org/10.1016/j.amc.2010.08.055openalex-snapshot
Fault tolerant routing algorithm based on the artificial potential field model in Network-on-Chip
inferred← citeshttps://doi.org/10.1016/j.micpro.2011.06.008openalex-snapshot
Adaptive inter-layer message routing in 3D networks-on-chip
inferred← citeshttps://doi.org/10.1016/j.sysarc.2008.06.002openalex-snapshot
Unicast-based fault-tolerant multicasting in wormhole-routed hypercubes
inferred← citeshttps://doi.org/10.1109/date.2012.6176490openalex-snapshot
AFRA: A low cost high performance reliable routing for 3D mesh NoCs
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/icpp.2007.30openalex-snapshot
Deadlock-Free Adaptive Routing in Meshes Based on Cost-Effective Deadlock Avoidance Schemes
inferred← citeshttps://doi.org/10.1109/ictck.2014.7033493openalex-snapshot
Fault-tolerant circular routing algorithm for 3D-NoC
inferred← citeshttps://doi.org/10.1109/iolts.2010.5560222openalex-snapshot
RILM: Reconfigurable inter-layer routing mechanism for 3D multi-layer networks-on-chip
inferred← citeshttps://doi.org/10.1109/norchp.2009.5397855openalex-snapshot
Message routing in 3D networks-on-chip
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/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.1155/2014/592638openalex-snapshot
Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model
inferred← citeshttps://doi.org/10.1587/transinf.e94.d.809openalex-snapshot
A New Multiple-Round Dimension-Order Routing for Networks-on-Chip
inferred← citeshttps://doi.org/10.46300/9108.2021.15.5openalex-snapshot
Evaluating the Mesh-connected Multiprocessor Running a Parallel Algorithm Representing the Gravitational Interaction Between N Bodies
inferred← citeshttps://doi.org/10.5555/2492708.2492791openalex-snapshot
AFRA: a low cost high performance reliable routing for 3D mesh NoCs
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.