On the public citation graph
Deadlock-Free Oblivious Routing for Arbitrary Topologies
0 signed · 92 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/3-540-39999-2_23openalex-snapshot
A Flexible Routing Scheme for Networks of Workstations
inferredcites →https://doi.org/10.1007/978-3-540-30141-7_45openalex-snapshot
Graph-Theoretic Analysis of Kautz Topology and DHT Schemes
inferredcites →https://doi.org/10.1007/978-3-540-75444-2_62openalex-snapshot
Netgauge: A Network Performance Measurement Framework
inferredcites →https://doi.org/10.1016/s0927-5452(04)80064-9openalex-snapshot
BenchIT — Performance measurement and comparison for scientific applications
inferredcites →https://doi.org/10.1109/12.954503openalex-snapshot
Deadlock-free oblivious wormhole routing with cyclic dependencies
inferredcites →https://doi.org/10.1109/49.105178openalex-snapshot
Autonet: a high-speed, self-configuring local area network using point-to-point links
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/hoti.2009.9openalex-snapshot
Optimized Routing for Large-Scale InfiniBand Networks
inferredcites →https://doi.org/10.1109/hoti.2010.16openalex-snapshot
The PERCS High-Performance Interconnect
inferredcites →https://doi.org/10.1109/icpads.2004.1316144openalex-snapshot
LASH-TOR: a generic transition-oriented routing algorithm
inferredcites →https://doi.org/10.1109/icpads.2004.50openalex-snapshot
LASH-TOR: a generic transition-oriented routing algorithm
inferredcites →https://doi.org/10.1109/icpp.2003.1240572openalex-snapshot
Evaluation of a subnet management mechanism for InfiniBand networks
inferredcites →https://doi.org/10.1109/ipdps.2002.1016568openalex-snapshot
Analyzing the influence of virtual lanes on the performance of infiniband networks
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/sfcs.2002.1181881openalex-snapshot
Minimizing congestion in general networks
inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
inferredcites →https://doi.org/10.1109/tpds.2006.12openalex-snapshot
Layered routing in irregular networks
inferredcites →https://doi.org/10.1145/1254882.1254922openalex-snapshot
Oblivious routing for fat-tree based system area networks with uncertain traffic demands
inferredcites →https://doi.org/10.1145/1269899.1254922openalex-snapshot
Oblivious routing for fat-tree based system area networks with uncertain traffic demands
inferredcites →https://doi.org/10.1145/1402946.1402967openalex-snapshot
A scalable, commodity data center network architecture
inferredcites →https://doi.org/10.1145/1402958.1402967openalex-snapshot
A scalable, commodity data center network architecture
inferredcites →https://doi.org/10.1145/321765.321768openalex-snapshot
A Note on Dijkstra's Shortest Path Algorithm
inferredcites →https://doi.org/10.1145/3749740.3749751openalex-snapshot
Universal Schemes for Parallel Communication
inferredcites →https://doi.org/10.1145/777412.777418openalex-snapshot
A practical algorithm for constructing oblivious routing schemes
inferredcites →https://doi.org/10.1145/777417.777418openalex-snapshot
A practical algorithm for constructing oblivious routing schemes
inferredcites →https://doi.org/10.1145/780542.780599openalex-snapshot
Optimal oblivious routing in polynomial time
inferredcites →https://doi.org/10.1145/800141.804656openalex-snapshot
Deadlock- and livelock-free packet switching networks
inferredcites →https://doi.org/10.1177/109434209100500306openalex-snapshot
The NAS Parallel Benchmarks
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-032-22051-6_8openalex-snapshot
Routing Table Generation and Node Allocation Algorithms for the Angara High-Performance Interconnect
inferred← citeshttps://doi.org/10.1007/s11227-024-06214-6openalex-snapshot
Implementation and testing of a KNS topology in an InfiniBand cluster
inferred← citeshttps://doi.org/10.1016/j.future.2016.04.003openalex-snapshot
Efficient network isolation and load balancing in multi-tenant HPC clusters
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.09.008openalex-snapshot
Feasible enhancements to congestion control in InfiniBand-based networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.07.010openalex-snapshot
Leveraging InfiniBand controller to configure deadlock-free routing engines for Dragonflies
inferred← citeshttps://doi.org/10.1109/ccgrid.2015.10openalex-snapshot
A Novel Query Caching Scheme for Dynamic InfiniBand Subnets
inferred← citeshttps://doi.org/10.1109/ccgrid.2015.96openalex-snapshot
Partition-Aware Routing to Improve Network Isolation in Infiniband Based Multi-tenant Clusters
inferred← citeshttps://doi.org/10.1109/cluster.2015.58openalex-snapshot
Towards the InfiniBand SR-IOV vSwitch Architecture
inferred← citeshttps://doi.org/10.1109/comst.2017.2746083openalex-snapshot
An Integrated Tutorial on InfiniBand, Verbs, and MPI
inferred← citeshttps://doi.org/10.1109/cybermatics_2018.2018.00312openalex-snapshot
Topological Response to Deadlock Detection and Resolution in Real-Time Database Systems
inferred← citeshttps://doi.org/10.1109/hipineb.2016.7openalex-snapshot
Combining OpenFabrics Software and Simulation Tools for Modeling InfiniBand-Based Interconnection Networks
inferred← citeshttps://doi.org/10.1109/hoti.2016.015openalex-snapshot
Ensuring Deadlock-Freedom in Low-Diameter InfiniBand Networks
inferred← citeshttps://doi.org/10.1109/hoti.2019.00013openalex-snapshot
The First Supercomputer with HyperX Topology: A Viable Alternative to Fat-Trees?
inferred← citeshttps://doi.org/10.1109/hpcsim.2015.7237036openalex-snapshot
Analyzing available routing engines for InfiniBand-based clusters with Dragonfly topology
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00022openalex-snapshot
Efficient Multi-GPU Graph Processing with Remote Work Stealing
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00025openalex-snapshot
Flash: A Framework for Programming Distributed Graph Processing Algorithms
inferred← citeshttps://doi.org/10.1109/icis.2016.7550818openalex-snapshot
ACRO: Assignment of channels in reverse order to make arbitrary routing deadlock-free
inferred← citeshttps://doi.org/10.1109/icnp61940.2024.10858514openalex-snapshot
Roundabout: Solving PFC Deadlocks With Distributed Detection and Buffer Collaboration
inferred← citeshttps://doi.org/10.1109/infocom.2016.7524356openalex-snapshot
Deadlock-free local fast failover for arbitrary data center networks
inferred← citeshttps://doi.org/10.1109/infocom48880.2022.9796798openalex-snapshot
Detecting and Resolving PFC Deadlocks with ITSY Entirely in the Data Plane
inferred← citeshttps://doi.org/10.1109/infocomwkshps51825.2021.9484601openalex-snapshot
ITSY: Initial Trigger-Based PFC Deadlock Detection in the Data Plane
inferred← citeshttps://doi.org/10.1109/ipdps.2017.110openalex-snapshot
FlexVC: Flexible Virtual Channel Management in Low-Diameter Networks
inferred← citeshttps://doi.org/10.1109/ipdps57955.2024.00073openalex-snapshot
MUSE: A Runtime Incrementally Reconfigurable Network Adapting to HPC Real-Time Traffic
inferred← citeshttps://doi.org/10.1109/jsac.2019.2906747openalex-snapshot
Links as a Service (LaaS): Guaranteed Tenant Isolation in the Shared Cloud
inferred← citeshttps://doi.org/10.1109/pdcat.2012.67openalex-snapshot
Discovery and Routing of Degraded Fat-Trees
inferred← citeshttps://doi.org/10.1109/pdp.2014.22openalex-snapshot
Multi-homed Fat-Tree Routing with InfiniBand
inferred← citeshttps://doi.org/10.1109/pdp.2015.111openalex-snapshot
A Weighted Fat-Tree Routing Algorithm for Efficient Load-Balancing in Infini Band Enterprise Clusters
inferred← citeshttps://doi.org/10.1109/pdp.2015.22openalex-snapshot
Preprocessing of Scenarios for Fast and Efficient Routing Reconfiguration in Fault-Tolerant NoCs
inferred← citeshttps://doi.org/10.1109/sc.2014.34openalex-snapshot
Slim Fly: A Cost Effective Low-Diameter Network Topology
inferred← citeshttps://doi.org/10.1109/sc.2014.54openalex-snapshot
Fail-in-Place Network Design: Interaction Between Topology, Routing Algorithm and Failures
inferred← citeshttps://doi.org/10.1109/sc.2016.12openalex-snapshot
Scheduling-Aware Routing for Supercomputers
inferred← citeshttps://doi.org/10.1109/tcc.2015.2440242openalex-snapshot
CSR: Classified Source Routing in Distributed Networks
inferred← citeshttps://doi.org/10.1109/tnet.2019.2902875openalex-snapshot
Tagger: Practical PFC Deadlock Prevention in Data Center Networks
inferred← citeshttps://doi.org/10.1109/tnet.2024.3363658openalex-snapshot
FlowStar: Fast Convergence Per-Flow State Accurate Congestion Control for InfiniBand
inferred← citeshttps://doi.org/10.1109/tnse.2024.3382295openalex-snapshot
Alarm: An Adaptive Routing Algorithm Based on One-Way Delay for Infiniband
inferred← citeshttps://doi.org/10.1109/ton.2026.3678334openalex-snapshot
Revisiting Flow Control in Node-Centric Datacenter Networks
inferred← citeshttps://doi.org/10.1109/tpds.2011.190openalex-snapshot
A Survey and Evaluation of Topology-Agnostic Deterministic Routing Algorithms
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.1109/tpds.2020.3035761openalex-snapshot
High-Performance Routing With Multipathing and Path Diversity in Ethernet and HPC Networks
inferred← citeshttps://doi.org/10.1145/2907294.2907313openalex-snapshot
Routing on the Dependency Graph
inferred← citeshttps://doi.org/10.1145/3005745.3005768openalex-snapshot
Unlocking Credit Loop Deadlocks
inferred← citeshttps://doi.org/10.1145/3205289.3205307openalex-snapshot
High-Performance, Low-Complexity Deadlock Avoidance for Arbitrary Topologies/Routings
inferred← citeshttps://doi.org/10.1145/3293883.3295716openalex-snapshot
A pattern based algorithmic autotuner for graph processing on GPUs
inferred← citeshttps://doi.org/10.1145/3384441.3395989openalex-snapshot
Evaluation of Link Failure Resilience in Multirail Dragonfly-Class Networks through Simulation
inferred← citeshttps://doi.org/10.1145/3625549.3658656openalex-snapshot
Efficient all-to-all Collective Communication Schedules for Direct-connect Topologies
inferred← citeshttps://doi.org/10.1145/3673038.3673060openalex-snapshot
NetSmith: An Optimization Framework for Machine-Discovered Network Topologies
inferred← citeshttps://doi.org/10.1145/3721145.3725749openalex-snapshot
PortFC: Designing High-performance Deadlock-free BCube Networks
inferred← citeshttps://doi.org/10.14529/jsfi140303openalex-snapshot
Early evaluation of direct large-scale InfiniBand networks with adaptive routing
inferred← citeshttps://doi.org/10.1587/transinf.2016edp7477openalex-snapshot
A Novel Channel Assignment Method to Ensure Deadlock-Freedom for Deterministic Routing
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3449785/v1openalex-snapshot
Implementation and Evaluation of a Hybrid Network Topology in an Infiniband-based HPC cluster
inferred← citeshttps://doi.org/10.48550/arxiv.1509.07395openalex-snapshot
Links as a Service (LaaS): Feeling Alone in the Shared Cloud
inferred← citeshttps://doi.org/10.48550/arxiv.1912.08968openalex-snapshot
Slim Fly: A Cost Effective Low-Diameter Network Topology
inferred← citeshttps://doi.org/10.48550/arxiv.2009.13446openalex-snapshot
DCFIT: Initial Trigger-Based PFC Deadlock Detection in the Data Plane
inferred← citeshttps://doi.org/10.48550/arxiv.2110.00851openalex-snapshot
Optimized Graph Based Routing Algorithm for the Angara Interconnect
inferred← citeshttps://doi.org/10.70675/81b65091zbeabz4392z84d6z8343e098227bopenalex-snapshot
New routing algorithms for heterogeneous exaflopic supercomputers
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.