Structured communication in torus networks
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 584-593 vol.2
- https://doi.org/10.1109/hicss.1995.375498
Abstract
Studies one-to-all and all-to-all data movement patterns on cycles, tori, and multi-dimensional tori that use synchronous circuit-switched routing with virtual channels. The data movement patterns that we study are broadcasting, scattering, gossiping and multi-scattering. We present new circuit-switching algorithms for all of these patterns for cycles, two-dimensional tori and multi-dimensional tori. We compare our new algorithms to the best known store-and-forward algorithms and lower bounds. In most cases, we conclude that circuit-switched routing is best when messages are "short" and store-and-forward routing is best for long messages. Surprisingly, a few of our new circuit-switching algorithms outperform all known store-and-forward algorithms for all message lengths.Keywords
This publication has 12 references indexed in Scilit:
- Efficient All-to-All Communication Patterns in Hypercube and Mesh TopologiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Methods and problems of communication in usual networksDiscrete Applied Mathematics, 1994
- A survey of wormhole routing techniques in direct networksComputer, 1993
- Performance analysis of k-ary n-cube interconnection networksIEEE Transactions on Computers, 1990
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- Data communication in parallel architecturesParallel Computing, 1989
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987
- Minimum‐time line broadcast networksNetworks, 1980
- New gossips and telephonesDiscrete Mathematics, 1975