On the public citation graph

Analytic performance comparison of hypercubes and star graphs with implementation constraints

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.
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.1006/jpdc.1993.1098openalex-snapshot
Embedding Meshes on the Star Graph
inferredcites →https://doi.org/10.1006/jpdc.1994.1082openalex-snapshot
Routing Function and Deadlock Avoidance in a Star Graph Interconnection Network
inferredcites →https://doi.org/10.1006/jpdc.1994.1132openalex-snapshot
A Comprehensive Analytical Model for Wormhole Routing in Multicomputer Systems
inferredcites →https://doi.org/10.1006/jpdc.2001.1812openalex-snapshot
A Parallel Algorithm for Lagrange Interpolation on the Star Graph
inferredcites →https://doi.org/10.1016/0743-7315(91)90128-vopenalex-snapshot
Performance of multicomputer networks under pin-out constraints
inferredcites →https://doi.org/10.1016/j.future.2007.06.010openalex-snapshot
An accurate mathematical performance model of adaptive routing in the star graph
inferredcites →https://doi.org/10.1016/s0166-5316(00)00049-3openalex-snapshot
An accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.293259openalex-snapshot
Hypercube communication delay with wormhole routing
inferredcites →https://doi.org/10.1109/12.30851openalex-snapshot
Performance of the direct binary n-cube network for multiprocessors
inferredcites →https://doi.org/10.1109/12.53599openalex-snapshot
Performance analysis of k-ary n-cube interconnection networks
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/71.262586openalex-snapshot
A comparative study of topological properties of hypercubes and star graphs
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.605767openalex-snapshot
Matrix decomposition on the star graph
inferredcites →https://doi.org/10.1109/71.97897openalex-snapshot
Limits on interconnection network performance
inferredcites →https://doi.org/10.1109/hpcasia.2005.73openalex-snapshot
Performance comparison of adaptive routing algorithms in the star interconnection network
inferredcites →https://doi.org/10.1109/icpp.1994.18openalex-snapshot
A Comparative Study of Star Graphs and Rotator Graphs
inferredcites →https://doi.org/10.1109/icpp.1998.708469openalex-snapshot
An analytical model of Duato's fully-adaptive routing algorithm in k-ary n-cubes
inferredcites →https://doi.org/10.1109/ipdps.2006.1639303openalex-snapshot
Analytical performance modelling of adaptive wormhole routing in the star interconnection network
inferredcites →https://doi.org/10.1109/ipps.1997.580926openalex-snapshot
An accurate model for the performance analysis of deterministic wormhole routing
inferredcites →https://doi.org/10.1109/isca.1993.698575openalex-snapshot
A Comparison Of Adaptive Wormhole Routing Algorithms
inferredcites →https://doi.org/10.1109/mascot.2004.1348309openalex-snapshot
Performance modeling of fully adaptive wormhole routing in 2-D mesh-connected multiprocessors
inferredcites →https://doi.org/10.1145/165123.165177openalex-snapshot
A comparison of adaptive wormhole routing algorithms
inferredcites →https://doi.org/10.5555/1898953.1898998openalex-snapshot
Analytical performance modelling of adaptive wormhole routing in the star interconnection network

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-319-05401-8_18openalex-snapshot
Efficient Routing in Data Center with Underlying Cayley Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-91192-2_43openalex-snapshot
Chemical Reaction Optimization for Traveling Salesman Problem Over a Hypercube Interconnection Network
inferred← citeshttps://doi.org/10.1007/978-3-642-03547-0_9openalex-snapshot
Throughput Considerations of Fault-Tolerant Routing in Network-on-Chip
inferred← citeshttps://doi.org/10.1080/17445760.2022.2060977openalex-snapshot
A general approach to deriving diagnosability results of interconnection networks*
inferred← citeshttps://doi.org/10.1109/ams.2009.86openalex-snapshot
A Performance-Enhancing Fault-Tolerant Routing Algorithm for Network-on-Chip in Uniform Traffic
inferred← citeshttps://doi.org/10.1109/ems.2011.54openalex-snapshot
An Innovative Fault-Tolerant Method for 2-D Mesh-Based Network-on-Chip Routing
inferred← citeshttps://doi.org/10.1109/iadcc.2009.4809021openalex-snapshot
If-cube3: An Improved Fault-Tolerant Routing Algorithm to achieve less latency in NoCs
inferred← citeshttps://doi.org/10.1109/icdcsw.2014.29openalex-snapshot
Cayley-Graph-Based Data Centers and Space Requirements of a Routing Scheme Using Automata
inferred← citeshttps://doi.org/10.1109/icess.2009.89openalex-snapshot
An Enhanced Fault-Tolerant Routing Algorithm for Mesh Network-on-Chip
inferred← citeshttps://doi.org/10.31772/2712-8970-2023-24-4-673-680openalex-snapshot
An algorithm for fast multiplication of elements in 2-groups based on the Zhegalkin polynomials
inferred← citeshttps://doi.org/10.5539/mas.v12n8p142openalex-snapshot
Travelling Salesman Problem Solution Based-on Grey Wolf Algorithm over Hypercube Interconnection 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.