发明名称 |
Switchless network topology system for parallel computation and method thereof |
摘要 |
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. |
申请公布号 |
US9584401(B2) |
申请公布日期 |
2017.02.28 |
申请号 |
US201514727999 |
申请日期 |
2015.06.02 |
申请人 |
National Cheng Kung University |
发明人 |
Huang Chi-Chuan;Liang Chi-Hsiu;Chen Yu-Tin |
分类号 |
H04L12/733;H04L12/947;H04L12/721 |
主分类号 |
H04L12/733 |
代理机构 |
Woodard, Emhardt, Moriarty, McNett & Henry, LLP |
代理人 |
Woodard, Emhardt, Moriarty, McNett & Henry, LLP ;Thomas Timothy |
主权项 |
1. A switchless network topology system for parallel computation, comprising:
a plurality of nodes, each node being one of a computing block on chip, a memory controller, a single core on chip, a processor, a storage hard drive, a computer, a group of internally optimized group of computers, and a computational center: wherein each node being configured to create a routing table by: calculating a shortest path of transmission paths between a starting node and a destination node of the nodes, wherein the shortest path has no relay node or has at least one relay node between the starting node and the destination node; removing the transmission path between the starting node and a first relay node of the shortest path, identifying another shortest path between the starting node and the destination node, and repeating the step of removing and identifying for the another shortest path 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. |
地址 |
Tainan TW |