Abstract
Even though the CM-5 data router employs randomization, some permutations can be routed more quickly than random permutations with the same bisection requirements. In this paper we describe a class of permutations called congestion-free permutations and show how they can be used to accomplish important communication problems including all-to-all personalized communication, hypercube dimension-exchange, block transfer, and others.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T.H. Cormen. Past permuting on disk arrays. In Brown/MIT VLSI Conference (1992)
W.J. Dally. Virtual-channel flow control. IEEE Transactions on Parallel and Distributed Systems (1992)
A. Edelman, S. Heller, and S.L. Johnsson. Index transformation algorithms in a linear algebra framework. Technical report, Thinking Machines Corporation (1992)
S. Heller. Reducing dynamic congestion in networks. Unpublished (1993)
S.L. Johnsson and C.T. Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Transactions on Computers (1989)
C.E. Leiserson. Fat-trees: Universal networks for hardware-efficient supercomputing. In IEEE Transactions on Computers (1985)
C.E. Leiserson, Z.S. Abuhamdeh, D.C. Douglas, C.R. Feynman, M.N. Ganmukhi, J.V. Hill, W.D. Hillis, B.C. Knszmaul, M.A. St. Pierre, D.S. Wells, M.C. Wong, S.W. Yang, and R. Zak. The Network Architecture of the Connection Machine CM-5. In Symposium on Parallel Algorithms and Architectures (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heller, S. (1994). Congestion-Free routing on the CM-5 data router. 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_36
Download citation
DOI: https://doi.org/10.1007/3-540-58429-3_36
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