Abstract
Scalable multicomputer are based upon interconnection networks that typically provide multiple communication routes between any given pair of processor nodes. Routes must be selected for communication so that the load is distributed evenly among the links and switches to prevent congestion in the network. We describe the route selection algorithm used in the IBM 9076 SP1 multicomputer. We then describe a new algorithm for reducing network congestion and compare the two 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
C. B. Stunkel, D. G. Shea, B. Abali, M. M. Denneau, P. H. Hochschild, D. J. Joseph, B. J. Nathanson, M. Tsao, and P. R. Varker, “Architecture and Implementation of Vulcan,” in Proc. Int. Parallel Processing Symp., pp. 268–274, April 1994. An extended version is also available as Research Report RC19492 from the IBM T.J. Watson Research Center.
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.
P. Kermani and L. Kleinrock, “Virtual Cut-Through: A new computer communications switching technique,” Computer Networks, vol. 3, pp. 267–286, September 1979.
A. S. Tanenbaum, Computer Networks. Englewood Cliffs, NJ: Prentice-Hall, 1981.
D. H. Lawrie, “Access and alignment of data in an array processor,” IEEE Transactions on Computers, vol. C-24, pp. 1145–1155, December 1975.
M. C. Pease, “The indirect binary n-cube microprocessor array,” IEEE Transactions on Computers, vol. C-26, pp. 458–473, May 1977.
S. A. Felperin, L. Gravano, G. D. Pifarre, and J. L. C. Sanz, “Routing Techniques for Massively Parallel Communication,” Proceedings of the IEEE, vol. 79, pp. 488–503, April 1991.
T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. NY: McGraw-Hill, 1990.
R. V. Boppana and S. Chalasani, “A Comparison of Adaptive Warmhole Routing Algorithms,” in Proceedings of the 20th Ann. Int. Symp. on Computer Architecture, pp. 351–360, May 1993.
T. Bultan and C. Aykanat, “A New Mapping Heuristic Based on Mean Field Annealing,” J. Parallel and Distributed Comput., vol. 16, pp. 292–305, 1992.
C. Aykanat, F. Ozguner, P. Ercal, and P. Sadayappan, “Iterative Algorithms for Solution of Large Sparse Systems of Linear Equations on Hypercubes,” IEEE Trans. Comput, vol. 37, no. 12, pp. 1554–1567, 1988.
D. D. Kandlur and K. G. Shin, “Traffic Routing for Multicomputer Networks with Virtual Cut-Through Capability,” IEEE Transactions on Computers, vol. 41, pp. 1257–1270, October 1992.
B. Abali, F. Ozguner, and A. Bataineh, “Balanced Parallel Sort on Hypercube Multiprocessors,” IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 572–581, May 1993.
B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell System Tech. J., vol. 49, pp. 291–307, 1970.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abali, B., Aykanat, C. (1994). Routing algorithms for IBM SP1. 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_35
Download citation
DOI: https://doi.org/10.1007/3-540-58429-3_35
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