Relay approach message routing in hypercube multiprocessors
Conference
·
OSTI ID:5114040
A relay approach message routing for hypercube multiprocessors is proposed which is able to forward a received message immediately after the address fields of the message are received if the outgoing channels are not blocked. The relay message routing can significantly reduce the communication latency compared with the store-and-forward message routing. Based on the relay approach, a distributed routing mechanism which is able to handle unicast, multicast, and broadcast interprocessor communications is proposed. These three types of interprocessor communication are modeled as an Optimal Multicast Tree problem which can guarantee a minimum message delivery time. Network traffic is minimized for the cases of unicast and broadcast and close to minimum for the case of multicast. A hardware router design based on the proposed distributed relay routing is discussed.
- Research Organization:
- Michigan State Univ., East Lansing (USA). Dept. of Computer Science; Argonne National Lab., IL (USA)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 5114040
- Report Number(s):
- CONF-880567-6; ON: DE88009973
- Country of Publication:
- United States
- Language:
- English
Similar Records
Distributed multi-destination routing in hypercube multiprocessors
Optimal multicast communication in wormhole-routed torus networks
Hierarchical gate-array routing on a hypercube multiprocessor
Conference
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:6688679
Optimal multicast communication in wormhole-routed torus networks
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:98894
Hierarchical gate-array routing on a hypercube multiprocessor
Journal Article
·
Sat Mar 31 23:00:00 EST 1990
· Journal of Parallel and Distributed Computing; (USA)
·
OSTI ID:6779338