Abstract
Recently, intensive research has been done to develop adaptive deadlock-free wormhole routing strategies for interconnection networks. One effective method is to partition the physical network into several virtual networks such that there is no channel dependency cycle in each of them even if full or partial adaptive routing strategies are used. However, each physical channel can be split into more virtual channels than the number necessary to set up the virtual networks. The additional virtual channels can be considered as one Resource Pool for all virtual networks. It means the packet which is blocked in one virtual network can borrow one free valid virtual channel from the Resource Pool, returning it to the Resource Pool when it is released. We call this scheme the grouping technique and have applied it to double-y adaptive routing on a 2D mesh network, producing a new fully adaptive routing algorithm called group-double-y. The simulation results show that with heavily loaded network it can double/(increase 26%) the average physical channel utilization under uniform/matrix-transpose traffic pattern. We have also applied the grouping technique in the Turn model on a 2D mesh network, producing a fully adaptive, minimum and nonminimum routing algorithm called group-turn-model. Compared with group-double-y, the simulation results show that with heavily loaded network the group-turn-model increases/decreases the average physical channel utilization by (12%)/(2%) under matrix-transpose/uniform traffic pattern.
Preview
Unable to display preview. Download preview PDF.
References
W.C. Athas, C.L. Seitz. “Multicomputers: Message-Passing Concurrent Computers”. IEEE Computer, Aug. 1988, PP. 9–24.
Suresh Chittor, Richard Enbody. “Performance Evaluation of Mesh-Connected Wormhole-Routed Networks for Interprocessor communication in Multicomputers”. Proc. Supercomputing, pp. 647–656, 1990.
W. J. Dally. “Network and Processor Architecture for Message-Driven Computers”. In Suaya and Birtwhistle, editors, VLSI and Parallel Computation. Morgan Kaufmann, 1990.
W. J. Dally and Hiromichi Aoki. “Adaptive Routing using Virtual Channels”, tech. rep., MIT, Laboratory for Computer Science, Sept. 1990.
W. J. Dally. “Virtual-Channel Flow Control”. IEEE Transactions on Parallel and Distributed Systems, Vol. 3, No. 2, pp. 194–205, March 1992.
W. J. Dally and C.L. Seitz. “Deadlock-free message routing in multiprocessor interconnection networks”. IEEE Trans. Computers, Vol. C-36, No. 5, pp. 547–553, May 1987.
José Duato. “On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: design methodologies”. In Proc. Parallel Architectures and Languages Europe 91.
José Duato. “Improving the Efficiency of Virtual Channels with Time-Dependent Selection Functions”. In Proc. Parallel Architectures and Languages Europe, pp. 635–650, 1992.
Christopher J. Glass and Lionel M. Ni. “The Turn Model for Adaptive Routing”. In Porc. 19th International Symposium on Computer Architecture, pp. 278–287. 1992.
C.R. Jesshope, P.R. Miller and J.T. Yantchev. “High Performance Communications in Processor Networks”. In Proc. 16th Int. Symp. Computer Architecture, pp. 150–157, 1989.
C.R. Jesshope, P.R. Miller and J.T. Yantchev. The Mad-Postman Network Chip. Proc. Transputing 91.
Ziqiang Liu and Handong Wu, “Performance Evaluation of Adaptive Wormhole Routing in 3D Mesh Networks”. In Proc. 26th Annual Simulation Symposium, 1993.
Daniel A. Reed and Richard M. Fujimoto. “Multicomputer Networks”. The MIT Press 1985 Scientific Computation Series.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, Z., Duato, J., Thorelli, L.E. (1993). Grouping virtual channels for deadlock-free adaptive wormhole routing. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_20
Download citation
DOI: https://doi.org/10.1007/3-540-56891-3_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56891-9
Online ISBN: 978-3-540-47779-2
eBook Packages: Springer Book Archive