Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
316 viewed
Performance comparison of adaptive routing algorithms in the star interconnection network
Kiasari, A. E
Performance comparison of adaptive routing algorithms in the star interconnection network
Kiasari, A. E ; Sharif University of Technology | 2005
316
Viewed
- Type of Document: Article
- DOI: 10.1109/HPCASIA.2005.73
- Publisher: 2005
- Abstract:
- The star graph was introduced as an attractive alternative to the well-known hypercube and its properties have been well studied in the past. Most of these studies have focused on topological properties and algorithmic aspects of this network. In this paper, the performance of nine fully-adaptive routing algorithms in the star network are studied under uniform (with and without locality) and hotspot traffic patterns. The performance factors considered are the average message latency and network utilization. We consider three basic routing algorithms (two hop scheme routing algorithms: positive-hop and negative-hop, and Msic's routing algorithm) and two other improved sets of improved algorithms based on the basic algorithms. The improved algorithms are the result of applying simple modifications to the basic algorithms. Simulation results show that for uniform (with and without locality) and hotspot traffic (with a low hotspot portion) patterns, the first set of improved routing algorithms yields a better performance compared to the basic algorithms. The second set of improved routing algorithms outperforms the other two sets (the basic set and the first set of improved algorithms) under different working conditions. © 2005 IEEE
- Keywords:
- Computer networks ; Computer simulation ; Data structures ; Graph theory ; Routers ; Topology ; Network utilization ; Routing algorithms ; Star interconnection network ; Algorithms
- Source: 8th International Conference on High-Performance Computing in Asia-Pacific Region, HPC Asia 2005, Beijing, 30 November 2005 through 3 December 2005 ; Volume 2005 , 2005 , Pages 257-264 ; 0769524869 (ISBN); 9780769524863 (ISBN)
- URL: https://ieeexplore.ieee.org/document/1592277
