On the public citation graph
Efficient broadcasting in wormhole-routed multicomputers: a network-partitioning approach
0 signed · 109 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.1006/jpdc.1996.0074openalex-snapshot
Broadcasting on Meshes with Wormhole Routing
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/0167-8191(92)90004-qopenalex-snapshot
Broadcasting in wraparound meshes with parallel monodirectional links
inferredcites →https://doi.org/10.1016/0167-8191(94)90026-4openalex-snapshot
Efficient parallel communication with the nCUBE 2S processor
inferredcites →https://doi.org/10.1016/0743-7315(87)90002-5openalex-snapshot
Communication efficient basic linear algebra computations on hypercube architectures
inferredcites →https://doi.org/10.1016/0743-7315(92)90031-hopenalex-snapshot
Efficient implementation of barrier synchronization in wormhole-routed hypercube multicomputers
inferredcites →https://doi.org/10.1109/12.29465openalex-snapshot
Optimum broadcasting and personalized communication in hypercubes
inferredcites →https://doi.org/10.1109/12.589231openalex-snapshot
Toward optimal broadcast in a star graph using multiple spanning trees
inferredcites →https://doi.org/10.1109/2.191995openalex-snapshot
A survey of wormhole routing techniques in direct networks
inferredcites →https://doi.org/10.1109/2.476198openalex-snapshot
Collective communication in wormhole-routed massively parallel computers
inferredcites →https://doi.org/10.1109/71.334899openalex-snapshot
Unicast-based multicast communication in wormhole-routed networks
inferredcites →https://doi.org/10.1109/71.342126openalex-snapshot
CCL: a portable and tunable collective communication library for scalable parallel computers
inferredcites →https://doi.org/10.1109/71.342134openalex-snapshot
Optimal broadcast in all-port wormhole-routed hypercubes
inferredcites →https://doi.org/10.1109/71.473513openalex-snapshot
Optimal multicast communication in wormhole-routed torus networks
inferredcites →https://doi.org/10.1109/71.485503openalex-snapshot
A trip-based multicasting model in wormhole-routed networks with virtual channels
inferredcites →https://doi.org/10.1109/71.491579openalex-snapshot
On the design and implementation of broadcast and global combine operations using the postal model
inferredcites →https://doi.org/10.1109/71.503775openalex-snapshot
All-to-all personalized communication in a wormhole-routed torus
inferredcites →https://doi.org/10.1109/71.532118openalex-snapshot
A broadcast algorithm for all-port wormhole-routed torus networks
inferredcites →https://doi.org/10.1109/71.588613openalex-snapshot
Bandwidth-optimal complete exchange on wormhole-routed 2D/3D torus networks: a diagonal-propagation approach
inferredcites →https://doi.org/10.1109/cmpcon.1993.289660openalex-snapshot
Cray T3D: a new dimension for Cray Research
inferredcites →https://doi.org/10.1109/fmpc.1992.234880openalex-snapshot
An overview of the nCUBE 3 supercomputer
inferredcites →https://doi.org/10.1109/icapp.1996.562892openalex-snapshot
An efficient unicast-based multicast algorithm in two-port wormhole-routed 2D mesh networks
inferredcites →https://doi.org/10.1109/ipps.1994.288208openalex-snapshot
CCL: a portable and tunable collective communication library for scalable parallel computers
inferredcites →https://doi.org/10.1109/shpcc.1994.296644openalex-snapshot
An extended dominating node approach to collective communication in all-port wormhole-routed 2D meshes
inferredcites →https://doi.org/10.1109/shpcc.1994.296665openalex-snapshot
Interprocessor collective communication library (InterCom)
inferredcites →https://doi.org/10.1109/spdp.1996.570331openalex-snapshot
Efficient single-node broadcast in wormhole-routed multicomputers: a network-partitioning approach
inferredcites →https://doi.org/10.1145/181181.181323openalex-snapshot
A dominating set model for broadcast in all-port wormhole-routed 2D mesh networks
inferredcites →https://doi.org/10.1145/224538.224554openalex-snapshot
A near-optimal broadcasting algorithm in all-port wormhole-routed hypercubes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.760openalex-snapshot
One‐to‐all broadcasting scheme for arbitrary static interconnection networks with bursty background traffic
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1748openalex-snapshot
A Generic Design Methodology for Deadlock-Free Routing in Multicomputer Networks
inferred← citeshttps://doi.org/10.1007/11847366_34openalex-snapshot
On High Performance Multicast Algorithms for Interconnection Networks
inferred← citeshttps://doi.org/10.1007/3-540-39999-2_26openalex-snapshot
Multi-node Broadcasting in All-Ported 3-D Wormhole-Routed Torus Using Aggregation-then-Distribution Strategy
inferred← citeshttps://doi.org/10.1007/978-3-030-05057-3_27openalex-snapshot
Towards the Independent Spanning Trees in the Line Graphs of Interconnection Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-74742-0_77openalex-snapshot
Design and Analysis of Multicast Communication in Multidimensional Mesh Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-40820-5_20openalex-snapshot
Circular Dimensional-Permutations and Reliable Broadcasting for Hypercubes and Möbius Cubes
inferred← citeshttps://doi.org/10.1007/s00373-022-02585-wopenalex-snapshot
Degree Conditions for Completely Independent Spanning Trees of Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s10766-005-6468-8openalex-snapshot
Efficient Broadcast in Heterogeneous Networks of Workstations Using Two Sub-Networks
inferred← citeshttps://doi.org/10.1007/s10766-011-0169-2openalex-snapshot
Efficient and Scalable Routing Algorithms for Collective Communication Operations on 2D All-Port Torus Networks
inferred← citeshttps://doi.org/10.1007/s11227-013-0883-1openalex-snapshot
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
inferred← citeshttps://doi.org/10.1007/s11227-016-1768-xopenalex-snapshot
Edge-disjoint node-independent spanning trees in dense Gaussian networks
inferred← citeshttps://doi.org/10.1016/j.amc.2006.07.153openalex-snapshot
A generalized broadcasting schema for the mesh structures
inferred← citeshttps://doi.org/10.1016/j.dam.2016.11.019openalex-snapshot
Constructing completely independent spanning trees in crossed cubes
inferred← citeshttps://doi.org/10.1016/j.dam.2019.09.021openalex-snapshot
An improved algorithm to construct edge-independent spanning trees in augmented cubes
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.048openalex-snapshot
The completely independent spanning trees in P 4 -free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.05.028openalex-snapshot
Completely independent spanning trees in split graphs: Structural properties and complexity
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115455openalex-snapshot
Completely independent spanning trees and spectral radii of graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2003.06.014openalex-snapshot
Towards scalable collective communication for multicomputer interconnection networks
inferred← citeshttps://doi.org/10.1016/j.ins.2013.01.010openalex-snapshot
Independent spanning trees in crossed cubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.01.009openalex-snapshot
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.08.006openalex-snapshot
Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme
inferred← citeshttps://doi.org/10.1016/j.sysarc.2004.01.001openalex-snapshot
Multi-node broadcasting in all-ported 3-D wormhole-routed torus using an aggregation-then-distribution strategy
inferred← citeshttps://doi.org/10.1016/j.sysarc.2005.01.003openalex-snapshot
A plane-based broadcast algorithm for multicomputer networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.061openalex-snapshot
Constructing independent spanning trees for locally twisted cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.08.020openalex-snapshot
An algorithm to construct independent spanning trees on parity cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.016openalex-snapshot
Edge-independent spanning trees in augmented cubes
inferred← citeshttps://doi.org/10.1016/s0141-9331(02)00094-7openalex-snapshot
A new scalable broadcast algorithm for multiport meshes with minimum communication steps
inferred← citeshttps://doi.org/10.1049/ip-cdt:20000887openalex-snapshot
Multinode broadcasting in a wormhole-routed 2-D torus using an aggregation-then-distribution strategy
inferred← citeshttps://doi.org/10.1093/comjnl/bxw054openalex-snapshot
Independent Spanning Trees in RTCC-Pyramids
inferred← citeshttps://doi.org/10.1109/12.805156openalex-snapshot
Toward optimal complete exchange on wormhole-routed tori
inferred← citeshttps://doi.org/10.1109/csae.2011.5952464openalex-snapshot
Construction of independent spanning trees on twisted-cubes
inferred← citeshttps://doi.org/10.1109/cscloud.2015.13openalex-snapshot
A Reliable Broadcasting Algorithm in Locally Twisted Cubes
inferred← citeshttps://doi.org/10.1109/empdp.2003.1183578openalex-snapshot
CODACS project: level-node communication policies
inferred← citeshttps://doi.org/10.1109/empdp.2003.1183581openalex-snapshot
A scalable plane-based broadcast algorithm for 3D-Mesh networks
inferred← citeshttps://doi.org/10.1109/hpc.2000.846525openalex-snapshot
A quick broadcasting algorithm in wormhole-routed multicomputers
inferred← citeshttps://doi.org/10.1109/hpcsa.2002.1019140openalex-snapshot
On the design of scalable pipelined broadcasting for mesh networks
inferred← citeshttps://doi.org/10.1109/i-span.2009.97openalex-snapshot
Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes
inferred← citeshttps://doi.org/10.1109/icc.2007.288openalex-snapshot
A Fast Broadcast Tree Construction in Multi-Rate Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/icisce.2015.21openalex-snapshot
A Parallel Algorithm to Construct BISTs on Parity Cubes
inferred← citeshttps://doi.org/10.1109/icise.2010.5691221openalex-snapshot
An algorithm to construct independent spanning trees on crossed cubes
inferred← citeshttps://doi.org/10.1109/icpads.2001.934805openalex-snapshot
An efficient adaptive broadcast algorithm for the mesh network
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183400openalex-snapshot
A scalable broadcast algorithm for multiport meshes with minimum communication steps
inferred← citeshttps://doi.org/10.1109/icpads.2011.35openalex-snapshot
Broadcasting on Large Scale Heterogeneous Platforms with Connectivity Artifacts under the Bounded Multi-port Model
inferred← citeshttps://doi.org/10.1109/icppw.1999.800040openalex-snapshot
Multi-node broadcasting in a wormhole-routed 2-D torus using an aggregation-then-distribution strategy
inferred← citeshttps://doi.org/10.1109/icppw.2005.63openalex-snapshot
On the Performance of Broadcast Algorithms in Interconnection Networks
inferred← citeshttps://doi.org/10.1109/ipccc.2001.918648openalex-snapshot
Coded path routing: a new approach to broadcasting in 3-D meshes, Technical Report
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846042openalex-snapshot
Balancing traffic load for multi-node multicast in a wormhole 2D torus/mesh
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1015516openalex-snapshot
A recursion-based broadcast paradigm in wormhole routed mesh/torus networks
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016686openalex-snapshot
One-to-all broadcasting scheme for static interconnection networks with arbitrary topology
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213396openalex-snapshot
A probabilistic approach to fault tolerant broadcast routing algorithms on mesh networks
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213509openalex-snapshot
An efficient path-based multicast algorithm for mesh networks
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302926openalex-snapshot
Pipelining broadcasts on heterogeneous platforms
inferred← citeshttps://doi.org/10.1109/ipdps.2005.131openalex-snapshot
Broadcast Trees for Heterogeneous Platforms
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536490openalex-snapshot
The impact of routing schemes on group communication throughput in scalable networks
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470447openalex-snapshot
Broadcasting on large scale heterogeneous platforms under the bounded multi-port model
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470450openalex-snapshot
On the importance of bandwidth control mechanisms for scheduling on large scale heterogeneous platforms
inferred← citeshttps://doi.org/10.1109/ispa.2008.110openalex-snapshot
Performance Evaluation of Broadcast Algorithms in All-Port 2D Mesh Networks
inferred← citeshttps://doi.org/10.1109/ispdc.2007.39openalex-snapshot
On The Design of High Throughput Adaptive Multicast Communication
inferred← citeshttps://doi.org/10.1109/parelec.2006.7openalex-snapshot
A Performance Study of Path Based Multicast Communication Algorithms
inferred← citeshttps://doi.org/10.1109/pdgc.2014.7030740openalex-snapshot
Fault tolerance for hypercube networks via independent spanning trees
inferred← citeshttps://doi.org/10.1109/tcns.2017.2746344openalex-snapshot
Distributed Calculation of Edge-Disjoint Spanning Trees for Robustifying Distributed Algorithms Against Man-in-the-Middle Attacks
inferred← citeshttps://doi.org/10.1109/tpds.2005.129openalex-snapshot
A recursion-based broadcast paradigm in wormhole routed networks
inferred← citeshttps://doi.org/10.1109/tpds.2005.48openalex-snapshot
Pipelining broadcasts on heterogeneous platforms
inferred← citeshttps://doi.org/10.1109/tpds.2013.245openalex-snapshot
Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model
inferred← citeshttps://doi.org/10.1109/tpds.2014.2307871openalex-snapshot
Dimensional-Permutation-Based Independent Spanning Trees in Bijective Connection Networks
inferred← citeshttps://doi.org/10.1109/tpds.2015.2503746openalex-snapshot
Deadlock-Free Broadcast Routing in Dragonfly Networks without Virtual Channels
inferred← citeshttps://doi.org/10.1109/tpds.2019.2931904openalex-snapshot
The Existence of Completely Independent Spanning Trees for Some Compound Graphs
inferred← citeshttps://doi.org/10.1109/tpds.2020.3029654openalex-snapshot
Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube
inferred← citeshttps://doi.org/10.1142/s0219265910002799openalex-snapshot
A NEW FAULT-TOLERANT BROADCAST ROUTING ALGORITHM ON MESH NETWORKS
inferred← citeshttps://doi.org/10.1145/508791.508955openalex-snapshot
Towards a scalable broadcast in wormhole-switched mesh networks
inferred← citeshttps://doi.org/10.1177/0037549704044325openalex-snapshot
A Simulation Study of Scalable Broadcast in High-Performance Regular Networks
inferred← citeshttps://doi.org/10.1177/1094342006061877openalex-snapshot
Complexity Results for Collective Communications on Heterogeneous Platforms
inferred← citeshttps://doi.org/10.1504/ijhpcn.2006.010637openalex-snapshot
Performance of deterministic and adaptive broadcast algorithms in multicomputer networks
inferred← citeshttps://doi.org/10.2991/icacsei.2013.20openalex-snapshot
Towards the Independent Spanning Trees in Conditional BC Networks
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.263-266.3301openalex-snapshot
Independent Spanning Trees on Special BC Networks
inferred← citeshttps://doi.org/10.70675/559e5400zb17fz474czbb01z753160a85626openalex-snapshot
Étude des problèmes d’ordonnancement sur des plates-formes hétérogènes en modèle multi-port
inferred← citeshttps://doi.org/10.70675/ac2de31cz3ab1z4dcbzaf83z5b155a057a8dopenalex-snapshot
Large scale platform : Instantiable models and algorithmic design of communication schemes
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.