Skip to search formSkip to main contentSkip to account menu

Wormhole switching

Known as: Wormhole (disambiguation), Wormhole flow control, Wormhole routing 
Wormhole flow control, also called wormhole switching or wormhole routing is a system of simple flow control in computer networking based on known… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
16-bit8-bitCentral processing unitConnection Machine

Broader (3)

Flow control (data)Network on a chipRouting

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Noncommutative wormholes and the energy conditions
It is a very well known fact that the energy conditions concerning Lorentzian wormhole (WH) solutions of Einstein equations are… 
2004
2004
Eligibility-based Round Robin for fair and efficient packet scheduling in wormhole switching networks
Interconnection networks of parallel systems are used for servicing traffic generated by different applications, often belonging… 
2000
2000
Fault-Tolerant Multicast Wormhole Routing in 2D Meshes
1998
1998
Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-Cube Systems
This paper identifies performance degradation in wormhole routed k-ary n-cube networks due to limited number of router-to… 
1997
1997
Performance analysis of minimal adaptive wormhole routing with time-dependent deadlock recovery
Deadlock recovery as a viable alternative to deadlock avoidance has recently gained an increasing consideration in the scientific… 
1995
1995
Optimal Fully Adaptive Minimal Wormhole Routing for Meshes
Abstract A deadlock-free fully adaptive minimal routing algorithm for meshes that is optimal in the number of virtual channels… 
1993
1993
MultiSim: A Simulation Tool for the Study of Large-Scale Multiprocessors
This paper describes a CSIM-based simulation tool, called MultiSim, which allows eecient simulation of large-scale mul… 
1993
1993
Adaptive and Fault-Tolerant Wormhole Routing in Hpyercube Network
Highly Cited
1993
Highly Cited
1993
Optimal fully adaptive wormhole routing for meshes
A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of virtual channels required and in… 
1991
1991
Parallel I/O subsystems for distributed-memory multicomputers
The authors study the improvement in performance obtained in distributed memory machines through the use of a separate network… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)