Efficient collective data distribution in all-port wormhole-routed hypercubes
- Michigan State Univ., East Lansing, MI (United States). Dept. of Computer Science
This paper addresses the problem of collective data distribution, specifically multicast, in wormhole-routed hypercubes. The system model allows a processor to send and receive data in all dimensions simultaneously. New theoretical results that characterize contention among messages in wormhole-routed hypercubes are developed and used to design new multicast routing algorithms. The algorithms are compared in terms of the number of steps required in each, their measured execution times when implemented on a relatively small-scale nCUBE-2, and their simulated execution times on larger hypercubes. The results indicate that significant performance improvement is possible when the multicast algorithm actively identifies and uses multiple ports in parallel.
- DOE Contract Number:
- FG02-93ER25167
- OSTI ID:
- 46273
- Report Number(s):
- CONF-931115--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Distributed multi-destination routing in hypercube multiprocessors
Optimal software multicast in wormhole-routed multistage networks