Method and apparatus for interleaved exchange in a network mesh
First Claim
Patent Images
1. A method in a mesh network to exchange data to perform parallel processing, the method comprising:
- providing a plurality of computer cards each having an interface to transfer information as a processor node in the mesh network and arranged in a square two dimensional matrix of processor nodes in the mesh network;
providing a plurality of dedicated busses coupled to the plurality of computer cards to interconnect the plurality of computer cards and to allow the exchange of data there between;
associating each of the plurality of computer cards in the mesh network with an address; and
each of the plurality of computer cards generating information to transfer to a destination processor node, generating an address for the destination processor node, and transferring the information and the address to another computer card in accordance with the node order specified by an interleaved binary exchange algorithm with a multi-stage information transfer cycle, in at least one stage of the information transfer cycle information is concurrently transferred in only a vertical direction between some processor nodes diagonally aligned in the mesh network and in only the horizontal direction between other processor nodes diagonally aligned in the mesh network.
0 Assignments
0 Petitions
Accused Products
Abstract
A method for exchanging information within a mesh network that has an array of nodes defined by four quadrants. The method includes the initial step of exchanging information from a set of nodes in one quadrant to a set of nodes located in an adjacent quadrant. The exchange of information simultaneously occurs in both a vertical and horizontal direction within the array. Information is then exchanged between nodes within the same quadrant and subquadrants.
-
Citations
23 Claims
-
1. A method in a mesh network to exchange data to perform parallel processing, the method comprising:
-
providing a plurality of computer cards each having an interface to transfer information as a processor node in the mesh network and arranged in a square two dimensional matrix of processor nodes in the mesh network;
providing a plurality of dedicated busses coupled to the plurality of computer cards to interconnect the plurality of computer cards and to allow the exchange of data there between;
associating each of the plurality of computer cards in the mesh network with an address; and
each of the plurality of computer cards generating information to transfer to a destination processor node, generating an address for the destination processor node, and transferring the information and the address to another computer card in accordance with the node order specified by an interleaved binary exchange algorithm with a multi-stage information transfer cycle, in at least one stage of the information transfer cycle information is concurrently transferred in only a vertical direction between some processor nodes diagonally aligned in the mesh network and in only the horizontal direction between other processor nodes diagonally aligned in the mesh network. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A method comprising:
-
generating information by selected nodes of an array of nodes; and
transferring the information in accordance with a node order specified by an interleaved binary exchange algorithm with a multi-stage information transfer cycle, the transferring of the information comprises transferring information in a vertical direction between a first group of nodes aligned diagonally along the array of nodes;
transferring information in the horizontal direction between a second group of nodes aligned diagonally along the array of nodes differing from the first group of nodes, the transfer in the horizontal direction being concurrent with the transfer in the vertical direction, and the first group of nodes being adapted to intitially transfer information in only the vertical direction and the second group of nodes being adapted to initially transfer information in only the horizontal direction concurrently with the transfer of information in the vertical direction. - View Dependent Claims (9, 10, 11, 12, 13, 14, 15)
-
-
16. A method comprising:
-
generating information by a first node of a plurality of nodes forming an array of nodes; and
transferring the information in accordance with a node order specified by an interleaved binary exchange algorithm with a multi-shape information transfer cycle by transferring information in a vertical direction for a first group of nodes of the plurality of nodes diagonally aligned within the array of nodes, transferring information in the horizontal direction between a second group of nodes of the plurality of nodes diagonally aligned within the array of nodes concurrently with the transferring of information in the vertical direction, the second group of nodes being different from the first group of nodes, and the first group of nodes being adapted to initially transfer information in only the vertical direction and the second group of nodes being adapted to initially transfer information in only the horizontal direction concurrently with the transfer of information in the vertical direction. - View Dependent Claims (17, 18, 19, 20, 21, 22)
-
-
23. A method comprising:
-
generating information by a first node of a plurality of nodes of an array of nodes;
transferring the information in accordance with a node order specified by an interleaved binary exchange algorithm with a multi-stage information transfer cycle by transferring information in a vertical direction a first group of nodes of the plurality of nodes formed diagonally using the array of nodes, and transferring information in the horizontal direction between a second group of nodes of the plurality of nodes diagonally along the array of nodes concurrently with the transferring of information in the vertical direction, the second group of nodes being different from the first group of nodes, the interleaved binary exchange algorithm defined by
2kα
+2(k−
1)(mn/B)+k(mn/δ
)
where;
m=number of bytes of information;
α
=a latency, which is a start-up time required to exchange information;
B=a bandwidth, which is a rate at which information can be transmitted along communication links, in bytes per second; and
δ
=a rearrangement rate, which is a rate at which information can be rearranged at a node for subsequent transmission, in bytes per second.
-
Specification