On the public citation graph
A New Fault Information Model for Fault-Tolerant Adaptive and Minimal Routing in 3-D Meshes
0 signed · 40 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-3-540-30566-8_80openalex-snapshot
Fault-Tolerant Wormhole Routing Algorithm in 2D Meshes Without Virtual Channels
inferredcites →https://doi.org/10.1007/bf02946645openalex-snapshot
A simple fault-tolerant adaptive and minimal routing approach in 3-D meshes
inferredcites →https://doi.org/10.1016/0167-739x(95)00027-popenalex-snapshot
Origin-based fault-tolerant routing in the mesh
inferredcites →https://doi.org/10.1093/comjnl/45.3.349openalex-snapshot
A Fault-tolerant Adaptive and Minimal Routing Scheme in $n$-D Meshes
inferredcites →https://doi.org/10.1109/12.142685openalex-snapshot
Some practical issues in the design of fault-tolerant multiprocessors
inferredcites →https://doi.org/10.1109/12.392844openalex-snapshot
Fault-tolerant wormhole routing algorithms for mesh networks
inferredcites →https://doi.org/10.1109/12.506423openalex-snapshot
Adaptive fault-tolerant deadlock-free routing in meshes and hypercubes
inferredcites →https://doi.org/10.1109/12.589238openalex-snapshot
Communication in multicomputers with nonconvex faults
inferredcites →https://doi.org/10.1109/24.799848openalex-snapshot
Maximum-shortest-path (MSP): an optimal routing policy for mesh-connected multicomputers
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.1996.537146openalex-snapshot
Maximum reconfiguration of 2-D mesh systems with faults
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.2004.1302915openalex-snapshot
On constructing the minimum orthogonal convex polygon in 2-D faulty meshes
inferredcites →https://doi.org/10.1109/tc.2003.10000openalex-snapshot
Introducing the New Editor-in-Chief of the IEEE Transactions on Computers
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/tr.2002.807240openalex-snapshot
Maximum-shortest-path (MSP) is not optimal for a general N X N torus
inferredcites →https://doi.org/10.1109/tr.2003.810071openalex-snapshot
Reliable broadcasting in wormhole-routed hypercube-connected networks using local safety information
inferredcites →https://doi.org/10.1147/sj.402.0310openalex-snapshot
Blue Gene: A vision for protein science using a petaflop supercomputer
inferredcites →https://doi.org/10.21236/ada204210openalex-snapshot
The J-Machine: System Support for Actors
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-642-03869-3_96openalex-snapshot
Dependability Analysis of a Fault-Tolerant Network Reconfiguring Strategy
inferred← citeshttps://doi.org/10.1007/s11227-010-0478-zopenalex-snapshot
A hardware supported multicast scheme based on XY routing for 2-D mesh InfiniBand networks
inferred← citeshttps://doi.org/10.1007/s11227-013-0940-9openalex-snapshot
Architecture and design of high-throughput, low-latency, and fault-tolerant routing algorithm for 3D-network-on-chip (3D-NoC)
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.01.002openalex-snapshot
Graceful deadlock-free fault-tolerant routing algorithm for 3D Network-on-Chip architectures
inferred← citeshttps://doi.org/10.1016/j.sysarc.2016.04.011openalex-snapshot
NoC routing protocols – objective-based classification
inferred← citeshttps://doi.org/10.1109/edssc.2011.6117578openalex-snapshot
A deadlock-free fault-tolerant routing algorithm for N-dimesional meshes
inferred← citeshttps://doi.org/10.1109/iccsn.2011.6013681openalex-snapshot
A fault tolerant adaptive routing algorithm in 2D mesh network on chip
inferred← citeshttps://doi.org/10.1109/icfcc.2010.5497839openalex-snapshot
A positive-first and negative-first fault-tolerant routing schemes for concave and convex faults
inferred← citeshttps://doi.org/10.1109/iciecs.2009.5366017openalex-snapshot
A Fault-Tolerant Routing Protocol in 2D Torus Based on Positive-First and Negative-First Turn Models
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/ipdps.2007.370463openalex-snapshot
On Achieving the Shortest-Path Routing in 2-D Meshes
inferred← citeshttps://doi.org/10.1109/mcsoc.2014.36openalex-snapshot
Adaptive Error- and Traffic-Aware Router Architecture for 3D Network-on-Chip Systems
inferred← citeshttps://doi.org/10.1109/pdcat.2012.25openalex-snapshot
A New Fault-Tolerant Routing Scheme for N-dimesional Mesh
inferred← citeshttps://doi.org/10.1109/srds.2013.9openalex-snapshot
A Fault-Tolerant Routing Algorithm Design for On-Chip Optical Networks
inferred← citeshttps://doi.org/10.1109/tc.2006.46openalex-snapshot
A routing methodology for achieving fault tolerance in direct networks
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.3390/s91210117openalex-snapshot
Multi-Hop Routing Mechanism for Reliable Sensor Computing
showing the first 18 of 19 · page through all 19
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.