N-dimensional modified hypercube
First Claim
1. A computer system, comprising:
- N nodes organized as a massively parallel machine, N having a positive integer value; and
wherein said nodes are interconnected as a n-dimensional modified non-binary hypercube such that two nodes are connected if and only if respective n-digit indices identifying said nodes differ in exactly one digit, wherein n is a positive integer having a value greater than three, and each node is identifiable by a respective one of said n-digit indices, each one of said indices having one digit per dimension and each digit having a respective arbitrary radix, wherein at least one radix is of a base greater than two, and wherein N equals a product of each said respective arbitrary radix.
0 Assignments
0 Petitions
Accused Products
Abstract
A parallel array processor for massively parallel applications is formed with low power CMOS with DRAWM processing while incorporating processing elements on a single chip, with nodes connected in an n-dimensional modified non-binary hypercube. In a 4-dimensional modified non-binary hypercube embodiment, each node includes either processor memory elements on a single chip, each processor memory element having its own associated processing element, significant memory, and I/O, with each processor memory element supporting an external port. Pairs of ports are associated with each dimension, labeled X, Y, W, and Z. Eight nodes are connected in the X dimension to form a ring. Corresponding nodes from eight such rings are connected into rings in the Y dimension to form an 8×8 array of nodes, referred to as a cluster. Corresponding nodes of eight clusters are connected into ring (64 rings) in the Z dimension, forming an 8×8×8 array of nodes referred to as a "cluster ring". Corresponding nodes of eight cluster rings are connected into rings in the W dimension.
-
Citations
29 Claims
-
1. A computer system, comprising:
-
N nodes organized as a massively parallel machine, N having a positive integer value; and wherein said nodes are interconnected as a n-dimensional modified non-binary hypercube such that two nodes are connected if and only if respective n-digit indices identifying said nodes differ in exactly one digit, wherein n is a positive integer having a value greater than three, and each node is identifiable by a respective one of said n-digit indices, each one of said indices having one digit per dimension and each digit having a respective arbitrary radix, wherein at least one radix is of a base greater than two, and wherein N equals a product of each said respective arbitrary radix. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21)
-
-
22. A computer system having a plurality of processors and memory, comprising:
-
a plurality of nodes of multiple processor memory elements interconnected as a massively parallel array processor, each of said processor memory elements having a plurality of communication paths for a n dimensional modified non-binary hypercube interconnection among nodes of the system, wherein n is a positive integer greater than three, each processor memory element having a communication path for communication external to said node to another like scalable node of the computer system.
-
-
23. A computer system having a plurality of processors and memory, comprising:
-
a plurality of nodes of multiple processor memory elements interconnected as a massively parallel array processor; each of said processor memory elements having a plurality of communication paths for a n dimensional modified non-binary hypercube interconnection among nodes of the system wherein n is a positive integer greater than 3.
-
-
24. A computer system having a plurality of processors and memory, comprising:
-
a plurality of nodes of multiple processor memory elements interconnected as a massively parallel array processor, each of said processor memory elements having a plurality of communication paths for a n-dimensional modified non-binary hypercube interconnection among nodes of the system, where n is an integer greater than 3, wherein the processor memory element to processor memory element interconnection in the node has two rings of processor memory elements, with each processor memory element having a connection to a processor memory in the other ring.
-
-
25. A computer system having a plurality of processors and memory, comprising:
-
a plurality of nodes of multiple processor memory elements interconnected as a massively parallel array processor in a n-dimensional non-binary hypercube, wherein n is an integer greater than three, each of said processor memory elements having a plurality of communication paths providing interconnection among nodes of the system, wherein the processor memory element to processor memory element interconnections within a node are implemented as two rings of processor memory elements, and each processor memory element provides for the escape of one bus from the node, in which the escaped buses from one ring are labeled +X, +Y, +W and +Z, while those from the other ring are labeled -X, -Y, -W, and -Z.
-
-
26. A computer system having a plurality of processors and memory, comprising:
a plurality of nodes, each node having eight ports labeled +X, -X, +Y, -Y, +W, -W, +Z, and -Z, and wherein the nodes are connected using +X, -X, +Y and -Y into an array to create a cluster, and where the number of nodes in each dimension of the array is greater than two, and wherein the nodes are intercoupled using +W, -W, +Z, and -Z into an array of clusters, wherein, the number of clusters in each dimension of the array of clusters is arbitrary, enabling coupling as a 4-dimensional hypercube of nodes, and wherein the system can be extended to a 5-dimensional hypercube of ten processor memory element nodes using additional two buses, labeled +E and -E to connect the 4-dimensional hypercube into a vector of hypercubes.
-
27. A computer system having a plurality of processors and memory, comprising:
a plurality of nodes connected as an n-dimensional modified non-binary hypercube, wherein each node has (i) k * n processor memory elements and (ii) a broadcast and control interface (BCI) section for interconection to an external controller, where "n" represents the number of dimensions or rings of the n-dimensional modified non-binary hypercube topology and where "k" represents the number of rings that characterize the processor memory elements in the node, where k and n are positive integers and n is greater than three.
-
28. A computer system having a plurality of processors and memory, comprising:
a plurality of nodes, each node having a plurality of processor memory elements and wherein the interconnection methods for a modified non-binary hypercube topology for interconnecting a plurality of nodes in a network of PMEs is provided according to; a. defining an expansion set of integers e1, e2, e3, . . . em such the product of all elements of the set equals the number of processor memory elements in the network called M, while the product of all elements in the set excepting e1 and e2 is the number of nodes called N, the integer ej represents the number of elements e(j-1) used in the jth level of expansion, where j is an integer from 1 to m and e1 is at least 1, and the number of elements in the set called m defines the dimensionality of the network n by the relationship n=m-2, b. addressing a processor memory element located by a set of address indexes a1, a2, . . . am, where each index represents the processor memory element position in a level of expansion corresponding to the expansion set elements such that the index ai is in the range of zero to ei-1 for i equal to 1, 2, to m., the addressing represented by the formula ( . . . (a(m) * e(m-1)+a (m-2))e(m-1) . . . a(2)*e(1))+a(1) where the notation a(i) has the normal meaning of the the ith element in the list of elements called a, or equivalently for e, c. connecting two processor memory elements having addresses r and s if and only if either of the following two conditions hold; 1) the integer part of r/(e1 * e2) equals the integer part of s/(e1 * e2) and; a) the remainder part of r/e1 differs from the remainder part of s/e1 by 1 or, b) the remainder part of r/e2 differs from the remainder part of s/e2 by 1 or e2-1, and 2) the remainder part of r/ei differs from the remainder part of s/ei for i in the range 3, 4, . . . m and the remainder part of r/e1 equals the remainder part of s/e2 which equals i minus three, and the remainder part of r/e2 differs from the remainder part of s/e2 by e2 minus one. - View Dependent Claims (29)
Specification