On the public citation graph

Fat-Trees Routing and Node Ordering Providing Contention Free Traffic for MPI Global Collectives

https://doi.org/10.1109/ipdps.2011.219
0 signed · 37 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.1007/3-540-58429-3_36openalex-snapshot
Congestion-Free routing on the CM-5 data router
inferredcites →https://doi.org/10.1007/s10586-007-0012-0openalex-snapshot
Performance analysis of MPI collective operations
inferredcites →https://doi.org/10.1109/clustr.2006.311846openalex-snapshot
The Influence of Operating Systems on the Performance of Collective Operations at Extreme Scale
inferredcites →https://doi.org/10.1109/clustr.2008.4663762openalex-snapshot
Multistage switches are not crossbars: Effects of static routing in high-performance networks
inferredcites →https://doi.org/10.1109/conect.2003.1231478openalex-snapshot
Scalable collective communication on the ASCI Q machine
inferredcites →https://doi.org/10.1109/icpads.2004.77openalex-snapshot
Scaling all-to-all multicast on fat-tree networks
inferredcites →https://doi.org/10.1109/ipdps.2004.1302913openalex-snapshot
A multiple LID routing scheme for fat-tree-based infiniband networks
inferredcites →https://doi.org/10.1109/ipdps.2005.335openalex-snapshot
Performance Analysis of MPI Collective Operations
inferredcites →https://doi.org/10.1109/ipdps.2007.370482openalex-snapshot
Deterministic versus Adaptive Routing in Fat-Trees
inferredcites →https://doi.org/10.1109/ipps.1995.395911openalex-snapshot
On generalized fat trees
inferredcites →https://doi.org/10.1109/ipps.1997.580853openalex-snapshot
k-ary n-trees: high performance networks for massively parallel architectures
inferredcites →https://doi.org/10.1109/tc.1985.6312192openalex-snapshot
Fat-trees: Universal networks for hardware-efficient supercomputing
inferredcites →https://doi.org/10.1145/233977.234000openalex-snapshot
A message passing standard for MPP and workstations
inferredcites →https://doi.org/10.1145/582034.582071openalex-snapshot
Predictive performance and scalability modeling of a large-scale application
inferredcites →https://doi.org/10.1177/0037549709340840openalex-snapshot
A Framework for End-to-End Simulation of High-performance Computing Systems
inferredcites →https://doi.org/10.1177/1094342005051521openalex-snapshot
Optimization of Collective Communication Operations in MPICH
inferredcites →https://doi.org/10.4108/icst.simutools2008.3034openalex-snapshot
A Framework for End-to-end Simulation of Highperformance Computing Systems

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-030-95388-1_9openalex-snapshot
The Case for Disjoint Job Mapping on High-Radix Networked Parallel Computers
inferred← citeshttps://doi.org/10.1007/s11227-022-04926-1openalex-snapshot
Congestion management in high-performance interconnection networks using adaptive routing notifications
inferred← citeshttps://doi.org/10.1007/s11227-025-07069-1openalex-snapshot
Quality-of-service provision for BXIv3-based interconnection networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.07.009openalex-snapshot
Towards an efficient combination of adaptive routing and queuing schemes in Fat-Tree topologies
inferred← citeshttps://doi.org/10.1109/ccgrid.2019.00036openalex-snapshot
Efficient Congestion Management for High-Speed Interconnects using Adaptive Routing
inferred← citeshttps://doi.org/10.1109/hoti.2017.16openalex-snapshot
On the Impact of Routing Algorithms in the Effectiveness of Queuing Schemes in High-Performance Interconnection Networks
inferred← citeshttps://doi.org/10.1109/hpcs.2018.00078openalex-snapshot
TopGen: A Library to Provide Simulation Tools with the Modeling of Interconnection Network Topologies
inferred← citeshttps://doi.org/10.1109/icpads.2015.92openalex-snapshot
Hardware-Centric Analysis of Network Performance for MPI Applications
inferred← citeshttps://doi.org/10.1109/ipdps.2013.87openalex-snapshot
Generalized Hierarchical All-to-All Exchange Patterns
inferred← citeshttps://doi.org/10.1109/iscit.2015.7458357openalex-snapshot
MPI_Reduce algorithm for OpenFlow-enabled network
inferred← citeshttps://doi.org/10.1109/jsac.2014.140109openalex-snapshot
Distributed Adaptive Routing Convergence to Non-Blocking DCN Routing Assignments
inferred← citeshttps://doi.org/10.1109/pdp.2014.22openalex-snapshot
Multi-homed Fat-Tree Routing with InfiniBand
inferred← citeshttps://doi.org/10.1109/tpds.2017.2742503openalex-snapshot
Scalable Deadlock-Free Deterministic Minimal-Path Routing Engine for InfiniBand-Based Dragonfly Networks
inferred← citeshttps://doi.org/10.1145/2145816.2145823openalex-snapshot
Faster topology-aware collective algorithms through non-minimal communication
inferred← citeshttps://doi.org/10.1145/2370036.2145823openalex-snapshot
Faster topology-aware collective algorithms through non-minimal communication
inferred← citeshttps://doi.org/10.1145/2396556.2396578openalex-snapshot
Distributed adaptive routing for big-data applications running on data center networks
inferred← citeshttps://doi.org/10.1145/2464996.2465434openalex-snapshot
Bandwidth-optimal all-to-all exchanges in fat tree networks
inferred← citeshttps://doi.org/10.1145/2541228.2555293openalex-snapshot
Fast pattern-specific routing for fat tree networks
inferred← citeshttps://doi.org/10.1155/2020/8890721openalex-snapshot
Communication Optimization Technology Based on Network Dynamic Performance Model
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95568openalex-snapshot
Resource management techniques aware of interference among high-performance computing applications
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.