IP Library Granted Patent US 9,514,092
Granted Patent B2
US 9,514,092 · App. 13/873,058 · Granted Dec 6, 2016

Network topology for a scalable multiprocessor system

Inventors: Martin M. Deneroff (New York, NY); Gregory M. Thorson (Altoona, WI); Randal S. Passint (Chippewa Falls, WI)
Assignee: Silicon Graphics International Corp.
G06F15/17312G06F15/17343G06F15/17381
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,514,092
App. No.
13/873,058
Granted
Dec 6, 2016
Kind
B2
Abstract

A system and method for interconnecting a plurality of processing element nodes within a scalable multiprocessor system is provided. Each processing element node includes at least one processor and memory. A scalable interconnect network includes physical communication links interconnecting the processing element nodes in a cluster. A first set of routers in the scalable interconnect network route messages between the plurality of processing element nodes. One or more metarouters in the scalable interconnect network route messages between the first set of routers so that each one of the routers in a first cluster is connected to all other clusters through one or more metarouters.

Claims (29)

1. A parallel processing system, comprising:

a plurality of clusters, including at least a first cluster, a second cluster, and a third cluster, wherein each cluster of the plurality of clusters includes:

a plurality of processing element nodes, each of the plurality of nodes including at least one processor, and

a first set of routers for interconnecting the plurality of processing element nodes in each cluster of the plurality of clusters; and

a second set of routers for interconnecting each of the clusters of the plurality of clusters, wherein:

a first message from a node in the first cluster is routed to the third cluster through a router of the second set of routers without being routed to the second cluster when the first message addresses a node in the third cluster,

a second message from a node of the plurality of nodes in the second cluster is routed to the third cluster through the router or through another router of the second set of routers without being routed through the first cluster when the second message addresses the node or another node in the third cluster.

2. The parallel processing system of claim 1 , wherein a router in each of the plurality of clusters has a direct connection to a router in at least one other cluster in the plurality of clusters.

3. The parallel processing system of claim 1 , wherein a router of the first set of routers in each of the plurality of clusters is connected via a router in the second set of routers to a router in at least one other cluster of the plurality of clusters.

4. The parallel processing system of claim 1 , wherein each of the clusters is a two-dimensional hypercube.

5. The parallel processing system of claim 1 , wherein each of the clusters is a three-dimensional hypercube.

6. The parallel processing system of claim 1 , wherein each router in the second set of routers is an eight port router.

7. The parallel processing system of claim 1 , wherein each router in the second set of routers is a four port router.

8. The parallel processing system of claim 1 , wherein the plurality of processing element nodes include four processors.

9. The parallel processing system of claim 1 , wherein the plurality of clusters and second set of routers form a scalable network, wherein the clusters include n-dimensional hypercube that remain intact as additional processing elements nodes are added to the scalable network.

10. A method for providing parallel processing in a plurality of clusters including at least a first cluster, a second cluster, and a third cluster, wherein each cluster of the plurality of clusters includes a plurality of processing element nodes and a first set of routers, the method comprising:

interconnecting a plurality of nodes in each cluster of the plurality of clusters by way of the first set of routers;

interconnecting each of the clusters of the plurality of clusters by way of the second set of routers; and

connecting each of the plurality of clusters, such that each of the plurality of nodes in each respective cluster of the plurality of clusters are connected through a router of the first set of routers in each respective cluster, and each of the clusters of the plurality of clusters are connected by at least one router of the second set of routers,

routing a first message from a node in the first cluster to the third cluster through a router of the second set of routers without being routed to the second cluster when the first message addresses a node in the third cluster,

routing a second message from a node of the plurality of nodes in the second cluster to the third cluster through the router or through another router of the second set of routers without being routed through the first cluster when the second message addresses the node or another node in the third cluster.

11. The method of claim 10 , further comprising establishing a direct connection by a router in each of the plurality of clusters to a router in at least one other cluster of the plurality of clusters.

12. The method of claim 10 , wherein at least one router of the first set of routers in each of the plurality of clusters is connected to a router in each of the other clusters of the plurality of clusters via a router in the second set of routers.

13. The method of claim 10 , further comprising wherein each of the clusters is a two dimensional hypercube.

14. The method of claim 10 , further comprising wherein each of the clusters is a three dimensional hypercube.

15. The method of claim 10 , further comprising adding additional processing elements nodes to a scalable network, wherein the plurality of clusters and second set of routers form the scalable network, wherein the clusters include n-dimensional hypercube that remain intact as the additional processing elements nodes are added to the scalable network.

16. The method of claim 10 , wherein each router in the second set of routers is an eight port router.

17. The method of claim 10 , wherein each router in the second set of routers is a four port router.

18. The method of claim 10 , wherein the plurality of processing element nodes include four processors.

Assignments (10)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 4, 2017
From: SILICON GRAPHICS INTERNATIONAL CORP.
To: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Reel/Frame 044128/0149 →
RELEASE OF SECURITY INTEREST Recorded Nov 2, 2016
From: MORGAN STANLEY SENIOR FUNDING, INC., AS AGENT
To: SILICON GRAPHICS INTERNATIONAL CORP.
Reel/Frame 040545/0362 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 21, 2016
From: SILICON GRAPHICS, INC
To: SILICON GRAPHICS INTERNATIONAL, INC.
Reel/Frame 040459/0026 →
CHANGE OF NAME Recorded Oct 21, 2016
From: SILICON GRAPHICS INTERNATIONAL, INC.
To: SGI INTERNATIONAL, INC.
Reel/Frame 040459/0157 →
MERGER Recorded Oct 21, 2016
From: SGI INTERNATIONAL, INC.
To: SILICON GRAPHICS INTERNATIONAL CORP.
Reel/Frame 040459/0518 →
SECURITY INTEREST Recorded Mar 13, 2015
From: SILICON GRAPHICS INTERNATIONAL CORP.
To: MORGAN STANLEY SENIOR FUNDING, INC.
Reel/Frame 035200/0722 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 16, 2014
From: SILICON GRAPHICS, INC.
To: SILICON GRAPHICS INTERNATIONAL, INC.
Reel/Frame 032692/0491 →
MERGER Recorded Apr 16, 2014
From: SGI INTERNATIONAL, INC.
To: SILICON GRAPHICS INTERNATIONAL CORP.
Reel/Frame 032692/0663 →
CHANGE OF NAME Recorded Apr 16, 2014
From: SILICON GRAPHICS INTERNATIONAL, INC.
To: SGI INTERNATIONAL, INC.
Reel/Frame 032706/0679 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 2, 2014
From: DENEROFF, MARTIN M.; THORSON, GREGORY M.; PASSINT, RANDAL S.
To: SILICON GRAPHICS, INC.
Reel/Frame 031876/0142 →
Continuity (4)
Continuation 12121941 · May 16, 2008
Continuation 11295676 · Dec 6, 2005
Continuation 09408972 · Sep 29, 1999
Related Publication 20130246653A1 · Sep 19, 2013