On the public citation graph
A general theory for deadlock-free adaptive routing using a mixed set of resources
0 signed · 140 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.0008openalex-snapshot
A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing
inferredcites →https://doi.org/10.1007/3-540-58429-3_44openalex-snapshot
Optimized routing in the Cray T3D
inferredcites →https://doi.org/10.1007/3-540-62573-9_4openalex-snapshot
Efficient adaptive routing in networks of workstations with irregular topology
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/3-540-69352-1_18openalex-snapshot
On the Use of Virtual Channels in Networks of Workstations with Irregular Topology
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.144624openalex-snapshot
Dynamically-allocated multi-queue buffers for VLSI communication switches
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/12.780873openalex-snapshot
Flexible and efficient routing based on progressive deadlock recovery
inferredcites →https://doi.org/10.1109/2944.778317openalex-snapshot
Design issues for core-based optoelectronic chips: a case study of the WARRP network router
inferredcites →https://doi.org/10.1109/40.342015openalex-snapshot
Myrinet: a gigabit-per-second local area network
inferredcites →https://doi.org/10.1109/40.566196openalex-snapshot
Spider: a high-speed network interconnect
inferredcites →https://doi.org/10.1109/40.903059openalex-snapshot
A delay model for router microarchitectures
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.219761openalex-snapshot
Deadlock-free adaptive routing in multicomputer networks using virtual channels
inferredcites →https://doi.org/10.1109/71.246072openalex-snapshot
Multicast communication in multicomputer networks
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/71.262584openalex-snapshot
The impact of pipelined channels on k-ary n-cube networks
inferredcites →https://doi.org/10.1109/71.277792openalex-snapshot
Fully adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks: algorithms and simulations
inferredcites →https://doi.org/10.1109/71.382317openalex-snapshot
A family of fault-tolerant routing protocols for direct multiprocessor networks
inferredcites →https://doi.org/10.1109/71.395404openalex-snapshot
The message flow model for routing in wormhole-routed networks
inferredcites →https://doi.org/10.1109/71.473515openalex-snapshot
A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks
inferredcites →https://doi.org/10.1109/71.532115openalex-snapshot
A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks
inferredcites →https://doi.org/10.1109/71.584089openalex-snapshot
Compressionless routing: a framework for adaptive and fault-tolerant routing
inferredcites →https://doi.org/10.1109/71.707539openalex-snapshot
A general theory for deadlock avoidance in wormhole-routed networks
inferredcites →https://doi.org/10.1109/71.798315openalex-snapshot
Characterization of deadlocks in k-ary n-cube networks
inferredcites →https://doi.org/10.1109/71.841739openalex-snapshot
A formal model of message blocking and deadlock resolution in interconnection networks
inferredcites →https://doi.org/10.1109/71.877939openalex-snapshot
On the use of virtual channels in networks of workstations with irregular topology
inferredcites →https://doi.org/10.1109/conect.1994.765349openalex-snapshot
Architecture and implementation of the reliable router
inferredcites →https://doi.org/10.1109/empdp.1995.389126openalex-snapshot
An adaptive deadlock and livelock free routing algorithm
inferredcites →https://doi.org/10.1109/empdp.1998.647228openalex-snapshot
Virtual cut-through implementation of the HB packet switching routing algorithm
inferredcites →https://doi.org/10.1109/hipc.1997.634510openalex-snapshot
A flow control mechanism to avoid message deadlock in k-ary n-cube networks
inferredcites →https://doi.org/10.1109/hpca.1998.650546openalex-snapshot
A very efficient distributed deadlock detection mechanism for wormhole networks
inferredcites →https://doi.org/10.1109/icpp.1994.36openalex-snapshot
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks
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/icpp.1997.622586openalex-snapshot
Software-based deadlock recovery technique for true fully adaptive routing in wormhole networks
inferredcites →https://doi.org/10.1109/icpp.1999.797390openalex-snapshot
Characterization of deadlocks in irregular networks
inferredcites →https://doi.org/10.1109/ipps.1995.395983openalex-snapshot
DISHA: a deadlock recovery scheme for fully adaptive routing
inferredcites →https://doi.org/10.1109/ipps.1996.508069openalex-snapshot
ServerNet deadlock avoidance and fractahedral topologies
inferredcites →https://doi.org/10.1109/ipps.1996.508153openalex-snapshot
Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent
inferredcites →https://doi.org/10.1109/ipps.1997.580961openalex-snapshot
Performance analysis of minimal adaptive wormhole routing with time-dependent deadlock recovery
inferredcites →https://doi.org/10.1109/isca.1989.714549openalex-snapshot
High Performance Communications In Processor Networks
inferredcites →https://doi.org/10.1109/isca.1994.288141openalex-snapshot
Compressionless Routing: a framework for adaptive and fault-tolerant routing
inferredcites →https://doi.org/10.1109/isca.1995.524561openalex-snapshot
An efficient, fully adaptive deadlock recovery scheme: DISHA
inferredcites →https://doi.org/10.1109/tc.1987.1676939openalex-snapshot
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
inferredcites →https://doi.org/10.1109/tcom.1980.1094666openalex-snapshot
Deadlock Avoidance in Store-and-Forward Networks--I: Store-and-Forward Deadlock
inferredcites →https://doi.org/10.1109/tcom.1981.1095021openalex-snapshot
Prevention of Deadlocks in Packet-Switched Data Transport Systems
inferredcites →https://doi.org/10.1145/191995.192050openalex-snapshot
Compressionless routing: a framework for adaptive and fault-tolerant routing
inferredcites →https://doi.org/10.1145/215399.215440openalex-snapshot
A universal proof technique for deadlock-free routing in interconnection networks
inferredcites →https://doi.org/10.1145/223982.224431openalex-snapshot
An efficient, fully adaptive deadlock recovery scheme
inferredcites →https://doi.org/10.1145/264107.264127openalex-snapshot
On deadlocks in interconnection networks
inferredcites →https://doi.org/10.1145/74925.74943openalex-snapshot
High performance communications in processor networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1782openalex-snapshot
Characterization of Deadlocks in Irregular Networks
inferred← citeshttps://doi.org/10.1007/978-0-387-89828-5_13openalex-snapshot
Network Reconfiguration in High-Performance Interconnection Networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-4274-5_3openalex-snapshot
Communication Architecture
inferred← citeshttps://doi.org/10.1007/978-3-030-78713-4_1openalex-snapshot
Microarchitecture of a Configurable High-Radix Router for the Post-Moore Era
inferred← citeshttps://doi.org/10.1007/978-3-540-30102-8_29openalex-snapshot
Comparative Evaluation of Adaptive and Deterministic Routing in the OTIS-Hypercube
inferred← citeshttps://doi.org/10.1007/978-3-540-30141-7_54openalex-snapshot
The Effect of Adaptivity on the Performance of the OTIS-Hypercube Under Different Traffic Patterns
inferred← citeshttps://doi.org/10.1007/978-3-540-72584-8_90openalex-snapshot
Efficient Deadlock Detection in Parallel Computer Systems with Wormhole Routing
inferred← citeshttps://doi.org/10.1007/978-981-15-8135-9_4openalex-snapshot
DBM: A Dimension-Bubble-Based Multicast Routing Algorithm for 2D Mesh Network-on-Chips
inferred← citeshttps://doi.org/10.1007/978-981-97-0834-5_27openalex-snapshot
Absorb: Deadlock Resolution for 2.5D Modular Chiplet Based Systems
inferred← citeshttps://doi.org/10.1007/s10586-009-0084-0openalex-snapshot
A general mathematical performance model for wormhole-switched irregular networks
inferred← citeshttps://doi.org/10.1007/s10836-026-06251-4openalex-snapshot
ATLAS: An Adaptive Routing Algorithm for Fault-Tolerant 3D NoCs
inferred← citeshttps://doi.org/10.1007/s10922-011-9203-3openalex-snapshot
Enhancing Routing Robustness of Unstructured Peer-to-Peer Networks Using Mobile Agents
inferred← citeshttps://doi.org/10.1007/s11227-015-1597-3openalex-snapshot
Conditional forwarding: simple flow control to increase adaptivity for fully adaptive routing algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-12-800979-6.00006-8openalex-snapshot
Flow control for fully adaptive routing††Part of this research was first presented at the 18th IEEE International Symposium on High Performance Computer Architecture (HPCA-2012) [32]. The journal extension edition of the HPCA-2012 paper was published in IEEE Transactions on Parallel and…
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2010.06.001openalex-snapshot
Modeling the effects of hot-spot traffic load on the performance of wormhole-switched hypermeshes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.04.012openalex-snapshot
Mathematical performance modelling of adaptive wormhole routing in optoelectronic hypercubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.11.004openalex-snapshot
A general methodology for direction-based irregular routing algorithms
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.09.010openalex-snapshot
Performance modeling of Cartesian product networks
inferred← citeshttps://doi.org/10.1016/j.micpro.2017.08.007openalex-snapshot
ProNoC: A low latency network-on-chip based many-core system-on-chip prototyping platform
inferred← citeshttps://doi.org/10.1109/71.841739openalex-snapshot
A formal model of message blocking and deadlock resolution in interconnection networks
inferred← citeshttps://doi.org/10.1109/chinacom.2006.344822openalex-snapshot
A New Partition-Based Multicast Scheme for Torus Networks
inferred← citeshttps://doi.org/10.1109/clusterwksp.2010.5613085openalex-snapshot
Non-blocking adaptive cycles: Deadlock avoidance for fault-tolerant interconnection networks
inferred← citeshttps://doi.org/10.1109/dsd.2013.58openalex-snapshot
An Energy-Efficient Reconfigurable NoC Architecture with RF-Interconnects
inferred← citeshttps://doi.org/10.1109/hoti.2013.16openalex-snapshot
OFAR-CM: Efficient Dragonfly Networks with Simple Congestion Management
inferred← citeshttps://doi.org/10.1109/hoti66940.2025.00020openalex-snapshot
Deadlock-Free Routing for Full-Mesh Networks Without Using Virtual Channels
inferred← citeshttps://doi.org/10.1109/hpca.2008.4658639openalex-snapshot
CMP network-on-chip overlaid with multi-band RF-interconnect
inferred← citeshttps://doi.org/10.1109/hpca.2012.6169049openalex-snapshot
Whole packet forwarding: Efficient design of fully adaptive routing algorithms for networks-on-chip
inferred← citeshttps://doi.org/10.1109/hpca.2013.6522345openalex-snapshot
Energy-efficient interconnect via Router Parking
inferred← citeshttps://doi.org/10.1109/hpca51647.2021.00063openalex-snapshot
Pitstop: Enabling a Virtual Network Free Network-on-Chip
inferred← citeshttps://doi.org/10.1109/hpca53966.2022.00074openalex-snapshot
Stay in your Lane: A NoC with Low-overhead Multi-packet Bypassing
inferred← citeshttps://doi.org/10.1109/hpca53966.2022.00076openalex-snapshot
Upward Packet Popup for Deadlock Freedom in Modular Chiplet-Based Systems
inferred← citeshttps://doi.org/10.1109/icccas.2005.1493494openalex-snapshot
PDR: a new scheme of deadlock-free routing in mesh/torus interconnection networks
inferred← citeshttps://doi.org/10.1109/icccas.2006.285003openalex-snapshot
PQR: A Deadlock-Free Adaptive Routing Scheme Supporting Prioritized Traffic in Torus Switching Fabric
inferred← citeshttps://doi.org/10.1109/iccsn.2011.6013681openalex-snapshot
A fault tolerant adaptive routing algorithm in 2D mesh network on chip
inferred← citeshttps://doi.org/10.1109/icpads.2007.4447828openalex-snapshot
Mathematical performance analysis of product networks
inferred← citeshttps://doi.org/10.1109/icpp.1999.797390openalex-snapshot
Characterization of deadlocks in irregular networks
inferred← citeshttps://doi.org/10.1109/icpp.2002.1040862openalex-snapshot
A new mechanism for congestion and deadlock resolution
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303007openalex-snapshot
Using speculation to simplify multiprocessor design
inferred← citeshttps://doi.org/10.1109/isca.2018.00064openalex-snapshot
Synchronized Progress in Interconnection Networks (SPIN): A New Theory for Deadlock Freedom
inferred← citeshttps://doi.org/10.1109/ispa.2008.108openalex-snapshot
Broadcast Algorithms on OTIS-Cubes
inferred← citeshttps://doi.org/10.1109/ispa.2008.109openalex-snapshot
A General Approach for Analytical Modeling of Irregular NoCs
inferred← citeshttps://doi.org/10.1109/mascot.2002.1167076openalex-snapshot
Disha: a performance model of a true fully adaptive routing algorithm in k-ary n-cubes
inferred← citeshttps://doi.org/10.1109/mdat.2023.3309742openalex-snapshot
SPOCK: Reverse Packet Traversal for Deadlock Recovery
inferred← citeshttps://doi.org/10.1109/micro.2012.33openalex-snapshot
NoRD: Node-Router Decoupling for Effective Power-gating of On-Chip Routers
inferred← citeshttps://doi.org/10.1109/micro61859.2024.00069openalex-snapshot
Ring Road: A Scalable Polar-Coordinate-based 2D Network-on-Chip Architecture
inferred← citeshttps://doi.org/10.1109/nocs.2014.7008758openalex-snapshot
Achieving balanced buffer utilization with a proper co-design of flow control and routing algorithm
inferred← citeshttps://doi.org/10.1109/pdp.2009.66openalex-snapshot
A General Methodology for Routing in Irregular Networks
inferred← citeshttps://doi.org/10.1109/scored.2014.7072956openalex-snapshot
Partially adaptive look-ahead routing for low latency Network-on-Chip
inferred← citeshttps://doi.org/10.1109/socdc.2008.4815628openalex-snapshot
Direction-based routing methodology for irregular NoCs
inferred← citeshttps://doi.org/10.1109/tc.2008.31openalex-snapshot
An Efficient and Deadlock-Free Network Reconfiguration Protocol
inferred← citeshttps://doi.org/10.1109/tc.2020.2987797openalex-snapshot
Enforcing Predictability of Many-Cores With DCFNoC
inferred← citeshttps://doi.org/10.1109/tc.2020.3029682openalex-snapshot
Remote Control: A Simple Deadlock Avoidance Scheme for Modular Systems-on-Chip
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.2003.1225057openalex-snapshot
Deadlock-free dynamic reconfiguration schemes for increased network dependability
inferred← citeshttps://doi.org/10.1109/tpds.2005.58openalex-snapshot
A theory for deadlock-free dynamic network reconfiguration. Part I
inferred← citeshttps://doi.org/10.1109/tpds.2005.59openalex-snapshot
A methodology for developing deadlock-free dynamic network reconfiguration processes. Part II
inferred← citeshttps://doi.org/10.1109/tpds.2005.93openalex-snapshot
Distributed resolution of network congestion and potential deadlock using reservation-based scheduling
inferred← citeshttps://doi.org/10.1109/tpds.2006.12openalex-snapshot
Layered routing in irregular networks
inferred← citeshttps://doi.org/10.1109/tpds.2011.145openalex-snapshot
An Efficient Adaptive Deadlock-Free Routing Algorithm for Torus Networks
inferred← citeshttps://doi.org/10.1109/tpds.2013.166openalex-snapshot
Novel Flow Control for Fully Adaptive Routing in Cache-Coherent NoCs
inferred← citeshttps://doi.org/10.1109/wicom.2009.5302538openalex-snapshot
An Network Reconfiguration Strategy for Customer Requirements Optimization
inferred← citeshttps://doi.org/10.1145/1132952.1132953openalex-snapshot
A survey of research and practices of Network-on-chip
inferred← citeshttps://doi.org/10.1145/2994133.2994134openalex-snapshot
Improved Flow Control for Minimal Fully Adaptive Routing in 2D Mesh NoC
inferred← citeshttps://doi.org/10.1145/3295500.3356151openalex-snapshot
Practical and efficient incremental adaptive routing for HyperX networks
inferred← citeshttps://doi.org/10.1147/rd.492.0265openalex-snapshot
Blue Gene/L torus interconnection network
inferred← citeshttps://doi.org/10.2200/s00650ed1v01y201505cac033openalex-snapshot
Customizable Computing
inferred← citeshttps://doi.org/10.3233/hsn-2007-313openalex-snapshot
An empirical performance analysis of minimal and non-minimal routing in cube-based OTIS multicomputers
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.1910.04882openalex-snapshot
Remote Control: A Simple Deadlock Avoidance Scheme for Modular System on Chip
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/107336openalex-snapshot
Improving Network-on-Chip Performance in Multi-Core Systems
inferred← citeshttps://doi.org/10.4995/thesis/10251/177347openalex-snapshot
Conflict-Free Networks on Chip for Real Time Systems
inferred← citeshttps://doi.org/10.5120/6128-8347openalex-snapshot
An Efficient Monarchic Reconfiguration Protocol with Deadlock Freedom on Interconnection Networks
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.