Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network
A computer implemented method and a system for routing data packets in a multi-dimensional computer network. The method comprises routing a data packet among nodes along one dimension towards a root node, each node having input and output communication links, said root node not having any outgoing uplinks, and determining at each node if the data packet has reached a predefined coordinate for the dimension or an edge of the subrectangle for the dimension, and if the data packet has reached the predefined coordinate for the dimension or the edge of the subrectangle for the dimension, determining if the data packet has reached the root node, and if the data packet has not reached the root node, routing the data packet among nodes along another dimension towards the root node.
- Research Organization:
- International Business Machines Corp., Armonk, NY (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- B554331
- Assignee:
- International Business Machines Corporation (Armonk, NY)
- Patent Number(s):
- 8,364,844
- Application Number:
- 12/697,015
- OSTI ID:
- 1082652
- Resource Relation:
- Patent File Date: 2010 Jan 29
- Country of Publication:
- United States
- Language:
- English
Collectively loading programs in a multiple program multiple data environment
|
patent | November 2016 |
Similar Records
I/O routing in a multidimensional torus network
I/O routing in a multidimensional torus network