TABLE-DRIVEN ROUTING IN A DRAGONFLY PROCESSOR INTERCONNECT NETWORK

• US 20120144065A1
• Filed: 11/07/2011
• Published: 06/07/2012
• Est. Priority Date: 11/05/2010
• Status: Active Grant

• Current Assignee: Intel Corporation
• Original Assignee: CRAY Incorporated (Hewlett-Packard Enterprise Company)
• Inventors: Parker, Mike, Scott, Steve, Cheng, Albert, Alverson, Robert
• Granted Patent: US 9,282,037 B2
• Time in Patent Office: Days
• US Class Current: 709/241
• CPC Class Codes: G06F 15/17312 Routing techniques specific to parallel machines, e.g. wormhole, store and forward, shortest path problem congestion routing on a LAN H04L45/00
• CPC Class Codes: G06F 15/17362 hierarchical topologies
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/10 Routing in connection-oriented networks, e.g. X.25 or ATM
• CPC Class Codes: H04L 45/125 based on throughput or bandwidth
• CPC Class Codes: H04L 45/586 of virtual routers
• CPC Class Codes: H04L 45/745 Address table lookup; Address filtering

Abstract

A multiprocessor computer system comprises a dragonfly processor interconnect network that comprises a plurality of processor nodes and a plurality of routers. The routers are operable to route data by selecting from among a plurality of network paths from a target node to a destination node in the dragonfly network based on one or more routing tables.

Claims

1. A multiprocessor computer system including a dragonfly processor interconnect network, comprising:

at least one router operable to route data by selecting from among a plurality of network paths from a target node to a destination node in the dragonfly network based on one or more routing tables.

2. The multiprocessor computer system of claim 1, the routing tables comprising global and local routing tables.

3. The multiprocessor computer system of claim 2, wherein routing within a group comprises using one or more minimal or non-minimal local routing tables.

4. The multiprocessor computer system of claim 2, wherein routing between groups comprises using one or more minimal or non-minimal global routing tables.

5. The multiprocessor computer system of claim 1, the routing tables comprising minimal and non-minimal tables.

6. The multiprocessor computer system of claim 1, wherein the one or more routing tables are employed to provide adaptive routing between the target and destination nodes.

7. The multiprocessor computer system of claim 1, wherein adaptive routing comprises using one or more of network congestion information from neighboring routers and failed network link information from neighboring routers in selecting a route.

9. The method of operating a multiprocessor computer system of claim 1, the routing tables comprising global and local routing tables.

10. The method of operating a multiprocessor computer system of claim 9, wherein routing within a group comprises using one or more minimal or non-minimal local routing tables.

11. The method of operating a multiprocessor computer system of claim 9, wherein routing between groups comprises using one or more minimal or non-minimal global routing tables.

8. A method of operating a multiprocessor computer system, comprising:

routing data by selecting from among a plurality of network paths from a target node to a destination node in the dragonfly network based on one or more routing tables.

12. The method of operating a multiprocessor computer system of claim 8, the routing tables comprising minimal and non-minimal tables.

13. The method of operating a multiprocessor computer system of claim 8, wherein the one or more routing tables are employed to provide adaptive routing between the target and destination nodes.

14. The method of operating a multiprocessor computer system of claim 8, wherein adaptive routing comprises using one or more of network congestion information from neighboring routers and failed network link information from neighboring routers in selecting a route.

15. A multiprocessor computer system router, comprising:

one or more routing tables defining one or more network paths from a target node to a destination node in the dragonfly.

16. The multiprocessor computer system router of claim 15, the one or more routing tables comprising global and local routing tables.

17. The multiprocessor computer system router of claim 16, wherein routing within a group comprises using one or more minimal or non-minimal local routing tables.

18. The multiprocessor computer system router of claim 16, wherein routing between groups comprises using one or more minimal or non-minimal global routing tables.

19. The multiprocessor computer system router of claim 15, the one or more routing tables comprising minimal and non-minimal tables.

20. The multiprocessor computer system router of claim 15, wherein the one or more routing tables are employed to provide adaptive routing between the target and destination nodes.

21. The multiprocessor computer system router of claim 15, wherein adaptive routing comprises using one or more of network congestion information from neighboring routers and failed network link information from neighboring routers in selecting a route.