The Effect of Network Topology and Channel Labels on the Performance of Label-Based Routing Algorithms
Designing an efficient deadlock-free routing is a point of concern for irregular topologies. In this paper, we take a step toward the goal by developing three novel deadlock-free routing algorithms in the content of a new family of algorithms called label-based routing algorithms for irregular topologies. In addition, the newly proposed family covers three previously reported routing algorithms [2, 3]. Moreover, by simulating and comparing the newly and traditional proposed routing methods, it is shown that the performance of this family highly depends on the network topology and channel labeling process.
KeywordsLabel-based routing algorithm irregular network network of workstation performance evaluation
- 1.Moraveji, R., Sarbazi-azad, H.: A General Methodology of Routing in Irregular Networks. Technical Report, IPM School of Computer Science, Tehran, Iran (2007)Google Scholar
- 3.Koibuchi, M., Funahashi, A., Jouraku, A., Amano, H.: L-Turn Routing: An Adaptive Routing in Irregular Networks. In: International Parallel Processing Conference, pp. 383–392 (2001)Google Scholar
- 7.Duato, S.J., Yalamanchili, L.N.: Interconnection Networks: An Engineering Approach. IEEE Computer Society Press, Los Alamitos (2003)Google Scholar