On the public citation graph

Optimal broadcast in all-port wormhole-routed hypercubes

0 signed · 67 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.1002/cpe.4330040603openalex-snapshot
Efficient communication primitives on hypercubes
inferredcites →https://doi.org/10.1002/net.3230180406openalex-snapshot
A survey of gossiping and broadcasting in communication networks
inferredcites →https://doi.org/10.1006/jpdc.1997.1353openalex-snapshot
Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures
inferredcites →https://doi.org/10.1016/0166-218x(94)90180-5openalex-snapshot
Methods and problems of communication in usual networks
inferredcites →https://doi.org/10.1016/0743-7315(87)90038-4openalex-snapshot
Gaussian elimination on a hypercube automaton
inferredcites →https://doi.org/10.1016/0743-7315(91)90094-popenalex-snapshot
Optimal broadcasting on SIMD hypercubes without indirect addressing capability
inferredcites →https://doi.org/10.1109/12.29465openalex-snapshot
Optimum broadcasting and personalized communication in hypercubes
inferredcites →https://doi.org/10.1109/2.191995openalex-snapshot
A survey of wormhole routing techniques in direct networks
inferredcites →https://doi.org/10.1109/71.491578openalex-snapshot
Circuit-switched broadcasting in torus networks
inferredcites →https://doi.org/10.1109/icpp.1993.71openalex-snapshot
Efficient Broadcast in All-Port Wormhole-Routed Hypercubes
inferredcites →https://doi.org/10.1109/tc.1984.1676393openalex-snapshot
On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms
inferredcites →https://doi.org/10.1142/s0129626495000199openalex-snapshot
EFFICIENT BROADCAST ON HYPERCUBES WITH WORMHOLE AND E-CUBE ROUTINGS
inferredcites →https://doi.org/10.1145/169627.169837openalex-snapshot
Efficient collective data distribution in all-port wormhole-routed hypercubes
inferredcites →https://doi.org/10.1145/633615.810659openalex-snapshot
A large scale, homogeneous, fully distributed parallel machine, I

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0470841915.ch2openalex-snapshot
Interconnection Networks
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_172openalex-snapshot
Circuit-Switched Broadcasting in Multi-port Multi-dimensional Torus Networks⋆
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_160openalex-snapshot
Efficient collective communication in optical networks
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_48openalex-snapshot
Circuit-switched gossiping in 3-dimensional torus networks
inferred← citeshttps://doi.org/10.1007/978-3-031-29927-8_31openalex-snapshot
A High-Radix Circulant Network Topology for Efficient Collective Communication
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_5openalex-snapshot
Cayley graphs and interconnection networks
inferred← citeshttps://doi.org/10.1016/b978-155860852-8/50015-8openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.ins.2006.02.007openalex-snapshot
Task migration in all-port wormhole-routed 2D mesh multicomputers
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.05.004openalex-snapshot
Improved one-to-all broadcasting algorithms on faulty SIMD hypercubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.05.003openalex-snapshot
Broadcasting in all-output-port cube-connected cycles with distance-insensitive switching
inferred← citeshttps://doi.org/10.1016/s0020-0255(97)10030-5openalex-snapshot
Efficient submesh permutations in wormhole-routed meshes
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00057-xopenalex-snapshot
Wormhole broadcast in star graph networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00018-8openalex-snapshot
Efficient collective communication in optical networks
inferred← citeshttps://doi.org/10.1023/a:1008155920176openalex-snapshot
Wormhole Broadcast in Hypercubes
inferred← citeshttps://doi.org/10.1023/a:1011454709330openalex-snapshot
A Heuristic-Based Wormhole Routing Algorithm for Hypercube Multicomputer Networks
inferred← citeshttps://doi.org/10.1023/a:1011650615731openalex-snapshot
Circuit-Switched Broadcasting in Multi-Port Multi-Dimensional Torus Networks
inferred← citeshttps://doi.org/10.1109/12.609282openalex-snapshot
A dilated-diagonal-based scheme for broadcast in a wormhole-routed 2D torus
inferred← citeshttps://doi.org/10.1109/12.841128openalex-snapshot
Algebraic foundations and broadcasting algorithms for wormhole-routed all-port tori
inferred← citeshttps://doi.org/10.1109/2.476198openalex-snapshot
Collective communication in wormhole-routed massively parallel computers
inferred← citeshttps://doi.org/10.1109/71.532118openalex-snapshot
A broadcast algorithm for all-port wormhole-routed torus networks
inferred← citeshttps://doi.org/10.1109/71.569654openalex-snapshot
An extended dominating node approach to broadcast and global combine in multiport wormhole-routed mesh networks
inferred← citeshttps://doi.org/10.1109/71.689442openalex-snapshot
All-to-all broadcast and matrix multiplication in faulty SIMD hypercubes
inferred← citeshttps://doi.org/10.1109/71.706050openalex-snapshot
Optimized broadcasting and multicasting protocols in cut-through routed networks
inferred← citeshttps://doi.org/10.1109/71.744837openalex-snapshot
Efficient broadcasting in wormhole-routed multicomputers: a network-partitioning approach
inferred← citeshttps://doi.org/10.1109/71.824646openalex-snapshot
Efficient heuristics for all-port multicast in wormhole-routed hypercubes
inferred← citeshttps://doi.org/10.1109/71.841741openalex-snapshot
Near-optimal broadcast in all-port wormhole-routed hypercubes using error-correcting codes
inferred← citeshttps://doi.org/10.1109/71.841743openalex-snapshot
Recursive cube of rings: a new topology for interconnection networks
inferred← citeshttps://doi.org/10.1109/hicss.1998.656273openalex-snapshot
Near-optimal broadcast in all-port wormhole-routed 3D tori with dimension-ordered routing
inferred← citeshttps://doi.org/10.1109/icccn.1998.739900openalex-snapshot
Performance analysis and simulation of the SOME-Bus architecture using message passing
inferred← citeshttps://doi.org/10.1109/icetet.2008.114openalex-snapshot
Design of a Scalable, Fault Tolerant, Heterogeneous and Secured Distributed Storage Framework
inferred← citeshttps://doi.org/10.1109/icpads.1997.652537openalex-snapshot
Optimal broadcast in α-port wormhole-routed mesh networks
inferred← citeshttps://doi.org/10.1109/icpads.1998.741093openalex-snapshot
Broadcasting on wormhole-routed 2D tori with arbitrary size
inferred← citeshttps://doi.org/10.1109/icpp.1997.622562openalex-snapshot
Efficient multicast algorithms in all-port wormhole-routed hypercubes
inferred← citeshttps://doi.org/10.1109/icpp.1998.708528openalex-snapshot
Algebraic foundations and broadcasting algorithms for wormhole-routed all-port tori
inferred← citeshttps://doi.org/10.1109/icpp.2003.1240619openalex-snapshot
A priority-based balanced routing scheme for random broadcasting and routing in tori
inferred← citeshttps://doi.org/10.1109/ipdps.2000.845960openalex-snapshot
Broadcasting in hypercubes in the circuit switched model
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925200openalex-snapshot
Improved one-to-all broadcasting algorithms on faulty SIMD hypercubes
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213389openalex-snapshot
Performance analysis of a fault-tolerant distributed-shared memory protocol on the SOME-bus multiprocessor architecture
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302923openalex-snapshot
Random broadcasting in product networks and symmetric networks
inferred← citeshttps://doi.org/10.1109/ipps.1996.508115openalex-snapshot
On some global operations in faulty SIMD hypercubes
inferred← citeshttps://doi.org/10.1109/ispa.2010.100openalex-snapshot
Prioritized Dominating-Set Broadcasting for Optimal Random Broadcasting
inferred← citeshttps://doi.org/10.1109/ispan.1996.508988openalex-snapshot
Optimizing communication for array operations on message-passing multicomputers
inferred← citeshttps://doi.org/10.1109/ispan.2004.1300469openalex-snapshot
Task migration in all-port wormhole-routed 2D mesh multicomputers
inferred← citeshttps://doi.org/10.1109/pccc.1997.581550openalex-snapshot
One-to-all wormhole broadcasting in star graph networks using single port communication
inferred← citeshttps://doi.org/10.1109/pccc.1998.659881openalex-snapshot
Near optimal broadcast in all-port wormhole routed hypercubes using error correcting codes
inferred← citeshttps://doi.org/10.1109/spdp.1994.346109openalex-snapshot
Efficient submesh permutations in wormhole-routed meshes
inferred← citeshttps://doi.org/10.1109/tpds.2004.83openalex-snapshot
Fault-tolerant distributed shared memory on a broadcast-based architecture
inferred← citeshttps://doi.org/10.1109/tpds.2005.129openalex-snapshot
A recursion-based broadcast paradigm in wormhole routed networks
inferred← citeshttps://doi.org/10.1145/277651.277682openalex-snapshot
Broadcasting, multicasting and gossiping in trees under the all-port line model
inferred← citeshttps://doi.org/10.1145/277830.277926openalex-snapshot
Depth contention-free broadcasting on torus networks
inferred← citeshttps://doi.org/10.15760/etd.6951openalex-snapshot
Contention-free Scheduling of Communication Induced by Array Operations on 2D Meshes
inferred← citeshttps://doi.org/10.17918/etd-48openalex-snapshot
Fault-tolerant distributed shared memory on a broadcast-based interconnection architecture
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.