All-to-all communication on meshes with wormhole routing
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 561-565
- https://doi.org/10.1109/ipps.1994.288248
Abstract
Describes several algorithms to perform all-to-all communication on a two-dimensional mesh connected computer with wormhole routing. The authors discuss both direct algorithms, in which data is sent directly from source to destination processor, and indirect algorithms in which data is sent through one or more intermediate processors. The authors propose algorithms for both power-of-two and non power-of-two meshes as well as an algorithm which works for any arbitrary mesh. They have developed analytical models to estimate the performance of the algorithms on the basis of system parameters. Performance results obtained on the Intel Touchstone Delta are compared with the estimated values.<>Keywords
This publication has 5 references indexed in Scilit:
- Efficient All-to-All Communication Patterns in Hypercube and Mesh TopologiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Complete exchange on a circuit switched meshPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Scheduling regular and irregular communication patterns on the CM-5Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Global combine on mesh architectures with wormhole routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A survey of wormhole routing techniques in direct networksComputer, 1993