Dynamic communication performance enhancement in hierarchical torus network by selection algorithm
A Hierarchical Torus Network (HTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 3D-torus networks that are hierarchically interconnected for higher-level networks. The static network performance of the HTN and its dynamic communication performance using the determi...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Academy Publisher
2012
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/12120/ http://irep.iium.edu.my/12120/ http://irep.iium.edu.my/12120/1/Dynamic_Communication_Performance_Enhancement_in_Hierarchical.pdf |
| Summary: | A Hierarchical Torus Network (HTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 3D-torus networks that are hierarchically interconnected for higher-level networks. The static network performance of the HTN and its dynamic communication performance using the deterministic, dimension-order routing algorithm have already been evaluated and shown to be superior to the performance of other conventional and hierarchical interconnection networks. However, the assessment of the dynamic communication performance improvement of HTN by the efficient use of both the physical link and virtual channels has not yet been evaluated. This paper addresses three adaptive routing algorithms -- link-selection, channel-selection, and a combination of link-selection and channel-selection -- for the efficient use of physical links and virtual channels of an HTN to enhance dynamic communication performance. It also proves that the proposed adaptive routing algorithms are deadlock-free with 3 virtual channels. The dynamic communication performances of an HTN is evaluated by using dimension-order routing and proposed adaptive routing algorithms under various traffic patterns. It is found that the dynamic communication performance of an HTN using these adaptive routing algorithms are better than when the dimension-order routing is used, in terms of network throughput. |
|---|