SCALABLE AND PROGRAMMABLE COMPUTER SYSTEMS

• US 20140149715A1
• Filed: 09/27/2013
• Published: 05/29/2014
• Est. Priority Date: 11/28/2012
• Status: Abandoned Application

• Current Assignee: Los Alamos National Security LLC (Government of the United States of America)
• Original Assignee: Los Alamos National Security LLC (Government of the United States of America)
• Inventors: Inman, Jeffrey Thornton
• Application Number:
  US14/039,303
• Publication Number:
  US 20140149715A1
• Time in Patent Office: Days
• US Class Current: 712/29
• CPC Class Codes: G06F 15/17393 having multistage networks, e.g. broadcasting scattering, gathering, hot spot contention, combining/decombining
• CPC Class Codes: H04L 49/1507 Distribute and route fabrics, e.g. sorting-routing or Batcher-Banyan

Abstract

Efficient, scalable, programmable, and reliable computing systems, built from a homogeneous set of relatively humble processors arranged logically or physically into a Recurrent Multi-Stage Interconnection Network (RMIN) is provided. The RMIN may include a plurality of layers, where each of the plurality of layers includes a plurality of nodes. The RMIN may also include a plurality of links configured to connect each of the plurality of layers, and a plurality of recurrent links configured to connect a plurality of nodes in a last layer of the plurality of layers to plurality nodes in a first layer of the plurality of layers. The plurality of links, together with the plurality of recurrent links, may be configured to allow data originating in any layer of the plurality of layers to pass through each of the plurality of layers without interruption.

Claims

1. A scalable apparatus, comprising:

a plurality of layers, each of the plurality of layers comprising a plurality of nodes;

a plurality of links configured to connect each of the plurality of layers; and

a plurality of recurrent links configured to connect a plurality of nodes in a last layer of the plurality of layers to a plurality of nodes in a first layer of the plurality of layers, wherein

the plurality of links, together with the plurality of recurrent links, are configured to allow data originating in any layer of the plurality of layers to pass through each of the plurality of layers without interruption.

2. The scalable apparatus of claim 1, further comprising:

a gap between each of the plurality of layers, wherein the gap is configured, as a function of scale or layer number to foster movement of air or another cooling agent through the scalable apparatus.

3. The scalable apparatus of claim 1, further comprising:

spacing between a plurality of sub-networks, wherein the spacing is configured as a function of scale or layer number to foster movement of air or another cooling agent through the scalable apparatus.

4. The apparatus of claim 1, wherein each of the plurality of nodes is configured to perform a same amount of local work and/or to move a same amount of data, thereby avoiding delays.

5. The apparatus of claim 1, further comprising:

a plurality of multiplexors, wherein each of the plurality of multiplexors is associated with one of the plurality of recurrent links and is configured to split, merge, and/or redirect streams of data.

6. The apparatus of claim 1, wherein each of the plurality of nodes are configured to operate as a router during a distributed data moving operation beginning at any of the plurality of layers.

7. The apparatus of claim 1, wherein

the plurality of links comprises a plurality of shorter links and a plurality of longer links and/or the shorter links comprise extra length to match the corresponding longer links such that data flows to each node in a simultaneous manner, and

a plurality of transceivers associated with shorter links is configured to add a specific amount of delay.

8. A node, comprising:

a plurality of input ports and a plurality of output ports; and

a router configured to select a routing algorithm to move data elements from at least one of the plurality of input ports to at least one of the plurality of output ports based on identifying information related to a source node within a context of a distributed routing operation designed to have a specific global effect.

9. The node of claim 8, wherein the identifying information related to the source node comprises a counter in the router representing Time-Division-Multiplexed time slots, where data from and/or to specific ports is received and/or sent.

10. The node of claim 8, wherein the identifying information related to the source node is based on any multiplexing technique in which the routing function can be implicitly matched to the appropriate data simply by matching the routing function to a multiplexed channel.

11. The node of claim 8, wherein each of the input ports comprises a queue for receiving that is configured to permit access the plurality of the data elements,

each of the output ports comprises a queue for transmission, and the node further comprises associated circuitry and/or instructions configured to execute commands to select and transfer a specific combination of one or more of the plurality of data elements from accessible input positions in the queue of an input port, and to transfer the one or more of the plurality of data elements to an output queue of an output port.

12. The node of claim 11, wherein at least some of the plurality of input ports and the plurality of output ports are combined into port groups, and

the commands are configured to select and transfer a specific combination of data elements in a plurality of accessible input queue elements of the input queues of the ports in an input port-group, and transfer the specification combination of data elements to the plurality of queues in the output ports in an output port-group.

13. The node of claim 8, wherein the node further comprises a program counter configured to control a router algorithm counter, the router algorithm counter configured to cause the data elements to move from an interconnect to a compute fabric and from the compute fabric to the interconnect.

14. The node of claim 12, wherein the compute fabric is connected to memory by queues allowing values to be added to one queue while another queue is consumed.

15. The node of claim 8, further comprising:

an executive configured to select an operator and a set of router-facing queues, and to attach the router facing queues to a specific set of compute elements to perform a supporting arithmetic calculation.

16. The node of claim 8, further comprising:

a memory management unit comprising a plurality of domain memory access (DMA) engines configured to operate in a series of time slices, wherein each of the plurality of DMA engines is configured to issue a sequence of memory commands that imply a continuous stream of data moving to or from memory with delays incurred only before or after the movement.

17. The node of claim 16, further comprising:

a direct memory access (DMA) scheduler configured to support scheduling of the plurality of DMA engines into a staggered order, when feasible, such that the initial and final delays incurred by one DMA engine may occur while data is moving on behalf of another DMA engine.

18. The node of claim 8, further comprising:

memory comprising a plurality of banks, and an arrangement of data within each of the plurality of banks, such that width, breadth, and/or depth of a dataset can be accessed with equal speed in a continuous stream without incurring delays.

19. The node of claim 8, wherein the plurality of links comprises a plurality of additional wires, bits in data communicated on the plurality of links, and/or extra multiplexed channels to be used for out-of-band control signals, representation of “

not-a-value”

data elements, and/or diagnostic information.

20. The node of claim 8, wherein the identifying information related to the source node comprises explicit information comprising a packet header.