Wormhole routing algorithms for twisted cube networks

2002 ◽  
Author(s):  
P. Cull ◽  
S.M. Larson
Keyword(s):  
Routing Algorithms ◽  
Wormhole Routing ◽  
Twisted Cube

A comparison of adaptive wormhole routing algorithms

1993 ◽  
Vol 21 (2) ◽  
pp. 351-360 ◽  
Author(s):  
Rajendra V. Boppana ◽  
Suresh Chalasani
Keyword(s):  
Routing Algorithms ◽  
Wormhole Routing

COST-EFFECTIVE WORMHOLE ROUTING IN TORUS

2006 ◽  
Vol 07 (03) ◽  
pp. 375-389
Author(s):  
JINMING GE
Keyword(s):  
Cost Effective ◽  
Network Capacity ◽  
Routing Algorithms ◽  
Wormhole Routing ◽  
Chip Area ◽  
Asic Design ◽  
Hardware Overhead ◽  
High Level ◽  
Torus Networks ◽  
The Cost

The cost-effectiveness of wormhole torus-networks is systematically evaluated with emphasis on new buffered-wormhole routing algorithms. These algorithms use fixed datelines and escape channels to alleviate bottleneck and bubble problems caused by previous algorithms so as to improve the buffer efficiency with little hardware overhead. A two-part evaluation environment is developed consisting of a cycle-driven simulator for high-level measurements such as network capacity and an ASIC design package for low-level measurements such as operating frequency and chip area. This environment is used to demonstrate that the new routers are more cost-effective than their counterparts under various workload parameters.

Sign in / Sign up

Export Citation Format

Share Document