Abstract
Two classes of adaptive routers, minimal and non-minimal, are emerging as possible replacements for the oblivious routers used in current multicomputer networks. In this paper, we compare the simulated performance of three routers, an oblivious, a minimal, and a non-minimal adaptive router, in a two-dimensional packet switching torus network. The non-minimal adaptive router is shown to give the best performance and the oblivious router the worst. Significantly, however, for many traffic patterns, the minimal adaptive router's performance degrades sharply as the network saturates. Based on an analysis made using several visualization tools, we argue that this performance drop results from nonuniformities introduced for deadlock prevention. Furthermore, this analysis has led us to believe that network balance is an important performance characteristic that has been largely overlooked by designers of adaptive routing algorithms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Berman, L. Gravano, G. Pifarré, and J. Sanz. Adaptive deadlock-and livelock-free routing with all minimal paths in torus networks. In Proceedings of the Symposium on Parallel Algorithms and Architectures, 1992.
K. Bolding, S.-C. Cheung, S.-E. Choi, C. Ebeling, S. Hassoun, T. A. Ngo, and R. Wille. The chaos router chip: Design and implementation of an adaptive router. In Proceedings of VLSI '93, Sept. 1993.
K. Bolding and L. Snyder. Mesh and torus chaotic routing. In Proceedings of the Advanced Research in VLSI and Parallel Systems Conference, Mar. 1992.
R. V. Boppana and S. Chalasani. A comparison of adaptive wormhole routing algorithms. In Proceedings of the International Symposium on Computer Architecture, May 1993.
R. Cypher and L. Gravano. Adaptive, deadlock-free packet routing in torus networks with minimal storage. In International Conference on Parallel Processing, 1992.
W. Dally and C. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5):547–553, May 1987.
W. J. Dally and H. Aoki. Deadlock-free adaptive routing in multicomputer networks using virtual channels. IEEE Transactions on Parallel and Distributed Systems, 1992.
S. A. Felperin, L. Gravano, G. D. Pifarré, and J. L. C. Sanz. Fully-adaptive routing: Packet switching performance and wormhole algorithms. In Supercomputing '91 Proceedings, Nov. 1991.
M. L. Fulgham and L. Snyder. Performance of chaos and oblivious routers under nonuniform traffic. Technical Report 93-06-01, Department of Computer Science and Engineering, University of Washington, June 1993.
P. Kermani and L. Kleinrock. Virtual cut-through: A new computer communication switching technique. Computer Networks, 3:267–286, 1979.
S. Konstantinidou and L. Snyder. Chaos router: Architecture and performance. In Proceedings of the 18th International Symposium on Computer Architecture, pages 212–221, May 1991.
J. Y. Ngai and C. L. Seitz. A framework for adaptive routing in multicomputer networks. In Proceedings of the Symposium on Parallel Algorithms and Architechtures, pages 1–9, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, T.D., Snyder, L. (1994). Performance analysis of a minimal adaptive router. In: Bolding, K., Snyder, L. (eds) Parallel Computer Routing and Communication. PCRCW 1994. Lecture Notes in Computer Science, vol 853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58429-3_26
Download citation
DOI: https://doi.org/10.1007/3-540-58429-3_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58429-2
Online ISBN: 978-3-540-48787-6
eBook Packages: Springer Book Archive