On the public citation graph

Layered shortest path (LASH) routing in irregular system area networks

0 signed · 81 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/10720115_4openalex-snapshot
A New Methodology to Compute Deadlock-Free Routing Tables for Irregular Networks
inferredcites →https://doi.org/10.1007/3-540-69352-1_18openalex-snapshot
On the Use of Virtual Channels in Networks of Workstations with Irregular Topology
inferredcites →https://doi.org/10.1007/bf01660031openalex-snapshot
The torus routing chip
inferredcites →https://doi.org/10.1016/0376-5075(79)90032-1openalex-snapshot
Virtual cut-through: A new computer communication switching technique
inferredcites →https://doi.org/10.1109/12.67315openalex-snapshot
An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
inferredcites →https://doi.org/10.1109/40.342015openalex-snapshot
Myrinet: a gigabit-per-second local area network
inferredcites →https://doi.org/10.1109/40.342016openalex-snapshot
TNet: a reliable system area network
inferredcites →https://doi.org/10.1109/40.566196openalex-snapshot
Spider: a high-speed network interconnect
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/hipc.1997.634511openalex-snapshot
Improving the efficiency of adaptive routing in networks with irregular topology
inferredcites →https://doi.org/10.1109/hipc.1998.737983openalex-snapshot
Virtual channel multiplexing in networks of workstations with irregular topology
inferredcites →https://doi.org/10.1109/icpp.1996.537143openalex-snapshot
Adaptive routing in irregular networks using cut-through switches
inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
inferredcites →https://doi.org/10.1145/335231.335235openalex-snapshot
Performance evaluation of a new routing strategy for irregular networks with source routing

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-1-4614-4274-5_3openalex-snapshot
Communication Architecture
inferred← citeshttps://doi.org/10.1007/978-1-4614-4274-5_4openalex-snapshot
Power and Thermal Effects and Management
inferred← citeshttps://doi.org/10.1007/978-3-030-36592-9_47openalex-snapshot
Extended Routing Table Generation Algorithm for the Angara Interconnect
inferred← citeshttps://doi.org/10.1007/978-3-540-24596-4_13openalex-snapshot
FROOTS – Fault Handling in Up*/Down* Routed Networks with Multiple Roots
inferred← citeshttps://doi.org/10.1007/978-3-540-24596-4_14openalex-snapshot
Admission Control for DiffServ Based Quality of Service in Cut-Through Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-01156-6_14openalex-snapshot
Scalable Interconnection Networks
inferred← citeshttps://doi.org/10.1007/s11227-016-1759-yopenalex-snapshot
Compact network reconfiguration in fat-trees
inferred← citeshttps://doi.org/10.1007/s11227-017-2173-9openalex-snapshot
A deadlock-free routing algorithm for irregular 3D network-on-chips with wireless links
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.1016/j.parco.2004.11.003openalex-snapshot
Path selection algorithm: the strategy for designing deterministic routing from alternative paths
inferred← citeshttps://doi.org/10.1016/j.parco.2017.06.004openalex-snapshot
XOR-based HoL-blocking reduction routing mechanisms for direct networks
inferred← citeshttps://doi.org/10.1109/access.2022.3227460openalex-snapshot
Review, Analysis, and Implementation of Path Selection Strategies for 2D NoCs
inferred← citeshttps://doi.org/10.1109/candarw.2019.00023openalex-snapshot
Deadlock-Free Layered Routing for Infiniband Networks
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.2010.21openalex-snapshot
Host Side Dynamic Reconfiguration with InfiniBand
inferred← citeshttps://doi.org/10.1109/cluster.2015.142openalex-snapshot
SlimUpdate: Minimal Routing Update for Performance-Based Reconfigurations in Fat-Trees
inferred← citeshttps://doi.org/10.1109/clustr.2003.1253339openalex-snapshot
Performance evaluation of routing algorithms in RHiNET-2 cluster
inferred← citeshttps://doi.org/10.1109/comst.2017.2746083openalex-snapshot
An Integrated Tutorial on InfiniBand, Verbs, and MPI
inferred← citeshttps://doi.org/10.1109/conect.2003.1231473openalex-snapshot
PCI express and advanced switching: evolutionary path to building next generation interconnects
inferred← citeshttps://doi.org/10.1109/dsd.2008.38openalex-snapshot
An Analysis of Connectivity and Yield for 2D Mesh Based NoC with Interconnect Router Failures
inferred← citeshttps://doi.org/10.1109/hoti.2009.9openalex-snapshot
Optimized Routing for Large-Scale InfiniBand 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/icis.2016.7550818openalex-snapshot
ACRO: Assignment of channels in reverse order to make arbitrary routing deadlock-free
inferred← citeshttps://doi.org/10.1109/icpads.2017.00091openalex-snapshot
HiRy: An Advanced Theory on Design of Deadlock-Free Adaptive Routing for Arbitrary Topologies
inferred← citeshttps://doi.org/10.1109/icpp.2003.1240620openalex-snapshot
Descending layers routing: a deadlock-free deterministic routing using virtual channels in system area networks with irregular topologies
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/infocomwkshps51825.2021.9484601openalex-snapshot
ITSY: Initial Trigger-Based PFC Deadlock Detection in the Data Plane
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213361openalex-snapshot
A criterion for cost optimal construction of irregular networks
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536280openalex-snapshot
Fault tolerance with shortest paths in regular and irregular networks
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/pccc.2008.4745143openalex-snapshot
Simple and Effective Adaptive Routing Algorithms in Multi-Layer Wormhole Networks
inferred← citeshttps://doi.org/10.1109/pdcat.2012.67openalex-snapshot
Discovery and Routing of Degraded Fat-Trees
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/sc.2016.12openalex-snapshot
Scheduling-Aware Routing for Supercomputers
inferred← citeshttps://doi.org/10.1109/sc41405.2020.00031openalex-snapshot
FatPaths: Routing in Supercomputers and Data Centers when Shortest Paths Fall Short
inferred← citeshttps://doi.org/10.1109/tcns.2014.2304869openalex-snapshot
Optimal Turn Prohibition for Deadlock Prevention in Networks With Regular Topologies
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/tpds.2005.97openalex-snapshot
Performance evaluation of deterministic routings, multicasts, and topologies on RHiNET-2 cluster
inferred← citeshttps://doi.org/10.1109/tpds.2006.12openalex-snapshot
Layered routing in irregular networks
inferred← citeshttps://doi.org/10.1109/tpds.2007.36openalex-snapshot
An Effective Design of Deadlock-Free Routing Algorithms Based on 2D Turn Model for Irregular Networks
inferred← citeshttps://doi.org/10.1109/tpds.2008.106openalex-snapshot
Application Specific Routing Algorithms for Networks on Chip
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.1145/1534530.1534552openalex-snapshot
Improving communication-phase completion times in HPC clusters through congestion mitigation
inferred← citeshttps://doi.org/10.1145/2086696.2086734openalex-snapshot
sFtree
inferred← citeshttps://doi.org/10.1145/2485984.2485995openalex-snapshot
An efficient, low-cost routing framework for convex mesh partitions to support virtualization
inferred← citeshttps://doi.org/10.1145/2536522.2536532openalex-snapshot
A first effort for a distributed segment-based approach on self-assembled nano networks
inferred← citeshttps://doi.org/10.1145/2751560openalex-snapshot
REDELF
inferred← citeshttps://doi.org/10.1145/2907294.2907313openalex-snapshot
Routing on the Dependency Graph
inferred← citeshttps://doi.org/10.1145/3005745.3005760openalex-snapshot
Deadlocks in Datacenter Networks
inferred← citeshttps://doi.org/10.1145/3143361.3143382openalex-snapshot
Tagger
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/3295500.3356140openalex-snapshot
HyperX topology
inferred← citeshttps://doi.org/10.1145/3341302.3342065openalex-snapshot
Gentle flow control
inferred← citeshttps://doi.org/10.1201/b10477-18openalex-snapshot
Bibliography
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.1587/transinf.2018edp7367openalex-snapshot
A Generalized Theory Based on the Turn Model for Deadlock-Free Irregular Networks
inferred← citeshttps://doi.org/10.3390/jlpea8010005openalex-snapshot
The Advances, Challenges and Future Possibilities of Millimeter-Wave Chip-to-Chip Interconnections for Multi-Chip Systems
inferred← citeshttps://doi.org/10.4018/978-1-4666-2533-4.ch003openalex-snapshot
Deadlock Prevention with Wormhole Routing
inferred← citeshttps://doi.org/10.4018/978-1-4666-2533-4.ch004openalex-snapshot
Deadlock Prevention with Wormhole Routing
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.4995/thesis/10251/2603openalex-snapshot
Efficient mechanisms to provide fault tolerance in interconnection networks for pc clusters
inferred← citeshttps://doi.org/10.4995/thesis/10251/8962openalex-snapshot
Cost Effective Routing Implementations for On-chip Networks
inferred← citeshttps://doi.org/10.7155/jgaa.00134openalex-snapshot
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
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.