Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network
Abstract
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.
- Inventors:
- Issue Date:
- Research Org.:
- International Business Machines Corp., Armonk, NY (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 1082652
- Patent Number(s):
- 8,364,844
- Application Number:
- 12/697,015
- Assignee:
- International Business Machines Corporation (Armonk, NY)
- DOE Contract Number:
- B554331
- Resource Type:
- Patent
- Resource Relation:
- Patent File Date: 2010 Jan 29
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING
Citation Formats
Chen, Dong, Eisley, Noel A., Steinmacher-Burow, Burkhard, and Heidelberger, Philip. Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network. United States: N. p., 2013.
Web.
Chen, Dong, Eisley, Noel A., Steinmacher-Burow, Burkhard, & Heidelberger, Philip. Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network. United States.
Chen, Dong, Eisley, Noel A., Steinmacher-Burow, Burkhard, and Heidelberger, Philip. Tue .
"Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network". United States. https://www.osti.gov/servlets/purl/1082652.
@article{osti_1082652,
title = {Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network},
author = {Chen, Dong and Eisley, Noel A. and Steinmacher-Burow, Burkhard and Heidelberger, Philip},
abstractNote = {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.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2013},
month = {1}
}
Works referenced in this record:
A general theory for deadlock-free adaptive routing using a mixed set of resources
journal, January 2001
- Duato, J.; Pinkston, T. M.
- IEEE Transactions on Parallel and Distributed Systems, Vol. 12, Issue 12