### Abstract

Original language | English |
---|---|

Patent number | 9584401 |

Publication status | Published - 2015 Dec 3 |

### Fingerprint

### Cite this

*9584401*).

}

*SWITCHLESS NETWORK TOPOLOGY SYSTEM FOR PARALLEL COMPUTATION AND METHOD THEREOF*, Patent No. 9584401.

**SWITCHLESS NETWORK TOPOLOGY SYSTEM FOR PARALLEL COMPUTATION AND METHOD THEREOF.** / Hwang, Chi-Chuan (Inventor).

Research output: Patent

TY - PAT

T1 - SWITCHLESS NETWORK TOPOLOGY SYSTEM FOR PARALLEL COMPUTATION AND METHOD THEREOF

AU - Hwang, Chi-Chuan

PY - 2015/12/3

Y1 - 2015/12/3

N2 - A switchless network topology system for parallel computation is provided. The switchless network topology system includes a plurality of nodes, of which one node communicates with another node according to a routing table, where the creation of the routing table includes the following steps: calculating a shortest path of transmission paths between two nodes of the nodes, where the shortest path has no relay node or at least one relay node between the two nodes; removing the transmission path between a starting node and a first relay node of the shortest path and identifying another shortest path between the starting node and the destination node; repeating the step of removing and identifying to identify other shortest paths between the starting node and the destination node; and creating the routing table based on every shortest path between any starting node and any destination node of the nodes.

AB - A switchless network topology system for parallel computation is provided. The switchless network topology system includes a plurality of nodes, of which one node communicates with another node according to a routing table, where the creation of the routing table includes the following steps: calculating a shortest path of transmission paths between two nodes of the nodes, where the shortest path has no relay node or at least one relay node between the two nodes; removing the transmission path between a starting node and a first relay node of the shortest path and identifying another shortest path between the starting node and the destination node; repeating the step of removing and identifying to identify other shortest paths between the starting node and the destination node; and creating the routing table based on every shortest path between any starting node and any destination node of the nodes.

M3 - Patent

M1 - 9584401

ER -