Hierarchical fat hypercube architecture for parallel processing systems
AssigneeSilicon Graphics, Inc.
InventorsMichael B. Galles, Daniel E. Lenoski
Life of this patent
Estimating the term…
Abstract
A hierarchical fat hypercube topology provides an infrastructure for implementing a multi-processor system at a plurality of levels. A first level is comprised of a plurality of n-dimensional hypercubes. This plurality of n-dimensional hypercubes is interconnected at a second level utilizing an m-dimensional metacube. The number of dimensions at each level and the number of bristles at each level can be customized depending on the requirements of the application. Additionally, routers can be implemented such that the system can be expanded to meet increasing system requirements. This is particularly useful at the second level of the hierarchical topology.
Claims16
A hierarchical fat hypercube topology for a multi-processor network, comprising:
- a first level comprising a plurality of n-dimensional hypercubes, each said n-dimensional hypercube comprising 2.sup.n first-level nodes;
- and
- a second level comprising a p-dimensional metacube, wherein said metacube comprises 2.sup.p second-level nodes, said one or more second-level nodes each comprising 2 routers for interconnecting said first-level nodes of said first-level n-dimensional hypercubes;
- wherein each said n-dimensional hypercube of said first level is connected to a corresponding second-level node of said metacube via 2.sup.n edges:
- wherein said 2.sup.n routers are not connected together with edges.
A hierarchical fat hypercube topology for a multi-processor network, comprising:
- a first level comprising a plurality of n-dimensional hypercubes, each said n-dimensional hypercube comprising 2.sup.n first-level nodes, wherein each said first-level node is connected to n other first-level nodes using n first edges;
- a second level comprising a p-dimensional metacube, wherein said metacube comprises 2.sup.p second-level nodes, wherein each said second-level node comprises 2.sup.n routers and wherein each said second-level node is connected to p other second-level nodes using p2.sup.n second edges;
- and
- a plurality of third edges for connecting each said n-dimensional hypercube of said first level to one of said second-level nodes, wherein each node of each said n-dimensional hypercube is connected to one of said 2.sup.n routers in one of said second-level nodes;
- wherein said 2.sup.n routers are not connected together with edges.
Dependencies are inferred from the claim text.