Improved hypercube topology for multiprocessor computer systems

A multiprocessor computing system, comprising:

• a plurality of 2.sup.n substituted topologies, where n is a whole integer greater than two, wherein each substituted topology comprises a plurality of processors and a first communications network connecting said processors;
• a second communications network connecting said substituted topologies in a modified hypercube topology, said modified hypercube topology being connected with first communication paths in a hypercube topology and with additional communication paths only directly connecting each substituted topology to the substituted topology's most distant substituted topology which requires the greatest number of substituted topology hops over the shortest path, such that the total number of first communication paths in said second communications network does not exceed (2.sup.n-1)(n+1);
• and
• whereby said first and additional communications paths are substantially identical and the total number of communication paths connected to each of said substituted topologies does not exceed (n+1).

A multicomputer system, comprising:

• a plurality of 2.sup.n computing systems, where n is an integer greater than two, wherein each computing system comprises a plurality of processors and a first communications network having first communications paths connecting said processors;
• and
• a second communications network connecting said computing systems in a modified hypercube topology, said modified hypercube topology being a hypercube topology with additional communication paths only directly connecting each computing system to the computing sytem's most distant computing system, which requires the greatest number of system hops over the shortest path, such that a combined total number of said first and additional communication paths does not exceed (2.sup.n-1 (n+1);
• and
• whereby said first and additional communications path are substantially identical and the total number of communication paths connected to each of said computing systems does not exceed (n+1).

A parallel processor computing system, comprising:

• an n-dimensional hypercube having a plurality of 2.sup.n processor nodes, where n is a whole integer greater than two and having first data communication paths directly connecting each of said processor nodes to an adjacent neighbor processor node along the edges of said hypercube;
• second data communication paths within said hypercube directly connecting each of said processor nodes to a most distant processor node, which requires the greatest number of nodal hops over the shortest path, within said hypercube such that the total number of data communication paths does not exceed (2.sup.n-1)(n+1);
• and
• whereby said first and second data communications paths are substantially identical and the number of data communication paths connected to each processor node does not exceed (n+1).