Wormhole switching has been widely applied to the interconnection networks of parallel systems as well as System Area Networks, and Local Area Networks, largely because of its efficiency and performance merits. Examples include the Myrinet of Myricom Inc as well as most of the newly developed parallel systems. True Fully Adaptive Routing (TFAR) Algorithms have demonstrated their suitability for wormhole switched networks due to their unrestricted Adaptivity and moderate resource requirements. Wormhole switching has proven to be the most popular switching technique targeted for interconnection networks of message-passing multicomputers as well as SANs, and LANs. TFAR Algorithms have also been gaining favor for application in wormhole switched networks due to their highly adaptive and moderate hardware requirements. Wormhole switched networks have associated drawbacks however, as they generally suffer from performance degradation beyond the saturation point due to channel congestion. Fully adaptive algorithms are vulnerable to cyclic dependencies, which are precursors to deadlock formations. Consequently the frequent occurrence of deadlocks can further degrade the performance and stability characteristics of these networks. Injection limitation techniques were recently introduced in an attempt to countermeasure these drawbacks and effectively contain their impact on the performance of the network. This paper proposes a new injection limitation mechanism and its performance evaluation. The new mechanism is named Congestion Level Injection Control (CLIC). This mechanism attempts to provide a solution for these problems and improve the overall performance of the network. The new mechanism is centered on congestion level estimation in the network using only local information at each node. The mechanism subsequently prevents the injection of new packets if the network is deemed to be highly congested or possibly close to its saturation point. The performance of the CLIC mechanism has been compared with other competing schemes. Our results have shown that CLIC has superior performance when compared to other competing schemes.
[1]
Lionel M. Ni,et al.
A survey of wormhole routing techniques in direct networks
,
1993,
Computer.
[2]
Pedro López,et al.
DRIL: dynamically reduced message injection limitation mechanism for wormhole networks
,
1998,
Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).
[3]
Pedro López,et al.
On the Reduction of Deadlock Frequency by Limiting Message Injection in Wormhole Networks
,
1997,
PCRCW.
[4]
William J. Dally,et al.
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
,
1987,
IEEE Transactions on Computers.
[5]
José Duato.
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks
,
1995,
IEEE Trans. Parallel Distributed Syst..
[6]
Z.H. Al-Awwami,et al.
A new deadlock recovery mechanism for fully adaptive routing algorithms
,
2000,
Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086).
[7]
Pedro López,et al.
LIFE: a limited injection, fully adaptive, recovery-based routing algorithm
,
1997,
Proceedings Fourth International Conference on High-Performance Computing.
[8]
Timothy Mark Pinkston,et al.
Characterization of deadlocks in interconnection networks
,
1997,
Proceedings 11th International Parallel Processing Symposium.
[9]
Fabrizio Petrini,et al.
Minimal adaptive routing with limited injection on Toroidal k-ary n-cubes
,
1996,
Supercomputing '96.
[10]
Sudhakar Yalamanchili,et al.
Interconnection Networks: An Engineering Approach
,
2002
.
[11]
Pedro López,et al.
Deadlock-Free Adaptive Routing Algorithms for the 3D-Torus: Limitations and Solutions
,
1993,
PARLE.
[12]
A. A. Chein,et al.
A cost and speed model for k-ary n-cube wormhole routers
,
1998
.
[13]
Ranga Vemuri,et al.
An integrated multicomponent synthesis environment for MCMs
,
1993,
Computer.