Abstract
We study the issues of adaptive multicast wormhole routing in 2D mesh multicomputers. Three adaptive multicast wormhole routing strategies are proposed and studied, which include minimal partial adaptive, minimal fully adaptive and nonminimal multicast routing methods. All the algorithms are shown to be deadlock-free. These are the first deadlock-free adaptive multicast wormhole routing algorithms ever proposed. A simulation study has been conducted that compares the performance of these multicast algorithms. The results show that the minimal fully adaptive routing method creates the least traffic, however, double vertical channels are required in order to avoid deadlock. The nonminimal routing algorithm exhibits the best adaptivity, although it creates more network traffic than the other methods.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. K. McKinley, H. Xu, A.-H. Esfahanian, and L. M. Ni, “Unicast-based multicast communication in wormhole-routed networks,” in Proc. of the 1992 International Conference on Parallel Processing, vol. II, pp. 10–19, Aug. 1992.
L. M. Ni and P. K. McKinley, “A survey of wormhole routing techniques in direct networks,” IEEE Computer, vol. 26, no. 2, pp. 62–76, Feb. 1993.
C. R. Jesshope, P. R. Miller, and J. T. Yantchev, “High Performance Communications in Processor Networks,” in Proceedings of IEEE 16th Annual International Symposium on Computer Architecture, pp. 150–157, 1989.
D. H. Linder and J. C. Harden, “An adaptive and fault tolerant wormhole routing strategy for kary n-cubes,” IEEE Transactions on Computers, vol. 40, pp. 2–12, Jan. 1991.
C. J. Glass and L. M. Ni, “The turn model for adaptive routing,” in Proc. of the 19th Annual International Symposium on Computer Architecture, pp. 278–287, May 1992.
X. Lin, P. K. McKinley, and L. M. Ni, “Deadlock-free multicast wormhole routing in 2D mesh multicomputers.” accepted to appear in IEEE Transactions on Parallel and Distributed Systems.
Y. Lan, “Fault-tolerant multi-destination routing in hypercube multicomputers,” in Proceedings of the 12th International Conference on Distributed Computing Systems, pp. 632–639, June 1992.
W. J. Dally and C. L. Seitz, “Deadlock-free message routing in multiprocessor interconnection networks,” IEEE Transactions on Computers, vol. C-36, pp. 547–553, May 1987.
W. J. Dally and H. Aoki, “Adaptive routing using virtual channels,” tech. rep., Massachusetts Institute of Technology, Laboratory for Computer Science, Sept. 1990.
X. Lin, P. K. McKinley, and A.-H. Esfahanian, “Adaptive multicast wormhole routing in 2D mesh multicomputers,” tech. rep. MSU-CPS-ACS-77, Michigan State University, October 1992.
S. Konstantinidou and L. Snyder, “Chaos Router: Architecture and Performance,” in Proceedings of the 18th Annual Symposium on Computer Architecture, pp. 222–231, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, X., McKinley, P.K., Esfahanian, A.H. (1993). Adaptive multicast wormhole routing in 2D mesh multicomputer. 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_18
Download citation
DOI: https://doi.org/10.1007/3-540-56891-3_18
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