On the public citation graph
A New Methodology to Compute Deadlock-Free Routing Tables for Irregular Networks
0 signed · 70 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/10720115_5openalex-snapshot
On the Performance of Up*/Down* Routing
inferredcites →https://doi.org/10.1007/3-540-62573-9_5openalex-snapshot
A deadlock avoidance method for computer networks
inferredcites →https://doi.org/10.1007/978-1-4612-9967-7openalex-snapshot
Graph Theory: An Introductory Course
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/40.342015openalex-snapshot
Myrinet: a gigabit-per-second local area network
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/71.250114openalex-snapshot
A new theory of deadlock-free adaptive routing in wormhole networks
inferredcites →https://doi.org/10.1109/hicss.1996.495447openalex-snapshot
Fibre channel fabrics: evaluation and design
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/tc.1987.1676939openalex-snapshot
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
inferredcites →https://doi.org/10.1145/253260.253322openalex-snapshot
High-performance sorting on networks of workstations
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.1359openalex-snapshot
Topology agnostic hot‐spot avoidance with InfiniBand
inferred← citeshttps://doi.org/10.1007/10720115_5openalex-snapshot
On the Performance of Up*/Down* Routing
inferred← citeshttps://doi.org/10.1007/3-540-39999-2_23openalex-snapshot
A Flexible Routing Scheme for Networks of Workstations
inferred← citeshttps://doi.org/10.1007/3-540-39999-2_28openalex-snapshot
Combining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_123openalex-snapshot
Improving the Up*/Down* Routing Scheme for Networks of Workstations
inferred← citeshttps://doi.org/10.1007/3-540-47847-7_7openalex-snapshot
Improving InfiniBand Routing through Multiple Virtual Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-27866-5_118openalex-snapshot
A Methodology to Evaluate the Effectiveness of Traffic Balancing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-85451-7_101openalex-snapshot
Deadlock-Free Dynamic Network Reconfiguration Based on Close Up*/Down* Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-01156-6_14openalex-snapshot
Scalable Interconnection Networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.10.010openalex-snapshot
A new distributed management mechanism for ASI based networks
inferred← citeshttps://doi.org/10.1016/j.parco.2008.12.011openalex-snapshot
A dynamic distributed mechanism for reconfiguring high-performance networks
inferred← citeshttps://doi.org/10.1016/j.parco.2011.01.002openalex-snapshot
Efficient network management applied to source routed networks
inferred← citeshttps://doi.org/10.1016/j.sysarc.2005.09.003openalex-snapshot
High-performance adaptive routing for networks with arbitrary topology
inferred← citeshttps://doi.org/10.1109/comst.2017.2746083openalex-snapshot
An Integrated Tutorial on InfiniBand, Verbs, and MPI
inferred← citeshttps://doi.org/10.1109/empdp.2001.904962openalex-snapshot
On the relative behavior of source and distributed routing in NOWs using Up*/Down* routing schemes
inferred← citeshttps://doi.org/10.1109/empdp.2002.994237openalex-snapshot
Performance sensitivity of routing algorithms to failures in networks of workstations with regular and irregular topologies
inferred← citeshttps://doi.org/10.1109/empdp.2002.994334openalex-snapshot
Removing the latency overhead of the ITB mechanism in COWs with source routing
inferred← citeshttps://doi.org/10.1109/fcst.2009.36openalex-snapshot
Infiniband-Based Multi-path Mesh/Torus Interconnection Network for Massively Parallel Systems
inferred← citeshttps://doi.org/10.1109/icce-taiwan58799.2023.10226850openalex-snapshot
Performance Evaluation of Parallel Tasks for Fault-tolerant Routing Methods
inferred← citeshttps://doi.org/10.1109/icpads.2004.1316144openalex-snapshot
LASH-TOR: a generic transition-oriented routing algorithm
inferred← citeshttps://doi.org/10.1109/icpads.2004.50openalex-snapshot
LASH-TOR: a generic transition-oriented routing algorithm
inferred← citeshttps://doi.org/10.1109/icpp.2000.876161openalex-snapshot
Fast dynamic reconfiguration in irregular networks
inferred← citeshttps://doi.org/10.1109/icpp.2001.952046openalex-snapshot
Effective strategy to compute forwarding tables for infiniBand networks
inferred← citeshttps://doi.org/10.1109/icpp.2001.952084openalex-snapshot
L-turn routing: an adaptive routing in irregular networks
inferred← citeshttps://doi.org/10.1109/icpp.2001.952089openalex-snapshot
Deadlock-free routing in InfiniBand/sup TM/ through destination renaming
inferred← citeshttps://doi.org/10.1109/icpp.2003.1240618openalex-snapshot
Routing in infiniBand/spl trade/ torus network topologies
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925016openalex-snapshot
Improving network performance by reducing network contention in source-based COWS with a low path-computation overhead
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016559openalex-snapshot
Layered shortest path (LASH) routing in irregular system area networks
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016568openalex-snapshot
Analyzing the influence of virtual lanes on the performance of infiniband networks
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213371openalex-snapshot
Performance evaluation of COWS under real parallel applications
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303199openalex-snapshot
Use of provisional routes to speed-up change assimilation in infiniband networks
inferred← citeshttps://doi.org/10.1109/isca.2018.00066openalex-snapshot
Modular Routing Design for Chiplet-Based Systems
inferred← citeshttps://doi.org/10.1109/nca.2001.962515openalex-snapshot
Influence of network size and load on the performance of reconfiguration protocols
inferred← citeshttps://doi.org/10.1109/tc.2003.1228510openalex-snapshot
Applying in-transit buffers to boost the performance of networks with source routing
inferred← citeshttps://doi.org/10.1109/tpds.2002.1019859openalex-snapshot
Boosting the performance of Myrinet networks
inferred← citeshttps://doi.org/10.1109/tpds.2002.1058099openalex-snapshot
Boosting the performance of Myrinet networks
inferred← citeshttps://doi.org/10.1109/tpds.2006.35openalex-snapshot
Fast routing computation on InfiniBand networks
inferred← citeshttps://doi.org/10.1109/tpds.2007.26openalex-snapshot
Handling Topology Changes in InfiniBand
inferred← citeshttps://doi.org/10.1109/tpds.2008.144openalex-snapshot
LID Assignment in InfiniBand 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.2011.79openalex-snapshot
A Deadlock-Free Dynamic Reconfiguration Scheme for Source Routing Networks Using Close Up*/Down* Graphs
inferred← citeshttps://doi.org/10.1109/weconf48837.2020.9131547openalex-snapshot
Deadlock-Free Routing for SpaceWire On-Board Networks
inferred← citeshttps://doi.org/10.1109/weconf51603.2021.9470619openalex-snapshot
Selection Methods for Deadlock-free Routes' Optimal Configuration in On-board SpaceWire Networks
inferred← citeshttps://doi.org/10.1145/1323548.1323567openalex-snapshot
On LID assignment in infiniBand networks
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/2907294.2907313openalex-snapshot
Routing on the Dependency Graph
inferred← citeshttps://doi.org/10.1145/3444950.3447283openalex-snapshot
GANNoC: A Framework for Automatic Generation of NoC Topologies using Generative Adversarial Networks
inferred← citeshttps://doi.org/10.23919/fruct.2018.8468268openalex-snapshot
Deadlock-Free Routing in SpaceWire Onboard Network
inferred← citeshttps://doi.org/10.4018/978-1-7998-1974-5.ch004openalex-snapshot
Embedded Networks Design and Simulation
inferred← citeshttps://doi.org/10.4018/ijertcs.289199openalex-snapshot
Configuring Methods for Deadlock-Free Routing
inferred← citeshttps://doi.org/10.47893/ijcct.2017.1409openalex-snapshot
PERFORMANCE ENHANCEMENT IN IRREGULAR NETWORK USING MULTIPLE ROOT
inferred← citeshttps://doi.org/10.48550/arxiv.2006.11025openalex-snapshot
Design of a Near-Ideal Fault-Tolerant Routing Algorithm for Network-on-Chip-Based Multicores
inferred← citeshttps://doi.org/10.4995/thesis/10251/8962openalex-snapshot
Cost Effective Routing Implementations for On-chip Networks
inferred← citeshttps://doi.org/10.5120/884-1256openalex-snapshot
Optimising Up*/Down* Routing By Minimal Paths
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.