Abstract
Recursive Diagonal Torus, or RDT consisting of recursively structured tori is an interconnection network for massively parallel computers. By adding remote links to the diagonal directions of the torus network recursively, the diameter can be reduced within log 2N with smaller number of links than that of hypercube. For a a n interconnection network for massively parallel computers, a routing algorithm which can bypass a faulty or congested node are essential. Although the conventional vector routing is a simple and near-optimal method, it can only use a deterministic path. In this paper, adaptive routing algorithms on RDT are proposed and discussed. The first algorithm is based on Duato's necessary and sufficient condition. With this method virtual channels are effectively used while paths with redundant routing steps are prohibited. Another algorithm based on the turn model is proposed. By prohibiting certain turns on RDT, it permits paths with additional hops. Both algorithms are proved to be deadlock free.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Paragon XPIS Product Overview. Intel Corp., 1991.
W. J. Dally A. Chien S. Fiske W. Horwat J. Kenn M. Larivee R. Lethin P. Nuth and S. Wills. The.I-machine: A Fine-Grain Concurrent Computer. In IFIP 11th Computer Congress, pages 1147–1153, August 1989.
H. Ishihata T. Horie S. Inano T. Shimizu S. Kato and M. Ikesaka. Third Generation Message Passing Computer AP1000. In International Symposium on Supercomputing, pages 46–55, November 1991.
Y. Yang, H. Amano, H. Shibamura, and T. Sueyoshi. Recursive diagonal torus: An interconnection network for massively parallel computers. Proceedings of IEEE SPDP, 1993.
H. Nishi, K. Nishimura, K. Anjo, H. Amano, and T. Kudoh. The JUMP-1 router chip: The versatile router for supporting distributed shared memory. Proceedings of International Phoenix conference on computers and communications, 1996.
Y. Yang and H. Amano. Message Transfer Algorithms on the RDT. IEICE Transaction on Information and Systems, 79(2), 1996.
L. M. Ni and P. K. McKinley. A Survey of Wormhole Routing Techniques in Direct Networks. IEEE Transactions on Computers, February 1993.
J. Duato. A Necessary And Sufficient Condition For Deadlock-Free Adaptive Routing In Wormhole Networks. Proceedings of the International Conference on Parallel Processing, 1:142–149, 1994.
J. Duato. A Necessary And Sufficient Condition For Deadlock-Free Adaptive Routing In Wormhole Networks. IEEE Transaction on Parallel and Distributed Systems, 6(10), 1995.
W. J. Dally and C. L. Seitz. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks. IEEE Transactions on Computers, 36(5):547–553, May 1987.
C. J. Glass and L. M. Ni. Maximally Fully Adaptive Routing in 2D Meshes. Proceedings of ISCA92, pages 278–287, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Funahashi, A., Hanawa, T., Kudoh, T., Amano, H. (1997). Adaptive routing on the Recursive Diagonal Torus. In: Polychronopoulos, C., Joe, K., Araki, K., Amamiya, M. (eds) High Performance Computing. ISHPC 1997. Lecture Notes in Computer Science, vol 1336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024214
Download citation
DOI: https://doi.org/10.1007/BFb0024214
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63766-0
Online ISBN: 978-3-540-69644-5
eBook Packages: Springer Book Archive