Abstract
The Cray T3D uses a bidirectional, 3D torus interconnection network. Virtual channels are used both to prevent deadlock, and to improve network performance. This paper describes the Cray T3D network and introduces the concept of virtual channel balance. We show that balancing the traffic carried by each virtual channel can significantly improve network performance. We also discuss a technique, employing simulated annealing, for assigning virtual channels to routes in order to improve virtual channel balance.
Preview
Unable to display preview. Download preview PDF.
References
Adve, V. S. and M. K. Vernon, “Performance Analysis of Mesh Interconnection Networks with Deterministic Routing,” Transactions on Parallel and Distributed Systems, pp 225–246, March, 1994.
Bolding, K., “Non-Uniformities Introduced by Virtual Channel Deadlock Prevention,” Technical Report UW-CSE-92-07-07, University of Washington, Seattle, WA, July 12, 1992.
Cray Research, Inc., “The Cray T3D System Architecture Overview,” HR-04033, 1993.
Dally, W. J. and C. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Transactions on Computers, pp 547–553, May 1987.
Dally, W. J., “Virtual Channel Flow Control,” Proc. 17th International Symposium on Computer Architecture, pp 60–68, May 1990.
Kirkpatrick, S., C. D. Gellatt, Jr. and M. P. Vecchi, “Optimization by Simulated Annealing,” Science, pp 671–670, Vol 220, No 4598, May 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scott, S., Thorson, G. (1994). Optimized routing in the Cray T3D. 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_44
Download citation
DOI: https://doi.org/10.1007/3-540-58429-3_44
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