The Community for Technology Leaders
2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA) (1995)
Raleigh, North Carolina
Jan. 22, 1995 to Jan. 25, 1995
ISBN: 0-8186-6445-2
pp: 112
V. Varavithya , Dept. of Electr. Eng. & Comput. Eng., Iowa State Univ., Ames, IA, USA
P. Mohapatra , Dept. of Electr. Eng. & Comput. Eng., Iowa State Univ., Ames, IA, USA
J.H. Upadhyay , Dept. of Electr. Eng. & Comput. Eng., Iowa State Univ., Ames, IA, USA
ABSTRACT
In this paper, we present a new concept of region of adaptivity with respect to various routing algorithms in wormhole networks. Using this concept, we demonstrate that the previously proposed routing algorithms, though more adaptive, causes an uneven workload in the network which limits the performance improvement. A is observed that balanced distribution of traffic has greater impact on system performance than the adaptivity or efficiency of the algorithm. Based on these motivating factors, we have presented a new fully adaptive routing algorithm for 2-dimensional meshes using one extra virtual channel. The algorithm is more efficient in terms of the number of paths it offers between the source and the destination and also distributes the network load more evenly and symmetrically. The simulation results are presented and are compared with the results of previously proposed algorithms. It is shown that the proposed algorithm results in much better performance in terms of the average network latency and the throughput.
INDEX TERMS
telecommunication network routing; multiprocessor interconnection networks; performance evaluation; adaptive routing; two-dimensional meshes; routing algorithms; wormhole networks; uneven workload; performance; network latency; throughput
CITATION
V. Varavithya, P. Mohapatra, J.H. Upadhyay, "Efficient and balanced adaptive routing in two-dimensional meshes", 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA), vol. 00, no. , pp. 112, 1995, doi:10.1109/HPCA.1995.386550
88 ms
(Ver 3.3 (11022016))