Congestion-Free routing on the CM-5 data router
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.
Unable to display preview. Download preview PDF.
- 1.T.H. Cormen. Past permuting on disk arrays. In Brown/MIT VLSI Conference (1992)Google Scholar
- 2.W.J. Dally. Virtual-channel flow control. IEEE Transactions on Parallel and Distributed Systems (1992)Google Scholar
- 3.A. Edelman, S. Heller, and S.L. Johnsson. Index transformation algorithms in a linear algebra framework. Technical report, Thinking Machines Corporation (1992)Google Scholar
- 4.S. Heller. Reducing dynamic congestion in networks. Unpublished (1993)Google Scholar
- 5.S.L. Johnsson and C.T. Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Transactions on Computers (1989)Google Scholar
- 6.C.E. Leiserson. Fat-trees: Universal networks for hardware-efficient supercomputing. In IEEE Transactions on Computers (1985)Google Scholar
- 7.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)Google Scholar