Patent Grant
11973685
Network switches are often implemented in computing environments as a tool for network communication. For example, network switches can interconnect with other components via a Network interface (NIC). Better communication methods and systems that implement these network switches are needed for improved communications in changing network environments.
The present disclosure, in accordance with one or more various embodiments, is described in detail with reference to the following figures. The figures are provided for purposes of illustration only and merely depict typical or example embodiments.
The figures are not exhaustive and do not limit the present disclosure to the precise form disclosed.
When multiple switches are configured in a fat tree topology, it was discovered that minimal routing techniques are less efficient. This is specifically true when dealing with uniform traffic across the network. In order to improve this, minimal routing techniques are replaced by a hash based routing methodology. More specifically, the routing table incorporates a hash function based upon the destination to make routing decisions.
Typically, traffic can be injected into switch fabric 100 via an ingress port of an edge switch, and leave switch fabric 100 via an egress port of another (or the same) edge switch. An ingress edge switch can group injected data packets into flows, which can be identified by flow ID's. The concept of a flow is not limited to a particular protocol or layer (such as layer-2 or layer-3 in the Open System Interface (OSI) reference model). For example, a flow can be mapped to traffic with a particular source Ethernet address, traffic between a source IP address and destination IP address, traffic corresponding to a TCP or UDP port/IP 5-tuple (source and destination IP addresses, source and destination TCP or UDP port numbers, and IP protocol number), or traffic produced by a process or thread running on an end host. In other words, a flow can be configured to map to data between any physical or logic entities. The configuration of this mapping can be done remotely or locally at the ingress edge switch.
Upon receiving injected data packets, the ingress edge switch can assign a flow ID to the flow. This flow ID can be included in a special header, which the ingress edge switch can use to encapsulate the injected packets. Furthermore, the ingress edge switch can also inspect the original header fields of an injected packet to determine the appropriate egress edge switch's address, and include this address as a destination address in the encapsulation header. Note that the flow ID can be a locally significant value specific to a link, and this value can be unique only to a particular input port on a switch. When the packet is forwarded to the next-hop switch, the packet enters another link, and the flow-ID can be updated accordingly. As the packets of a flow traverse multiple links and switches, the flow IDs corresponding to this flow can form a unique chain. That is, at every switch, before a packet leaves the switch, the packet's flow ID can be updated to a flow ID used by the outgoing link. This up-stream-to-down-stream one-to-one mapping between flow ID's can begin at the ingress edge switch and end at the egress edge switch. Because the flow ID's only need to be unique within an incoming link, a switch can accommodate a large number of flows. For example, if a flow ID is 11 bits long, an input port can support up to 2048 flows. Furthermore, the match pattern (one or more header fields of a packet) used to map to a flow can include a greater number of bits. For instance, a 32-bit long match pattern, which can include multiple fields in a packet header, can map up 2{circumflex over ( )}32 different header field patterns. If a fabric has N ingress edge ports, a total number of N*2{circumflex over ( )}32 identifiable flows can be supported.
A switch can assign every flow a separate, dedicated input queue. This configuration allows the switch to monitor and manage the level of congestion of individual flows, and prevent head-of-queue blocking which could occur if shared buffer were used for multiple flows. When a packet is delivered to the destination egress switch, the egress switch can generate and send back an acknowledgement (ACK) in the upstream direction along the same data path to the ingress edge switch. As this ACK packet traverses the same data path, the switches along the path can obtain the state information associated with the delivery of the corresponding flow by monitoring the amount of outstanding, unacknowledged data. This state information can then be used to perform flow-specific traffic management to ensure the health of the entire network and fair treatment of the flows. As explained in more detail below, this per-flow queuing, combined with flow-specific delivery acknowledgements, can allow the switch fabric to implement effective, fast, and accurate congestion control. In turn, the switch fabric can deliver traffic with significantly improved network utilization without suffering from congestion.
Flows can be set up and released dynamically, or “on the fly,” based on demand. Specifically, a flow can be set up (e.g., the flow-ID to packet header mapping is established) by an ingress edge switch when a data packet arrives at the switch and no flow ID has been previously assigned to this packet. As this packet travels through the network, flow IDs can be assigned along every switch the packet traverses, and a chain of flow IDs can be established from ingress to egress. Subsequent packets belonging to the same flow can use the same flow IDs along the data path. When packets are delivered to the destination egress switch and ACK packets are received by the switches along the data path, each switch can update its state information with respect to the amount of outstanding, unacknowledged data for this flow. When a switch's input queue for this flow is empty and there is no more unacknowledged data, the switch can release the flow ID (i.e., release this flow channel) and re-use the flow-ID for other flows. This data-driven dynamic flow setup and teardown mechanism can obviate the need for centralized flow management, and allows the network to respond quickly to traffic pattern changes.
Note that the network architecture described herein is different from software-defined networks (SDN's), which typically uses the OpenFlow protocol. In SDN, switches are configured by a central network controller, and packets are forwarded based one or more fields in the layer-2 (data link layer, such as Ethernet), layer-3 (network layer, such as IP), or layer-4 (transport layer, such as TCP or UDP) headers. In SDN such header-field lookup is performed at every switch in the network, and there is no fast flow ID-based forwarding as is done in the networks described herein. Furthermore, because the OpenFlow header-field lookup is done using ternary content-addressable memory (TCAM), the cost of such lookups can be high. Also, because the header-field mapping configuration is done by the central controller, the setup and tear-down of each mapping relationship is relatively slow and could require a fair amount of control traffic. As a result, an SDN network's response to various network situations, such as congestion, can be slow. In contrast, in the network described herein, the flows can be set up and torn down dynamically based on traffic demand; and packets can be forwarded by a fixed-length flow ID. In other words, flow channels can be data driven and managed (i.e., set up, monitored, and torn down) in a distributed manner, without the intervention of a central controller. Furthermore, the flow ID-based forwarding can reduce the amount of TCAM space used and as a result a much greater number of flows can be accommodated.
Referring to the example shown in
Note that the operations described above can be performed substantially at line speed with little buffering and delay when the first packet is received. After the first packet is processed and scheduled for transmission, subsequent packets from the same flow can be processed by switch 110 even faster because the same flow ID is used. In addition, the design of the flow channels can be such that the allocation, matching, and deallocation of flow channels can have substantially the same cost. For example, a conditional allocation of a flow channel based on a lookup match and a separate, independent deallocation of another flow channel can be performed concurrently in nearly every clock cycle. This means that generating and controlling the flow channels can add nearly no additional overhead to the regular forwarding of packets. The congestion control mechanism, on the other hand, can improve the performance of some applications by more than three orders of magnitude.
At each switch along the data path (which includes switches 110, 106, and 104), a dedicated input buffer can be provided for this flow, and the amount of transmitted but unacknowledged data can be tracked. When the first packet reaches switch 104, switch 104 can determine that the destination fabric address in the packet's fabric header matches its own address. In response, switch 104 can decapsulate the packet from the fabric header, and forward the decapsulated packet to host 116. Furthermore, switch 104 can generate an ACK packet and send this ACK packet back to switch 110. As this ACK packet traverses the same data path, switches 106 and 110 can each update their own state information for the unacknowledged data for this flow.
In general, congestion within a network can cause the network buffers to fill. When a network buffer is full, the traffic trying to pass through the buffer ideally should be slowed down or stopped. Otherwise, the buffer could overflow and packets could be dropped. In conventional networks, congestion control is typically done end-to-end at the edge. The core of the network is assumed to function only as “dumb pipes,” the main purpose of which is to forward traffic. Such network design often suffers from slow responses to congestions, because congestion information often cannot be sent to the edge devices quickly, and the resulting action taken by the edge devices cannot always be effective in removing the congestion. This slow response in turn limits the utilization of the network, because to keep the network free of congestion the network operator often needs to limit the total amount of traffic injected into the network. Furthermore, end-to-end congestion control usually is only effective provided that the network is not already congested. Once the network is heavily congested, end-to-end congestion control would not work, because the congestion notification messages can be congested themselves (unless a separate control-plane network that is different from the data-plane network is used for sending congestion control messages).
In contrast, the flow channels can prevent such congestion from growing within the switch fabric. The flow channel mechanism can recognize when a flow is experiencing some degree of congestion, and in response can slow down or stop new packets of the same flow from entering the fabric. In turn, these new packets can be buffered in a flow channel queue on the edge port and are only allowed into the fabric when packets for the same flow leave the fabric at the destination edge port. This process can limit the total buffering requirements of this flow within the fabric to an amount that would not cause the fabric buffers to become too full.
With flow channels, the switches have a reasonably accurate state information on the amount of outstanding in-transit data within the fabric. This state information can be aggregated for all the flows on an ingress edge port. This means that the total amount of data injected by an ingress edge port can be known. Consequently, the flow channel mechanism can set a limit on the total amount of data in the fabric. When all edge ports apply this limit action, the total amount of packet data in the entire fabric can be well controlled, which in turn can prevent the entire fabric from being saturated. The flow channels can also slow the progress of an individual congested flow within the fabric without slowing down other flows. This feature can keep packets away from a congestion hot spot while preventing buffers from becoming full and ensuring free buffer space for unrelated traffic.
Crossbar switch 210 includes crossbars, which can be configured to forward data packets and control packets (such as ACK packets) among the communication ports. EFCT logic block 212 can process packets received from an edge link and map the received packets to respective flows based on one or more header fields in the packets. In addition, EFCT logic block 212 can assemble FGFC Ethernet frames, which can be communicated to an end host to control the amount of data injected by individual processes or threads. IFCT logic block 214 can include the IFCT, and perform various flow control methods in response to control packets, such as endpoint-congestion-notification ACKs and fabric-link credit-based flow control ACKs. OFCT logic block 216 can include a memory unit that stores the OFCT and communicates with another switch's IFCT logic block to update a packet's flow ID when the packet is forwarded to a next-hop switch.
In one embodiment, switch 202 is an application-specific integrated circuit (ASIC) that can provide 64 network ports that can operate at either 100 Gbps or 200 Gbps for an aggregate throughput of 12.8 Tbps. Each network edge port may be able to support IEEE 802.3 Ethernet, and Optimized-IP based protocols as well as Portals, an enhanced frame format that provides support for higher rates of small messages. Ethernet frames can be bridged based on their L2 address or they can be routed based on their L3 (1Pv4//1Pv6) address. Optimized-IP frames may only have an L3 (1Pv4/1Pv6) header, and are routed. Specialized NIC support can be used for the Portals enhanced frame format, and can map directly onto the fabric format of network 100, e.g., a fabric format that provides certain control and status fields to support a multi-chip fabric when switches/switch chips, such as switches 102, 104, 106, 108, and 110 are connected and communicate with each other. As alluded to above, a congestion control mechanism based on flow channels can be used by such switches, and can also achieve high transmission rates for small packets (e.g., more than 1.2 billion packets per second per port) to accommodate the needs of HPC applications.
Switch 202 can provide system-wide Quality of Service (QoS) classes, along with the ability to control how network bandwidth is allocated to different classes of traffic, and to different classes of applications, where a single privileged application may access more than one class of traffic. Where there is contention for network bandwidth, arbiters select packets to forward based on their traffic class and the credits available to that class. Network 100 can support minimum and maximum bandwidths for each traffic class. If a class does not use its minimum bandwidth, other classes may use the unused bandwidth, but no class can get more than its maximum allocated bandwidth. The ability to manage bandwidth provides the opportunity to dedicate network resources, as well as CPUs and memory bandwidth to a particular application.
In addition to support for QoS classes, switch 202 effectuates flow channel-based congestion control, and can reduce the number of network hops, e.g., in a network having a dragonfly topology, from five network hops to three. The design of switch 202, described in greater detail below, can reduce network cost and power consumption, and may further facilitate use of innovative adaptive routing algorithms that improve application performance. A fabric created by a plurality of switches, such as a plurality of switches 202 may also be used in constructing Fat-Tree networks, for example when building a storage subsystem for integration with third-party networks and software. Further still, the use of switch 202 enables fine-grain adaptive routing while maintaining ordered packet delivery. In some embodiments, switch 202 may be configured to send the header of a packet from an input port to an output port before the full data payload arrives, thereby allowing output port load metrics to reflect future loads, thereby improving adaptive routing decisions made by switch 202.
Crossbar switch 210 may comprise separate, distributed crossbars routing data/data elements between input and output ports. In some embodiments, and as illustrated in
Request crossbar 210a is used to send requests from an input to a targeted output age queue. Grant crossbar 210b is used to return a grant back to the input to satisfy a request. In particular, grant crossbar 210b returns a pointer indicating where a packet is within an input buffer. It should be noted that a grant is returned when there is space in the output for the corresponding packet. Grant crossbar 210b may also optionally return a credit for requested space in the output. It should be noted that grants are returned when there is a landing spot for a packet at the output, e.g., an output port 220c, so packets cannot be blocked (though they can face transient contention for resources).
It should be understood that in accordance with various embodiments, a credit protocol may be used to guarantee that there is a landing space for a request at the output. Accordingly, a credit crossbar 210c may be used to return credit for requested space in the output.
A data crossbar 210d is used to move granted packets from an input buffer to a targeted output buffer. An Ack crossbar 210e is used to propagate Ack packets from output ports 220c to input ports 220b. Acks are steered in accordance with a state kept in an output flow channel table.
It should be understood that data crossbar 210d moves multi-clock packets with both headers and data, while the other four crossbars (request crossbar 210a, grant crossbar 210b, credit crossbar 210c, and Ack crossbar 210e) move only single-clock packet headers. All five crossbars use the same architecture with row buses and column buses within an 8×4 matrix of 32 dual-port tiles (as described below).
Referring back to
Each crossbar switch 210 has sixteen input ports 220b, one for each port in its row, and eight output ports 220c, one for each port in its column. Row buses can be driven from each source in a row to all eight crossbars in that row (one-to-all). Arbitration can be performed at the crossbar from the sixteen row buses in that row to the eight column buses in a given column. Buffering can be provided at each 16×8 crossbar for each of the row buses in order to absorb packets during times when there is contention for a column bus. In some embodiments, a non-jumbo packet is kept off a row bus unless there is room for the entire packet in the targeted crossbar input buffer. Due to area constraints, jumbo packets are allowed to go even if there is not sufficient space (crossbar input buffer only sized to sink a non-jumbo packet) with the row bus being blocked until the packet wins arbitration and space is freed as it is moved onto a column bus.
Column buses are driven from a given crossbar to each destination port within a column (all-to-all). Each destination may have another level of arbitration between the column buses from the four rows. With sixteen row buses driving eight crossbars, each feeding eight column buses, there is a 4× speedup between rows and columns. Each row has identical connections with the one-to-all row bus connections for a single row shown in row buses. Each tile will have a one (request, grant, credit) or a two (data, ack) clock delay per tile depending on the crossbar. This gives a maximum seven or fourteen clock delay to get between the leftmost and rightmost columns. Credit returns routed through credit crossbar 210c may have a one clock delay per tile, and therefore, can take a maximum of seven clocks to complete transmission.
It should be noted that each column may have identical connections with the all-to-all column bus connections for a single column, and there may be a two clock delay per tile, resulting in a six clock delay to get from the top row to the bottom row. It should also be understood that both row and column buses both use the aforementioned credit-based protocol to determine when they are able to send. In the case of row buses, the source port maintains credit counts for the input buffers of the crossbars within that row. For the data crossbar, care is needed to determine when a packet is allowed to go on a row bus. If grants targeting a particular crossbar input buffer all go through a single queue, space for the packet at the head of the queue is required before starting the packet transfer. If the grants are distributed across multiple queues, in order to prevent small packets from locking out large packets, a packet transfer does not start unless there is space for an entire max sized packet in the buffer. In this way, once a packet transfer on a row bus starts, it will not stop until the entire packet has been transferred. Accordingly, crossbar input buffers are configured to be large enough to handle the maximum packet size plus additional space to cover the worst case round trip (packet send to credit return). This will not be the case for jumbo packets. To save on buffering area, the crossbar input buffers are only deep enough to handle a non-jumbo sized MTU (1500 bytes) with a jumbo packet being allowed to block a row bus while waiting to gain access to the targeted column bus.
For column buses, each crossbar maintains credit counts for the input buffers at each destination port in that column. Unlike row buses, there is no requirement that credits be available for a maximum-sized packet before starting transfer of that packet on a column bus. Individual words of the packet will move as credits become available. Therefore, the input buffer at the destination for each column bus needs to only be big enough to cover the worst case round trip latency (packet to credit).
A fair round-robin arbitration may be used between the sixteen sources for each destination. For the data crossbar 210d, once a source wins arbitration, it keeps control of the destination column bus until the entire packet has been sent. Each output grants a limited amount of packet payload so it is expected that contention for a given column bus should be fairly limited when larger packets are involved. Because of this, a round-robin arbitration is expected to be sufficient even with possibly large differences in packet size among requesters.
Parts of switch 202 associated with output functions generally operate on frames within the switch fabric format, and have a fabric header, even, for example, for a frame arriving and leaning on an Ethernet port within a single switch 202.
Age queue output control is responsible for accepting requests from all of the input port, e.g., input ports 220b, via request crossbar 210a, buffering the requests, arbitrating between them by traffic class using a traffic shaper, and passing the requests to the OFCT 216 to be granted via grant crossbar 210b. Age queue buffering is managed to allow each input to have enough space to flow while also allowing an input with multiple flows targeting a given output to take more space. In particular, an age queue space is managed by output control. The age queue/output control may also be responsible for managing access to the link either using credit-based flow control for a connected input buffer or pause-based flow control for non-fabric links. When a packet is released by the age queue, it is committed to being put on the link. Additionally the age queue has a path allowing packets initiated on a given port e.g., one of input ports 220b (such as maintenance or reduction packets), to arbitrate for resources on the given port.
Requests come into the output control block via a column bus from each row of matrix 30. Each column bus feeds an independent FIFO (e.g., first-in-first-out shift register or buffer) with space in the FIFO managed via credits. The FIFOs may be sized (24 deep) to cover a round-trip plus additional space to allow requests to be moved out of the crossbars 210a-210e and prevent head-of-line blocking. Prior to writing into a FIFO, a request may be checked for a valid error correcting code (ECC). If the ECC check has either a multi bit error (MBE) or a single bit error (SBE) in the destination field (i.e. it has been routed to the wrong port), the request is considered to be an invalid request, and is discarded with an error being flagged.
Least recently used (LRU) arbitration may be performed between column bus FIFOs to choose which FIFO gets forwarded to age queue management. As requests are removed from each FIFO, credits are returned to the corresponding crossbar. The row with which an incoming column bus corresponds can be dependent both on where in the matrix the tile is located, and as well as which half of the tile the block is in.
The output buffer (OBUF) makes requests to the output control block for sending reduction and maintenance packets across a link. These requests may be given the highest priority. A FIFO with 8 locations can be used to buffer these reduction/maintenance packet requests while they wait for resources. Reduction packets need not use flow channels, and maintenance packets may use loopback to create a flow so that checking for flow channel availability or flowing through the OFCT to create a grant is not needed. Reduction and maintenance packets also need not use any space in the output buffer so that no check of space is required. Rather, a check for the link partner input buffer may be performed. If allowed, a shaping queue (SQ) or virtual channel (VC) can be granted, blocking any grants from the age queue path from being granted during that cycle.
The size of the next request to be processed from the output buffer is checked against max_frame_size. If it exceeds this setting, the request is not processed and an error flag is set. This will result in the output buffer request path being blocked until a warm reset is performed. The error flag will stay set until the reset is done. The condition can also be released by increasing the setting of max_frame_size to a value above the size of the stuck output buffer request. The size used in the comparison may be the size indicated in the output buffer request (which may include a 4-byte frame checksum (FCS) used on the wire).
Each input may be given the same fixed_allocation of age queue space. This age queue space is large enough to reserve a location for each SQ/VC with enough additional space to cover a request/credit round-trip. It is up to the input to manage the space it is given across its SQs/VCs. This allocation (fixed_al/oc) is programmable via a control and status register (CSR) in each input queue (INQ), and can be, e.g., in the range of 64-96 locations. The remaining age queue space (8K−64*fixed_al/oc) may be shared space that is available to all inputs. The shared space can be managed by the output with it moving incoming requests from static to shared space as they arrive if there is room in the shared space, subject to per-input limits. When moving a request to the shared space, a credit is returned, e.g., immediately, via credit crossbar 210c, with the request marked in the age queue as being in the shared space.
When a request is granted, if it is marked as using the shared space, the shared space is credited. If it is not marked as using shared space, the request is considered to have used the static space, and a credit is returned to the input with the grant.
Due to conflicts in credit crossbar 210c, it is possible that credits may not be sent every clock period. Accordingly, a FIFO provides buffering for these transient disruptions. Space in this FIFO is required before taking a request from the request crossbar. A FIFO with a depth of 32 locations can be used to limit the chances of it ever backing up into request crossbar 210a. The shared space may have limits for how much space any input (from an input port 220b) can take. These limits can be set as a percentage of the available space. For instance, if the limit is set to 50%, if one input port is active, it has access to 50% of the buffer space, with two active input ports, each gets 37.5% ((space_used_by_I+pace_left*0.5)/2=(50%+50%*0.5)/2), with three active input ports, each gets 29.2% ((space_used_by_2+space_left*0.5)/3=(75%+25%*0.5)/3), and so on. Additionally, the total space used by the active input ports can be limited to the given total (50%, 75%, 87.5%). Thus, the space allocated to each of input port 220b may vary dynamically by how many inputs ports are currently active. The addition of an active input port causes other active inputs ports to give up their space which is then taken by the new input.
Given that division is not something easily done in hardware, the aforementioned age queue credit management function can be implemented as a lookup table 310 with 64 entries 312. The number of inputs currently active in the age queues 320 indexes 315 the lookup table 310. The values 314 in the lookup table 310 reflect the limit of the number of shared space locations any input can take along with the total space they can consume as a whole. Thus, it is up to software to program the values 314 in the lookup table 310 according to how much total shared space there is and what percentage each input port is allowed to take. As more input ports 220b become active, each input port 220b is allowed less space, and the total space available increases. Incoming requests from input ports 220b that are above this limit, or in total, exceed the total space limit, are not allowed to take more shared space. In order to track the number of active input ports 220b in the age queues, a set of 64 counters 316 (one for each input port) is used. These count up when a request is put in the age queues 320 and count down as they are taken out (i.e., granted). A count of the number of non-zero counts 319 is used as an index into the lookup table 310. In addition, in order to manage the shared space, an additional set of 64 counters 318 may be used to track the current usage of the shared space by each input. There may also be a single counter 334 that can be used to track overall shared space usage. These counters are compared against the current quotas to determine if a request is allowed to use the shared space or not. Counters 316, 318 can be, e.g., 13 bits wide, to provide sufficient coverage of the maximum value of an object that may be somewhat less than 8K.
Age queues 320 may use a single storage RAM 321 that has 8K locations in it. These locations can be dynamically allocated to 32 separate queues (one for each Set/VC) with each consisting of a linked-list of locations within the storage RAM 321. This gives each SQ/VC the ability to take more space as needed.
An age queue 320 can be created with a front pointer 322 pointing to the front of the queue, and a next pointer 324 for each location pointing the next item in the queue. The last location in the queue may be indicated by a back pointer 326. Items are taken from the front of the queue and inserted at the back of the queue. In addition to the above data structures, each queue has a FIFO 328 of entries at its head. These FIFOs 328 may ensure that a queue can sustain a request every clock with a multi-clock read access time from the request RAM 321. When a new request arrives, if the head FIFO 328 for that queue is not full, it bypasses the request RAM 321, and can be written directly into the head FIFO 328. Once requests for a given age queue are being written to the request RAM 321, subsequent requests are also written to the request RAM 321 to maintain order. The bypass path can be used again once there are no more requests for that age queue in the request RAM 321, and there is room are the head FIFO 328. When a request is read from a head FIFO 328, and there are corresponding requests queued in the request RAM 321, a dequeue is initiated. One head FIFO 328 may be read at a time, such that a single dequeue operation can be initiated each clock period. Logic may be included to handle the various race conditions between an ongoing or imminent enqueue operation and a head FIFO 328 being read.
The aforementioned ECC protection used in the age queue RAM 321 can be extended to the FIFOs 328 to protect the data path flops. The resulting structure may include 8K flops (32 queues×5 deep×SQ-bits wide). When generating the ECC, the age queue number can be included in the calculation (but not stored) as an extra check of the free list management. When the ECC is checked, the request can be considered to be in error if there is an MBE or there is an SBE in the queue number bits.
A free list RAM can be a simple FIFO which is initialized with pointers to all 8K entries whenever a reset is performed. A count can be maintained to keep track of how may entries are valid within the free list. As entries are taken, they are popped off the front of the FIFO and used. As entries are returned, they are pushed onto the back of the FIFO. Some number of entries, e.g., three entries,) at the head of the free list can be kept in flops so they are available for quick access. As with the head FIFOs for the age queues, ECC is carried through the flops to provide protection. The resulting structure may have minimal flops (57=3 deep×19-bits wide).
In order to support full performance for small packets, age queues support both an enqueue and a dequeue every clock period. The operations across the data structures for an enqueue operation are discussed below, and can differ depending on whether the queue being written is empty or not.
In some cases, a simultaneous enqueue and dequeue to a specific queue is easily handled as they are using and updating separate fields. Some specialized scenarios may arise, e.g., when a dequeue operation empties the age queue. In order to handle this scenario, a dequeue occurs first logically, followed by an enqueue operation. Accordingly, an empty flag is seen as being set when the queue is emptied by the dequeue operation, and then cleared due to the enqueue operation.
The arbitration alluded to above can be performed among requests that are permitted to be granted subject to input buffer management, output buffer management, and flow channel quotas. Arbitration can also be halted if there are no credits for the OFCT input FIFO. In some embodiments, arbitration may be performed at two levels. First, traffic shaping arbitration can be used to arbitrate between the SQs. A Deficit Round-robin arbitration can be used to arbitrate between VCs within a given SQ. Traffic shaping arbitration may use a series of token buckets to control the bandwidth of each SQ as follows: eight leaf buckets, one for each SQ; four branch buckets; and a single head bucket.
Arbitration can be divided into three groups with a first group having the highest priority, followed by a second group, which in turn is followed by a third group. For the first and second groups, arbitration may be handled in the same way among eligible SQs. A x8 round-robin arbitration can be performed between the SQs for each of the eight priority levels (eight parallel round-robin arbitrations). A fixed arbitration can be performed between priority levels. For example, group 3 arbitration has no priorities, and therefore is simply a single x8 round-robin arbitration.
For arbitration in the first group, the priority for each comes from the setting in the leaf buckets. For arbitration in the second group, priority comes from the setting in the branches of the leaf buckets. In all cases, the buckets which are checked to be eligible for that group, are also the buckets from which packet size tokens are obtained if that request wins arbitration.
Regarding age queue 320 selection, packets can be classified in order to select the SQ to which their request is forwarded. This allows traffic associated with an application to be shaped differently from traffic originating from a different application or a different traffic class. This can be useful on the edge ports which connect to a NIC in that the applications will have been configured to use a share of the resources on the node, and similarly will be granted a proportion of the network bandwidth. In accordance with one embodiment, this classification is performed by classifying the packets into a traffic class identifier (FTAG), e.g., a 4-bit code that is part of the fabric frame header, and a VLAN ID (VNI) as the packet ingresses into the fabric. The FTAG and VNI may then be used as the packet egresses the fabric to select the shaping queue.
A configuration register can be used to map FTAGs to SQs. This configuration matches the corresponding configuration in the in queue. When the output buffer requests or returns link partner credits, it converts a given FTAG to an SQ. For packet injection, the FTAG is found in R_TF_OBUF_CFG_PFG_TX_CTRL. For test generation, the FTAG is found in the test control register. When the reduction engine (RED) requests a credit return, the FTAG is found in ret_cdtJtag. When a reduction frame is removed from the output stream and link partner credits need to be returned, the FTAG is found in the frame header.
Regarding the SQs discussed herein, each age queue 320 may have 32 SQs 330 that are addressed by {SQ, VC}. The 3-bit SQ 330 can be considered a shaping function, and the VC selects one of four queues within that shaping function. For Ethernet egress (edge) ports, the VC is not needed for deadlock avoidance. Accordingly, all 32 SQs 330 can be available. In such a scenario, the SQ 330 can be selected by adding the SQ base from R_TF_OBUF_CFG_FTAG_SQ_MAP to the lower bits of the VNI. The 5-bit sum defines the {SQ,VC} to send to the age queue. It should be noted that when injecting frames on an egress port, a VNI is not available, and therefore, an SQ base can be directly used. For fabric links, the SQ 330 is taken from the upper three bits of the SQ base. The VC can be taken from the frame header when returning credits for reduction frames, or from the appropriate control CSR (R_TF_OBUF_CFG_TEST_CTRL or R_TF_OBUF_CFG_PFG_TX_CTRL) when injecting frames.
A link partner input buffer management can depend on the type of device to which the link is attached. Devices such as switch 202 may use credit-based flow control where each credit represents a cell of storage in the input buffer. Other devices may use standard Ethernet pause or priority pause-based flow control. Requests which are marked to terminate locally (lac term set) need not consider link partner input buffer flow control and need not update any associated counters. Link partner space need not be considered when the link is in the draining state.
For credit-based flow control, the link partner input buffer can be divided into eight buffer classes. Each SQ 330 can be assigned to one of these 8 buffer classes. Credits are maintained for each of the buffer classes with each credit representing 32 bytes of storage in the link partner input buffer. In order to allow credit-based flow control to work with various devices (switch, enhanced NIC), each of which may have different cell sizes, the cell size is a programmable value in units of 32 bytes.
There may be two sets of VCs with each SQ 330 assigned to one set. A maximum frame size worth of space can be reserved for each VC, and each VC set can have a different maximum frame size. The remainder of the link partner input buffer is shared dynamic space usable by any SQ/VC, subject to per VC and buffer class limits.
The size that comes with the request represents the size of the packet on the wire which includes a 4-byte FCS. This gets converted to an internal 2-byte FCS at the link partner before writing the packet to the link partner input buffer so the crediting needs to account for this difference, which can be a factor at the boundary of the cell size. For instance, for a 96 byte cell, a size that is 97 or 98 will take a single cell. In order to know when this happens, the request includes a correction term which is calculated as: req.len_correct=(byte_len % 16)==1 or 2.
Further validation of this term is required to convert it to whatever the cell size boundary may be. It will be valid when the length just exceeds the cell size. With this, the validated fen_correct term can be determined by: len_correct=(((16-byte size) % (2*32-byte cell size))==1) & req. len_correct
An example of how these values work for a few cell and packet sizes is illustrated in the table below:
The size that comes with the request uses 8-byte units and the link partner input buffer cell size is a multiple of 32 bytes (32*y where y=cell size from CSR). First, the 8-byte size is converted to a 16-byte size (ROUNDUP((8-byte size)/2)). Also, the cell size is converted to 16 byte units (2*y). Mathematically, the number of cells a request will use can be calculated by: ROUNDDN(((16-byte size)+2*y−1−len_correct)/(2*y))=# of cells
While a divide operation is possible in hardware, due to timing reasons, a divide operation cannot be done in the critical path of the arbitration. Instead, an alternate credit management is used. That is, credits are maintained in units of 32 bytes. When a request wins arbitration, the number of credits taken is adjusted by the maximum error term (2*y−1) using the calculation: ROUNDDN(((16-byte size)+2*y−1)/2)=Maximum 32 byte credits needed. Because this calculation overestimates the credit required for the packet, on the following clock, a modulo operation (X=(16-byte size) MOD 2*y, y=32-byte cell size from CSR) van be performed to determine what the actual remainder is. This value along with the len_correct term are used to adjust the credit counter. The formula used to create the adjustment value (adf_val) for X is: If (X==0) adj_val=y−1 else if (X==1 and fen_correct) adj_val=y else adj_val=ROUNDDN((X−1)/2)
The table below illustrates a request credit example for 96 byte cells showing the values used across several packet lengths for the 96 byte cells of the switch input buffer (y=3).
If a request is filtered before being forwarded to the link partner input buffer, the output buffer logic returns the SQ and VC so they can be used to return the credits to the appropriate credit counters. No size is required since the packet size is always the same, the length of a reduction frame (69-byte or 16-byte size=5).
The local (master) side of the link maintains a count of the number of packets sent from each VC across both sets (8 total), a count of amount of packet (in 3 2-byte quantities) sent to each VC (4), and a count of the amount of packet (in 32-byte quantities) sent for each buffer class (8). The link partner (slave) side of the link maintains the same set of counts with them being sent over the link periodically. The difference between the master and slave counts is a count of the number of packets in the link partner input buffer from each VC across both sets and a count of the amount of space (in 32-byte quantities) currently occupied by each VC and each buffer class. A count is also maintained of the total amount of space used across all packets. A summary of the counters is as follows: master_vcx_cnt[4]/slave_vcx_cnt[4]—master and slave counts of the number of packets sent to each VC in set X; master_vcy_cnt[4]/slave_vcy_cnt[4]—master and slave counts of the number of packets sent to each VC in set Y; master_bc_cnt[8]/slave_bc_cnt[8]—master and slave counts of the amount of space occupied by each buffer class in units of 32-bytes; master_vc_cnt[4]/slave_vc_cnt[4]—master and slave counts of the amount of space occupied by each VC in units of 32-bytes; master-tot-cnt/slave-tot-cnt-master and slave counts of the total amount of space occupied in units of 32-bytes.
All counters are set to zero on a warm reset. They are also forced to zero when the link is in the draining state or when the DBG_RESET CSR bit to clear their state is set. The output buffer filter will steer a reduction packet to something other than the path to the link partner input buffer. In this case, a signal can be returned along with the SQ and VC of the packet. Again, the length is not required as the size of these packets is fixed. This information is used to adjust the appropriate master credit counts.
A request is allowed to participate in arbitration if either its VC count is 0 (indicating its one statically assigned slot is available) or there is space for a max sized frame in the dynamic space (subject to the targeted buffer class and VC limits). There can be a single programmable value for max frame size which is used across all VCs and SQs. The request validation for input buffer space can be addressed using credit-based flow control.
Credit-based flow control can be used to divide a dynamic space in two ways, each independent of each other: first, based on a limit of how much dynamic space each of the four VCs can take; and second, based on a limit to how much dynamic space each of the eight buffer classes can take. In both cases, the limits are set as a percentage of the available space. For a given packet, space should be made available in both its targeted VC and buffer class. For instance, if each space has its limit set to 50%, if one is active, it has access to 50% of the buffer space, with two active, each space gets 37.5% ((50+50*0.5)/2), with three active, each space gets 29.2% ((75+25*0.5)/3), and so on. Also, the total space used by those spaces that are active can be limited to the given total (50%, 75%, 87.5%). Accordingly, the space allocated to each varies dynamically by how many are currently active. When an additional one goes active it causes others that are active to give up some of their space which is then taken by the new one.
Like the division function discussed above, this function is implemented as a lookup table. For the VC space in this example, there are 16 entries with each entry specifying the space available to each VC along with the total space available across all VCs. For the buffer classes, there may be 256 entries with each entry specifying the space available to each buffer class along with the total space available across all buffer classes. Space for each is expressed in 2048-byte units. The depth of each table is sufficient to cover all combinations of active members (VCs or buffer classes), with each being able to have an independent setting for their percentages. With this, it is up to software to program the values in the table according to how much total dynamic space there is and what percentage each is allowed to take across all possible combinations. As more become active, each is allowed less space and the total available increases. Requests for spaces that are above this limit, or in total above the total limit, are not allowed to take more dynamic space.
A VC or buffer class is considered active either if it has a request in an age queue, or if it has outstanding credits for link partner input buffer space. As an example, consider there are only 4 spaces (16 entry table) with percentages set as SPACE0(50%), SPACE1(40%), SPACE2(30%), SPACE3(10%), and a total dynamic space of 16 KB. This results in the values, in quantities of 16-bytes presented in the buffer space example table below.
Buffer Space Example
As an example, the values in the row for index 7 are calculated as: Total %=0.5+(1-0.5)*0.4+(1−0.5−(1−0.5)*0.4)*0.3=0.79; SPACEO=(0.5/(0.5+0.4+0.3))*0.79*1024=337; SPACE1=(0.4/(0.5+0.4+0.3))*0.79*1024=270; SPACE2=(0.3/(0.5+0.4+0.3))*0.79*1024=202; Total=337+270+202=809
As noted above, and referring back to
Routing in the switch fabric may be controlled by a fabric routing function (FRF) implemented in switch 202. An example FRF component 400 is illustrated in
In particular, FRF component 400 determines a preferred port to forward each frame presented at the input port based on: a received frame's destination fabric address (DFA); the frame's current routing state (where the frame is along its path, and the path(s) it took to reach its current routing state); the switch fabric routing algorithm and configuration; and load metrics associated with the possible output ports to using busy ports filters.
FRF component 400 may include a routing algorithm table 408 that may be embodied as a software configurable table that determines valid choices based on the frame's current routing state. Valid choices are decisions such as whether a local minimal, global minimal, local non-minimal, or global non-minimal path is allowed to be chosen for the frame's next hop. The routing state includes information such as the VC the frame was received on, and whether it is in the source, the destination, or an intermediate group. The routing algorithm table 408, along with the adaptive selection function or logic 412A (described below), also determines the VC to be used for the frame's next hop.
Frame routing with unicast DFAs will be described as an example. However, it should be noted that the DFA of the routing request can either be in unicast or multicast format. The unicast format can include a 9-bit global ID field (global_id), a 5-bit switch ID field (switch_id), and a 6-bit endpoint ID field (endpoint_id). The global ID can uniquely identify a group within the network. Specifically, it identifies the final group to which the frame must be delivered. The switch ID uniquely identifies a switch within the group identified by global ID. The endpoint ID field, together with the global ID and switch ID identify the endpoint, connected to the edge of the network fabric, to which the frame is to be delivered. This field is mapped to a port or set of ports on the switch identified by global ID and switch ID.
The multicast format includes a 13-bit multicast ID field (multicast_id). This field is mapped by FRF component 400 to a set of ports on the current switch to which the frame is to be forwarded.
From this information, FRF component 400 determines an updated routing state for the frame, which is then carried within the frame. For example, to effectuate routing in a dragonfly topology, a frame's current state may be gleaned from the frame's VC (discussed above). Based on algorithmic switch fabric routing rules specified for the switch fabric (the selection of which is described below), FRF component 400 determines a particular VC to be used for the frame's next hop to avoid any deadlocks. Additional routing state information can be provided depending on where the frame is along its path, e.g., whether the frame is in its source group, in an intermediate group, or in its destination group. It should be noted that FRF component 400 performs port filtering (described in greater detail below) using permitted ports filter, operational ports filter, busy ports filters, etc. to determine if a preferred port to which a frame is to be forwarded is currently faulty, busy, absent, etc.
Switch 202 distributes load information between switches. The FRF component 400 receives the load measurement of and from its associated output port. The FRF component 400 receives summary load information from its associated input port for a neighboring switch. Each FRF component 400 exchanges load information with all other FRF instances within the same switch. FRF component 400 provides summary load information to its associated output port for delivery to a neighboring switch. Through the load distribution mechanism, each FRF component 400 learns the load measured at each output port of its switch. As well, each FRF learns the summary load information for all neighboring switches.
It should be noted that FRF component 400 can support frame multicasting. When a multicast DFA is received, FRF component 400 determines a set of ports to which the frame associated with the multicast DFA should be forwarded. The set of ports can be determined by accessing a lookup table that maps software-configured multicast fabric addresses to output ports. This can help avoid problems associated with duplicate multicast frame copies.
As noted, multicast traffic is statically routed based on the configuration of the multicast forwarding tables. More specifically, the multicast table identifies the ports of the current switch to which copies of the multicast packet should be forwarded. This implicitly determines the number of copies generated at that point, as well, because for each multicast packet received at a port, only one copy is forwarded to each other port identified by the multicast table as requiring a copy. To prevent duplicate delivery of multicast packets, multicast forwarding filters conditionally prune copies of the multicast packet depending on source group at which the multicast packet originated.
Filtering may be applied to the three categories of candidate ports, e.g., operational port filtering, useable port filtering, and busy port filtering. Port filtering as applied herein can be used to reduce the set of valid ports considered as path candidate ports by identifying and removing absent and/or faulty ports from consideration.
Operational port filtering (or non-operational port filtering) can refer to the removal of non-operational ports from sets of ports being considered as candidates for routing, e.g., preferred minimal path candidate ports 502, non-preferred minimal path candidate ports 504, and non-minimal path candidate ports 506. That is, switch 202 may identify certain ports as being non-operational. These non-operational ports may be reported in a non-operational port mask. It should be noted that in some embodiments, software can force additional ports of switch 202 to be considered as non-operational using a non-operational port CSR, e.g., when a port(s) is to become disconnected as a result of planned maintenance.
Usable (or unusable) port filtering may involve filtering out candidate ports for consideration that would normally have been acceptable, but due to faults within network 100, for example, the candidate ports have become unacceptable/unusable for reaching one or more destination switches, destination groups (of switches), etc., but remain acceptable or usable for reaching one or more other destination switches. In some embodiments, global fault table 406A can be used to block global minimal path port candidates and global non-minimal path port candidates depending on a destination group of the frame being routed. For example, candidate ports that lead to an intermediate group (of switches) without connectivity to a particular destination group (of switches) can be excluded from consideration when routing frames to that destination group, although the same candidate ports may not necessarily be blocked out for other destination groups. The global fault table 406A can be determined or indexed by the global_id field of the frame's DFA.
In some embodiments, an exception list maintained by exception list table 404A may be used to conditionally exclude port candidates depending on the destination group or switch to which the frame is being routed. It should be noted that that exception list table 440A may be used to identify preferred global minimum path ports. Accordingly, use of the exception list table 404A to exclude port candidates is done when it is not being used to identify preferred global minimum path ports.
It should be noted that knowledge regarding which ports are busy in a neighboring switch can be used to determine if the ports that connect to a neighboring switch are poor candidates to receive a forwarded frame based on whether the neighboring switch will subsequently need to forward the frame to a port that is already busy. For example, when considering candidate ports for use in global minimal routing, the ports connected to a neighboring switch are poor candidates if the neighboring switch's global ports that connect to the frame's destination group are all busy, global ports referring to ports that connect to other switches belonging to a different group of switches. Similarly, when in the destination group and considering candidate ports for use in local nonminimal routing, the ports connected to a neighboring switch are poor candidates if the neighboring switch's local ports that connect to the frame's destination switch are all busy.
Accordingly, busy port filtering can be performed by FRF component 400 by using busy port masks to remove heavily loaded ports from being considered candidate ports. It should be noted that in some embodiments, heavily loaded ports are removed from consideration when other candidate ports that are not heavily loaded exist. Otherwise, when non-heavily loaded ports do not exist, busy port filtering will not remove the heavily loaded ports from consideration. FRF component 400 maintains four masks of busy ports, that is, ports whose load exceeds a software-defined threshold: local switch busy port mask; global non-minimal busy global port mask; global non-minimal busy local port mask; remote switch busy port mask. Information from these masks is communicated between switches to populate the remote switch.
A local switch busy port mask can be applied to minimal path candidate ports as well as to local non-minimal path candidate ports. The FRF generates a 64-bit Is_busy_port_mask by comparing each port's local_load to a software defined threshold. Ports with loads higher than this threshold are marked as busy in this mask.
A global non-minimal busy port global mask can be applied to global ports of global non-minimal path candidate ports. The FRF generates a 64-bit gnmbgp_mask by comparing each port's gnmgp_load to a software defined threshold. Ports with loads higher than this threshold are marked as busy in this mask.
A global non-minimal busy local port mask can be applied to local ports of global non-minimal path candidate ports. The FRF generates a 64-bit gnmblp_mask by comparing each port's gnmlp_load to a software defined threshold. Ports with loads higher than this threshold are marked as busy in this mask.
A destination group dependent busy-port mask, obtained from a remote switch busy global port table can be applied to global minimal path candidate ports. Correspondingly, when a frame is being routed in its destination group, a destination switch-dependent busy-port mask, obtained from a remote switch busy local port table can be applied to local non-minimal path candidate ports.
Upon applying the aforementioned filtering or down-selection stage, a set of surviving path candidate ports 508 can result. That is, a reduced number of candidate ports can be determined after removing non-operational and unusable port candidates, heavily loaded, a set of path candidate ports remains. In some embodiments, a pseudo-random selection process is used to further reduce the number of surviving path candidate ports 508 to a determined threshold number of ports associated with each category of candidate ports (preferred minimal path candidate ports, non-preferred minimal path candidate ports, and non-minimal path candidate ports). In some embodiments, that threshold number of candidate ports may be four candidate ports per category. If the minimum threshold number of candidate ports is not met, no candidate ports from that category are removed from consideration.
In some embodiments, this pseudo-random selection (or down selection) of candidate ports can be weighted. That is, weights, e.g., weights between 0 and 15, can be assigned to each port per the CSR configuration. This weighting can be used to influence the probability with which individual candidate ports are chosen such that higher-weighted ports have a great chance of being chosen. For example, a weight of 15 results in a port having 15 times greater likelihood of being selected in the pseudo-random selection process. In some embodiments, candidate ports may be filtered into four groups (GW1, GW2, GW4, GW8) based on their assigned weights, where a candidate port can belong to multiple groups depending on the assigned weight (e.g., a candidate port with weight 1 belongs only a one weight group, while a candidate port with weight 5 belongs to two groups (GW1 and GW4, i.e., 1+4=5), and a candidate port with weight 15 belongs to all four groups (Gw1, GW2, GW4, GW8, i.e., 1+2+4+8=15). The number of candidate ports in each group can be determined (nW1, nW2, nW4, nW8), and pseudo-random selection is applied to each group to select one candidate port from each group (cW1, cW2, cW4, cW8). The weight of each group can be computed, along with their total weight: wW1=nW1; wW2=2*nW2; wW4=4*nW4; wW8=8*nws; wtotal=wW1+wW2+wW4+wW8. A fifth pseudo-random selection can be performed to choose a number j in the range O . . . Wtotal−1. One of the candidates, cW1, cW2, cW4, cW8 is chosen as the down selected candidate port based on the value of j as follows: If j<wW1, choose cW1; else If j<wW1+wW2, choose cW2; else If j<wW1+wW2+wW4, choose cW4; else choose cW8.
The number of ports in each group can vary from request to request due to changing operational status and load, and may also be dependent on the configuration of the global fault table 406A. It may also vary depending on the type of port at which the routing request is being performed, i.e., edge port versus local port, for example. On the assumption that operational status and load do not change too quickly, and that the configuration of global fault table 406A should not vary greatly for different global_id values, each pseudo-random generator's previously generated value is simply used as the offset for biasing its next value. If an offset value is out of range (>n−1), it is brought within range through truncation of upper bits. mgnm=4 candidate ports are produced by the pseudo-random down selection process. Each candidate can be produced through a separate copy of the weighted pseudo-random down selection logic 410C, described above.
It should be noted that the same candidate port may be chosen by more than one of the instances/iterations of the weighted pseudo-random down selection logic 410C, in effect reducing the number of candidate ports that are chosen. The probability of the same candidate port being chosen by more than one of the mgnm=4 global non-minimal, weighted pseudo-random selectors decreases with increasing numbers of candidate ports to choose from. In the context of a dragonfly topology, for example, and a network with full global bandwidth, at an edge port in the source group there are potentially about 48 possible global non-minimal candidate ports: 16 global ports and 32 local ports. If a local hop has been taken, the next hop is a global hop, thereby reducing the number of candidate ports to about 16. However, if the network is tapered such that it only supports one quarter of full global bandwidth, there may only be 4 global candidates to choose from after a local hop has been taken. The probability of selecting four unique global non-minimal candidate ports shows the probability of four unique candidate ports being chosen for varying numbers of possible candidates to choose from. The probability of selecting n unique global non-minimal candidate ports shows the probability of varying numbers of the four selected candidates being unique when there are only 16, 8, or 4 candidate ports to choose from.
FRF component 400 can use received remote switch busy port masks to generate the aforementioned Remote Switch Busy Global Port Table of busy port masks that identify ports connected to neighboring switches that should be avoided as global minimal path candidates based on the destination group to which the frame is being routed. Similarly, the received remote switch busy port masks can also be used to generate the aforementioned remote switch busy local port table of busy port masks that identify ports connected to neighboring switches that should be avoided as local non-minimal path candidates, when routing in the destination group, based on the destination switch to which the frame is being routed.
The rs_busy_port_masks are used in assessing the suitability of neighboring switches (whether ports of neighboring switches are busy or quiet) for reaching specific destination groups via global minimal paths and specific destination switches via local nonminimal paths or via local minimal paths. Each FRF instance corresponding to a local port or a global port can be configured to generate a 64-bit rs_busy_port_mask. The generated mask is delivered to the partner switch connected to that port. Similarly, the partner switch can also generate and return an rs_busy_port_mask.
Each FRF instance communicates the rs_busy_port_mask, that it received from its partner switch, to all other FRF instances in the switch using the port status ring (which connects the tiles of a switch and communicates status and load information amongst the ports on the switch). Each FRF instance captures all rs_busy_port_masks such that all FRF instances learn the remote busy port status being provided by all neighboring switches. Each FRF instance uses the rs_busy_port_masks that it receives to generate the busy port tables described in the Remote Switch Busy Global Port (RSBGP) Table and Remote Switch Busy Local Port (RSBLP) Table.
Generation of the rs_busy_port_mask is a two-step process. The first step is to compare each port's local_load to a software configurable generating an intermediate mask of all ports that are individually busy. This intermediate mask is formed as the status of each port is received from the port status ring interface. Ports that are classified as non-operational are also recorded as busy in the intermediate mask. The second step takes link bundling into account such that a port is only marked as busy in the rs_busy_port_mask if it and all other ports, that are part of the same bundle, are marked as busy in the intermediate mask. Either all ports that are members of the same bundle are marked as busy in the rs_busy_port_mask, or none are. Global ports that are part of the same bundle all connect to the same remote group. Local ports that are part of the same bundle all connect to the same remote switch within the current group.
As the rs_busy_port_masks are used to determine whether the switch that generated the mask is a good candidate for routing a frame to another group or to another switch in the current group, bundling is used to provide a consistent view of the generating switch's suitability when the busy status across its links, that connect to the destination group or to the destination switch in the current group, is inconsistent. The rationale for the treatment of bundling described here is that the switch generating the rs_busy_port_mask remains a candidate for reaching the destination group, or the destination switch in the current group as long as it has at least one link to the destination group or switch that is not busy; adaptive routing at the switch that generated the rs_busy port_mask should direct the frame to the non-busy link.
Ports must be included in either the bundled ports mask CSR or the unbundled ports mask CSR (both of which are part of the static description of the wiring) in order for them to be marked as busy in the rs_busy port_mask. The second step is performed as each frame is received from the port status ring. The bundled port masks are scanned to identify the bundles and the ports that they contain. In addition, the unbundled port mask is consulted to identify any other ports, that are not members of a bundle, but whose busy status should also be included in the generated rs_busy_port_mask.
A different software-defined threshold is used in computing the rs_busy_port_mask because of the larger latency involved in communicating and processing the rs_busy_port_mask and in delivering a frame subject to this mask to the remote switch that generated the mask. Because of the larger latency, it may be useful to require a port to be more loaded before it is considered to be so busy that it is not a good candidate for receiving additional frames from a remote switch. A busy remote port should be sufficiently loaded such that it remains loaded throughout the time it would take to receive a frame that has been subject to the mask.
The aforementioned RSBGP table stores busy port masks indexed by destination group (global_id). Again, the RSBGP table is used in the evaluation of global minimal paths consisting of a hop to a neighboring switch which has a global port connected to the destination group to filter out ports of the current switch which are poor choices for use in reaching the destination group because the corresponding global port or ports, of the neighboring switch reached by the filtered-out ports of the current switch, are too heavily loaded.
The RSBLP table stores busy port masks indexed by destination switch (switch_id), and again, can be used in the evaluation of local non-minimal paths consisting of a local hop to a neighboring switch followed by another local hop to the destination switch. For topologies, such as fat-tree, where a local minimal path can consist of a local hop to a neighboring switch followed by another local hop to the destination switch, the RSBLP Table can also be used in the evaluation of local minimal paths. The RSBLP table is used to filter out ports on the current switch which are poor choices for use in indirectly reaching the destination switch because the neighboring switch's port or ports that connect to the destination switch are too heavily loaded.
It should be noted that the RSBGP table and the RSBLP table are never both accessed for the same routing request. The former is accessed when routing a frame that is not in the destination group, and the latter is accessed only when routing a frame that is in the destination group. Therefore, both are implemented within the same memory, termed the Remote Switch Busy Port
Provided that there is at least one valid candidate port, the various busy port filters (Busy Ports Filter, Local Non-Minimal (LN) Busy Port Filter, Global Non-Minimal (GN) Busy Port Filter) may not be allowed to collectively block all candidate ports. If there are viable candidate port choices, they are allowed, despite being “poor” choices, if there are no better choices. Otherwise, an empty route response will be generated for the routing request when routes are actually available.
To prevent an incorrect empty route response from being generated, the first stage of the preferred and non-preferred minimal path busy port filters (
It should be noted that there will be no minimal path candidate ports if minimal routing is disabled (Permitted Ports Filter). There will be local non-minimal path candidate ports only if local non-minimal routing is enabled (Candidate Local Non-Minimal Path Ports). There will be global non-minimal path candidates only if global non-minimal routing is enabled (Candidate Global Non-Minimal Path Ports). Local and global non-minimal routing are generally not both enabled simultaneously. When the first stage of the preferred and non-preferred minimal path busy port filters and the local non-minimal busy port filter are disabled due to the conditions described above, the only candidate ports that will be seen at an adaptive selection stage (described below) will be poor candidates because they will all be ports that lead to other switches whose ports (that connect to the destination group or to the destination switch) are heavily loaded. This is because these are the only candidate ports that were being blocked by the filters that are being disabled and, without these filters being disabled, there are no other candidates.
The adaptive selection stage will choose between these remaining/surviving candidate ports, which are all poor, based on their biased local loads (Local Load and Load Value Selection), although their local loads will not necessarily reflect the reason why they are poor. Their poor character can be the result of high downstream load on certain ports of the other switches reached by these candidate ports. It is because the adaptive selection stage may not be able to see how poor these candidates are that the coordination between the different busy port filters, described herein may be used. If each busy port filter decides independently whether or not to disable its RSBGP Table and RSBLP Table-based filters, situations such as the following could occur. The non-preferred minimal path busy port filter might produce one or more candidates, which are not poor, without any of its filter stages disabled. The preferred minimal path busy port filter might only be able to produce one or more candidate ports by disabling both of its filter stages. Thus, all of the candidate ports it is able to produce are poor. At the adaptive select stage, the down-selected, not poor, non-preferred minimal path candidate ports, are compared against the down-selected, poor, preferred minimal path candidate ports. However, the adaptive selection stage lacks visibility into how poor the preferred minimal path candidates are, so it may select a poor preferred minimal path candidate over a not poor non-preferred minimal path candidate.
An alternative to the busy port filter coordination mechanism described herein, would be for all of the busy port filters to act independently, but for the minimal path and the local non-minimal path busy port filters to each forward a signal through to the adaptive select stage to indicate if their respective candidate ports are poor choices due to busy ports at downstream switches. If they are, the adaptive selection function may de-prioritize their candidate ports in favor of other ports. The result would be the same as is achieved by the coordination, described herein, between the various busy port filters.
As illustrated in
In some embodiments, preferred minimal path candidate ports are preferentially selected over non-preferred minimal path candidate ports, and minimal path candidate ports are to be preferentially selected over non-minimal path candidate ports. To accomplish this preferential selection, a bias value can be added to each candidate port's load before the adaptive selection comparison is performed. The bias value used can be configured using CSRs, and can vary depending on the type of path to which it is being applied (i.e., non-preferred minimal, preferred minimal, and non-minimal), the traffic class of the frame being routed, and where the frame is along its path. For example, frames belonging to a low-latency traffic class can be more strongly biased towards minimal paths versus frames in other traffic classes to have a greater likelihood of achieving/comporting with low-latency requirements or needs. Frames may also be increasingly biased towards minimal path routes the closer the frames are to their destination.
It should be understood that each biased load value (9-bit wide) is obtained by adding an unsigned (8-bit wide) bias value to an unsigned (8-bit wide) port load value. To determine the bias value and the type of load value that applies to each candidate, the preceding minimal port selection and non-minimal port selection stages separate the candidate ports into three different categories. Bias value are obtained from a software configurable table, i.e., bias table 414A (described in greater detail below). The type of load value to be used for each port is determined, and result in minimal preferred candidate ports (which include edge port candidates, if any exist), non-minimal candidate ports (either global or local non-minimal candidates depending on the configuration of routing algorithm table 408), where a set of global non-minimal candidate ports can include both global and local ports, while a set of local non-minimal candidate ports include only local ports. Depending on the point where the routing request is being performed, along the path between the source and destination edge ports, a category might not contain any candidates. For example, when at the destination switch, with typical configuration only the minimal non-preferred category will contain any candidates for unicast traffic.
To enable the bias to change as a frame progresses toward its destination as well as to allow the bias to be dependent on the frame's FTag, the bias table 414A's entries are indexed by both the frame's point along its path (e.g. at the source group, at an intermediate group, at the destination group) and by its FTag bias class. The FTag bias class is a value derived from the frame's FTag value. Each entry in the bias table provides three bias values: one used for minimal preferred candidate ports, one used for non-preferred minimal candidate ports, and one used for non-minimal candidate ports.
In some embodiments, biased load override is also implemented, where if a candidate category's bias value, obtained from the bias table 414A, is the maximum possible bias value, that category is handled differently than it would be handled for other bias values. In particular, ports, to which the maximum bias value is being applied, are never chosen, regardless of their load, unless there are no other choices available. However, if the maximum possible bias value is being applied to all available ports, then the available port with the lowest biased load is chosen; the different handling, associated with the maximum possible bias value, is overridden in this case.
In particular, load values represent the busyness of switch 202's ports and are used in evaluating the load-based port masks and in comparing candidate ports during the adaptive route selection process. Load-based port masks are used in the busy port filters to remove ports that are poor candidates, based on current load, from the set of candidates being considered. There are a number of different types of load values used within the switch and some are communicated to neighboring switch devices. These load values are described in the following sections, noting that
Several load metrics are computed and used in determining which port to route a frame when there is more than one port to which the frame can be routed. The load metrics are also used in generating busy-port masks, which as described above, are used to remove heavily loaded ports from consideration.
There are five load metrics described herein: local load; group load; global non-minimal global port load; mean global load; and global non-minimal local port load.
Regarding local load, the load of each of a switch's output ports (e.g., output ports 220c of switch 202) is continuously being evaluated and provided to the corresponding FRF instance as the 8-bit value local_load. Larger values represent higher load. The current load present at each output port is measured by the output control age queue block. The output port load is provided by each age queue instance to the FRF instance (of FRF component 400) that is associated with the input side of the same port. The load value provided to the FRF is an 8-bit value termed the local_load. The age queue determines the local load based on a combination of the amount of traffic enqueued, waiting to go out that port and the amount of traffic enqueued at the opposite side of the link in the link-partner Switch device's input buffer. The calculation and configuration of local_load is performed later. Each FRF instance distributes the local_load value it receives from its associated age queue instance to all other FRF instances. In this way, each FRF instance learns the current local_load of every output port.
When the port loads of candidate ports are being compared to determine the best port to route a frame to, it is the port's local_load value that is used for ports being considered for minimal path routing, and for ports being considered for local non-minimal path routing.
Group load is a measure of how suitable a dragonfly group is for use as the intermediate group in a global non-minimal path. The 8-bit group load value is not computed by a switch, such as switch 202, but is software-configurable. Software might use a measure of the network injection load present across the input side of the group's edge ports in deriving the group_load value, or might determine the group_load value based on a policy of discouraging use of certain groups as non-minimal intermediate groups, perhaps based on the jobs or services that are running in the groups. That is, the group_load value is intended to be representative of the amount of local traffic within a group.
A network management stack sets the group_load value by periodically writing to a CSR. The software-configured group load value is communicated across global links. FRF instances associated with global links forward the group_load value that they receive from their link-partner in the group at the opposite side of the link, to all other FRF instances in the switch. In this way, each FRF instance learns the group load values of the groups at the opposite end of each of the global links terminated by the switch.
In terms of global non-minimal global port load (gnmgp_load), this load is a metric used in assessing a global port's suitability for use in directing a frame to the intermediate group reached by the global link connected to the global port. The gnmgp_load is nominally equal to the maximum of the global port's local_load and the group_load value being received from the group reached by the global link. However, through field G-NMGP_EN_GRP LD in CSRR_TF FRF_CFG-_LOAD_CTRL, the group_load component can be excluded.
When the port loads of candidate ports are being compared to determine the best choice port to route a frame to, it is the port's gnmgp_load value that is used for global ports being considered for global non-minimal path routing.
Mean global load (mean_global_load) is intended for use in assessing a switch's suitability for use in reaching any intermediate group that is directly connected to that switch. The mean_global_load value is an 8-bit value equal to the arithmetic mean of the gnmgp_load values of all of the switch's global ports. Ports that are classified as non-operational by either hardware or software are excluded from the calculation. The ports to include in the mean_global_load computation are determined from CSR R TF FRF CFG GNM global ports.
For any port whose load is included in the mean_global_load computation, if a group_load value is not being received for that port from the port status ring, either because link partner data is not being received for that port or because the link partner data that is being received is not global link data, the contribution of that port to the mean_global_load is based solely on that port's local load. It should be understood that the aforementioned port status ring communicates status and load information amongst the ports on a switch (e.g., input and output ports 220b and 220c, respectively, of switch 202). The computed mean_global_load value is communicated across local links. FRF instances associated with local links forward the mean_global_load value, that they receive from their link-partner in the local switch at the opposite side of the link, to all other FRF instances in a switch. In this way, each FRF instance learns the mean_global_load values of the local switches at the opposite end of each of the local links terminated by the switch, and can use these values in global non-minimal path selection.
Global non-minimal local port load metrics are computed by each FRF instance, distributed between ports in a switch using the port status ring, and distributed between switches. The global non-minimal local port load is a metric for use in assessing a local port's suitability for use in directing a frame to an intermediate group of a global non-minimal path. The global non-minimal local port load takes into account the load on the local port as well as the suitability of the local group switch, to which the port connects, for use in reaching an intermediate group. A port's gnmlp_load value is equal to the maximum of the port's local_load and the mean_global_load reported by the port's partner switch. Through software configuration it is possible to remove the mean_global_load component such that a port's gnmlp_load becomes simply equal to its local_load.
The gnmlp_load value is an 8-bit value. The computed gnmlp_load value is based on the local_load and mean_global_load values distributed via the port status ring. Each FRF instance computes the gnmlp_load value for all of its switch's ports at which link partner data for a local link is being received. If load status information is not being received from a port's partner switch, the gnmlp_load value for that port is set equal to the port's local_load.
For ports at which link partner data for a global link is being received, the port's gnmlp_load value is set to the value computed for gnmgp_load. This is a side-effect of an implementation optimization in which the same storage is used for gnmgp_load and gnmlp_load since, for any given port, at most one of the two is valid. The global non-minimal local port load metric is not used on ports where global link partner data is being received.
The fabric routing process described in the preceding subsections is performed for every frame received. The switch determines whether to perform packet-by-packet adaptive routing (using this value) or flow based adaptive routing (where this value is used for the first packet in each flow) according to the ordering requirements of the traffic.
As has been described herein, a switch, such as switch 202 supports minimal and non-minimal path routing in a network. In some embodiments, as alluded to above, the network may have a dragonfly topology. Dragonfly routing is hierarchical, distinguishing between local destinations (those in same group as source) and global destinations. Thus in a dragonfly network, a switch routes to a destination group and then to a switch within that group using two tables rather than to individual destinations using one large table.
It should be understood that minimal paths are based on the destination. If a destination NIC is local, an output port that connects to the destination switch is selected. If the destination is in another group, the packet is routed to a switch within the local group that is connected to the destination group. In a large system, there may only be one such path, but in a small system there are likely to be many, some connected to the input switch and others to switches elsewhere within its group. The input switch selects between them.
The candidate ports considered for minimal path routing are further divided into preferred and nonpreferred sets of ports where ports in the preferred set may lead to a path containing fewer hops. Non-minimal paths route packets via an intermediary switch, referred to as a root switch. Root switches are selected on a packet-by-packet basis or a flow-by-flow basis depending on the ordering requirements of the traffic.
Non-minimal traffic is routed “up” to the root switch, and then minimally “down” to the destination. In some embodiments, intermediate root switches are selected at random so as to distribute load uniformly. The network, e.g., network 100, provides control over intermediate group selection enabling traffic to be routed towards intermediate groups that are known to be lightly loaded or away from those that have specific function or are known to be heavily loaded. Root switches may be distributed over all groups, where a non-minimal path may detect a root switch in the source group, the destination group, or any intermediate group. Global non-minimal routes take an indirect path through a root switch in an intermediate group. These paths require two global hops, one from the source group to an intermediate group, and one from the intermediate group to the destination group. Global non-minimal paths require up to three local hops, one in each group. The maximum path length is five switch-to-switch hops, whatever the system size.
Minimal routing is to be preferred as the paths are shorter, and hence the load on the network is lower. However, minimal routing alone will result in poor performance on some traffic patterns, for example when all nodes in one group communicate with nodes in one other group. Achieving good performance across a wide range of traffic patterns requires a mix of minimal and non-minimal routing.
At each hop along a frame's path, the routing modes that may be used to advance the frame along its next hop are controlled by the configuration of the FRF routing algorithm table 408. When a frame is received at a switch input port, the types of paths along with the frame may be forwarded is determined: local minimal, global minimal, local non-minimal, and global non-minimal. The set of output ports to which the frame may be forwarded is determined by the type of paths allowed at that point.
The types of paths that are allowed to be taken depends on where the frame is at along its journey between its ingress and egress ports of the network. The path types are as follows. Local minimal paths select links that are directly connected to the frame's destination switch and may be used when the frame is in its destination group. Global minimal paths may be used when the frame is not in its destination group and select either global links that directly connect to the frame's destination group or local links that connect to a switch that has working global links that directly connect to the frame's destination group. Local non-minimal paths may be used when the frame is in its destination group, or when the frame is in an intermediate group. Local non-minimal paths select local links connected to other switches in the group without regard for the frame's destination. When in the destination group, it must be possible to reach the frame's destination switch within one more hop after taking the local non-minimal hop. When in an intermediate group, it must be possible to reach a switch with a working global link that connects to the frame's destination group within one more hop after taking the local non-minimal hop. Local links, that connect to switches from which this in not possible, must not be selected.
Global non-minimal-paths may be used when the frame is in its source group and is not in its destination group. Global non-minimal-paths select either global links connected to other groups or local links connected to other switches in the source group without regard for the frame's destination. Global links must only be selected if they connect to a group that has working links connecting it to the frame's destination group. Similarly, local links must only be selected if they connect to switches that have global links that are, themselves, valid global non-minimal path choices.
Adaptive routing selects between minimal and non-minimal paths (described above) according to their current load.
In terms of minimal routing, when in the destination group, but not at the destination switch, local minimal routes are generated by looking up the switch_id field of the destination fabric address in a local switch minimal table (
Global minimal routes are generated by looking up the global_id field of the destination fabric address in a global minimal table (
Local minimal paths take at most one switch-to-switch hop, from the source switch to the destination switch, both of which are within the same group. There can be several such paths. Local non-minimal paths take two switch-to-switch hops, from the source switch to an intermediate switch, known as the Root switch, and from there to the destination switch. There are many such paths.
Global minimal paths take one global hop from the source group to the destination group. There is at most, one local hop in each of the source and destination groups. Global minimal paths require a maximum of three switch-to-switch hops whatever the system size.
In certain system configuration in which there are multiple global links connecting a source group to a destination group, a bias can arise such that the proportion of traffic injected at the source group that is distributed to each of the global links is not equal. As an example, consider the case of switch A, B, and C, all in the group X, with switch B having three global links connecting it to group V and switch C having two global links connecting it to group V. If traffic injected at switch A, destined for group V, is equally distributed between switch B and C, each of the two global links of switch C will be more heavily loaded than each of the three global links of switch B.
To enable the bias to be counteracted, the Global Minimal Table can be divided into several blocks, each of which is capable of generating a valid set of global routing choices for any destination group. On a frame by frame basis, the block that is used to service the request is pseudo-randomly selected by the FRF. Within each Global Minimal Table block instance, only a subset of the possible candidate ports that can be used to reach the destination group are populated. The subset is chosen in such a way so as to counteract the bias. The populated subsets can be varied across the different block instances such that all possible candidate ports are able to be used.
A global minimal path between an edge port in one group and an edge port in another group can require one, two, or three hops across fabric links. One hop if the switch containing the ingress edge port in the source group has a global link directly connecting it to the switch containing the egress edge port in the destination group. Two hops if the frame traverses a global link between the two groups that is connected directly to either the ingress switch in the source group or to the egress switch in the destination group. In this case, one hop across a local link in either the source group or the destination group is also required. Lastly, three hops are required if the frame traverses a global link that is not directly connected to either the ingress switch in the source group or to the egress switch in the destination group. In this case, a hop across a local link is also required in both the source and destination groups. The local link hop in the source group takes the frame from the ingress switch to the source group switch that is connected to the global link. The local link hop in the destination group takes the frame from the destination group switch that is connected to the global link to the egress switch.
When identifying minimal path candidate ports, the FRF is able to classify the candidates into a set of preferred ports and a set of non-preferred ports. The preferred ports are those that allow a global minimal path requiring two, or fewer fabric link hops. The non-preferred ports are all of the minimal path candidates that are not classified as preferred. Use of preferred paths, when available, and when not too heavily loaded reduces the average load on the system's local fabric links as it reduces the average number of local fabric links traversed per frame. Use of a preferred path may also reduce the end-to-end fabric latency experienced by the frame.
When performing local non-minimal routing, any local link can be a candidate. However, some local links may need to be excluded from consideration if they lead to a switch from which it may not be possible to reach the destination because of link or switch failures that exist within the system. A CSR controls which ports are candidates for local non-minimal path routing.
When performing global non-minimal routing, generally any global link can be a candidate. Additionally, generally any local link that reaches a switch with operational global links can also be a candidate. However, some links may need to be blocked from consideration if they lead to a switch or to a group from which it may not be possible to reach the destination group because of link or switch failures that exist within the system. CSRs control which ports are candidates for global nonminimal path routing.
When selecting a candidate port to use for global non-minimal routing, if all candidate ports, global and local, are equally likely to be selected, for many system configurations globally non-minimal traffic will not be evenly distributed among the global links leaving the group. Consider, for example, the situation of three switches, A, B, and C within a group, where each switch is connected to each other switch by four local links, and switch A and switch B each terminate 14 global links and switch C terminates 16 global links. Ingress traffic arriving at an edge port of switch A may be routed globally non-minimally to any of the global or local links terminated by switch A. If it is equally likely to be routed to any of these links, then each global link terminated by switch B will receive only 4/14th (4 local links reaching 14 global links) of the traffic routed to each global link terminated by switch A. Similarly, each global link terminated by switch C will receive 4/16th (4 local links reaching 16 global links).
To counteract this potential bias in the distribution of globally non-minimal traffic among a group's global links, when the set of global non-minimal candidate ports is being pseudo-randomly down selected to the small number of ports that will participate in the adaptive routing stage, a weighting can be applied to each of the candidate ports such that some will be more likely than others to survive the down-selection process.
Adaptive routing selects between these minimal and non-minimal paths based on their load. Adaptively routed traffic starts on a minimal path, diverting to a non-minimal path if the load on the minimal path is high (this is known as progressive adaptive routing). Such paths are said to have diverged.
A non-minimal path can be selected at the injection point or at the exit router in a source group. A local non-minimal route may be taken within the source group, an intermediate group, or a destination group if it is selected as the intermediate. Dragonfly routing algorithms allow a non-minimal path in both the intermediate and destination groups (consider a case where all traffic incoming on the global ports of a particular router is destined for NICs on another router in the group). In general however, non-minimal traffic is sufficiently well distributed as to avoid this happening, but an additional hop in the destination group may still be beneficial in cases where there is an error on a local link. Having arrived at the intermediate group the packet may take either a minimal route to the destination group or a local non-minimal route to a switch with a path to the destination group.
Again, this decision is made based on load. Having taken a hop within the intermediate group the packet must detect root and take a minimal path to the destination. Adaptive decisions are made based on load and a bias towards preferred, minimal, or non-minimal. A routing algorithm, as described above, increases the bias towards minimal paths the closer a packet is to its destination. This algorithm prefers a direct path across the intermediate group provided the load is low.
Restricted routing is used at points other than injection and root detection to prevent packets from flowing back in the direction from which they came. In a switch, cases in which a packet has taken one hop from points of injection and root detection are detected and ensured that a global port is taken. For local minimal routing, having taken a hop from the root, the packet will arrive at a switch that is connected to the destination NIC. For global minimal routing, having taken a hop from the point of injection, the packet will arrive at a switch with a global link, which must be taken. In the intermediate group, packets are allowed to take a local hop at the point of injection and having detected root. Having taken this hop, the packet will arrive at a switch that is connected to the destination group, this path must be taken.
When passing information from switch to switch, it is necessary to make instantaneous decisions about the next hop on the path. Decisions are taken using information derived from local state and information that is communicated from neighboring switches. Use of information from many different sources allows for more accurate/effective decisions. This includes information from neighbors.
Prior systems carried information on average load from switch to switch. That said, more detailed information from related or neighboring switches is more helpful. In the current switch ASIC, a set of values can include information indicative of the status of output ports of related/neighboring switches. By passing this set of values, much better routing decisions can be made. In one example, a flag is passed back from neighboring switches, with the flag having one bit for each output port. For example, with a switch having 64 outputs, a 64 bit flag would be transmitted. This is much more accurate than simply passing a global average for neighboring ports.
Network switches support fat-tree networks with two or three stages. In a typical system cabinet-level sub-tree structures contain between 32 and 256 endpoints connected by one or two stages of switches. In a full bandwidth network each stage of switches has equal numbers of links down towards the endpoints and up to the higher stages of switches.
The sub-trees are connected by Core switches, with each Core switch connected to all the sub-trees. In a full bandwidth network with N endpoints per sub-tree there are N uplinks from the sub-tree to the Core switch.
The top stage (a Core switch) has 64 down links. In a full bandwidth fat-tree the lower stages have 32 up links and 32 down links. In a tapered fat-tree the lower stages may have 48 or more down links and 16 or fewer up links. The range of supported fat-tree topologies is set out in the following table. Note that the number of nodes per switch varies with the number of stages and the taper, as compared to a constant of 16 with dragonfly.
In various embodiments selected functionality is added to the network fabric at an its edge (i.e. at an ingress port or edge port). A translation function is performed at the edge port to classify the packets as LAG packets or ECMP packets. The headers of received packets are parsed and fields in the headers, such as destination addresses, are compared to an array of values stored in a translation table. Some of these values can be associated with a LAG or may be translations setup for an implementation of ECMP. If a match occurs against one of these translation rules, a lookup is carried out in a related translation lookup table, which indicates the LAG/ECMP function is needed and also returns a base pointer and a width value that will be used by the LAG/ECMP function. A configurable combination of the parsed header fields are fed into a distribution function which generates a hash value. This hash distribution value can combine the MAC address, IP address and/or port address of the packet header using a Cyclic Redundancy Check (CRC) function to compress these fields into 16-bit number with a uniform distribution. This 16-bit hash value is multiplied by the width value. The upper bits of the multiply result (bits 16 and above) will be in the range 0 to (width−1). Because the lower 16 bits of the multiply result are not required a synthesized parallel multiplier can optimize away most of the hardware multiplier array. The upper bits of the result are added to the base pointer to form an index into another table that stores destination port addresses. These destination port addresses are the member ports of the LAG or are valid destination ports for the ECMP protocol. System software loads each LAG/ECMP destination port addresses directly into this table where each LAG/ECMP configuration uses the entries in this final lookup table from their respective base pointer to their base pointer+width−1.
A machine-readable storage medium, such as machine-readable storage medium 804, may be any electronic, magnetic, optical, or other physical storage device that contains or stores executable instructions. Thus, machine-readable storage medium 804 may be, for example, Random Access Memory (RAM), non-volatile RAM (NVRAM), an Electrically Erasable Programmable Read-Only Memory (EEPROM), a storage device, an optical disc, and the like. In some embodiments, machine-readable storage medium 804 may be a non-transitory storage medium, where the term “non-transitory” does not encompass transitory propagating signals. As described in detail below, machine-readable storage medium 804 may be encoded with executable instructions, for example, instructions 806-812.
Hardware processor 802 may execute instruction 806 to receive a data transmission comprising a plurality of packets at an edge port of the network. Hardware processor 802 may execute instruction 808, to access a routing table to determine routing for the data transmission. Hardware processor 802 may execute instruction 810, to select the route based on the routing table. The routing table includes entries to effect routing decisions based upon a destination based hash function. Hardware processor 802 may execute instruction 812 to route the data transmission through the network with routing decisions based upon the routing table.
The switch supports fat-tree networks with two or three stages. The top stage (spine switch) has 64 down links. In a full bandwidth fat-tree the lower stages have 32 up-links and 32 down-links. In a tapered fat-tree the lower stages may have 48 or more down-links and 16 or fewer up-links. Note that the number of nodes per switch varies with the number of stages and the taper, as compared to a constant of 16 with Dragonfly.
Geometry is the Links down per switch in each stage: E or S×E or S×M×E, where S, M, E are the number of down-links of each spine, middle, edge switch. Switches in each stage is E or S:E or S:M:E, where S, M, E are the number of switches in the spine, middle, edge stages. Taper is the Ratio of up-links per switch to down-links per switch, “none” means the number of up-links is the same as the number of down-links for all stages. EU:ED or MU:MD:ED, where MU, MD, EU, ED represent middle up-links, middle down-links, edge up-links, and edge down-links. As each edge switch 912 up-link connects to a middle switch down-link, EU=MD.
Fat tree routing can be performed using the minimal tables. Frames are routed adaptively up the tree from the leaf switches towards the spine switches and then deterministically down to the destination.
The number of spine switches per group is equal to the number of middle switches, per group, within the groups that contain the middle and edge switches. It is, therefore, dependent on the taper implemented at the edge switches. Here, 32 with no taper. The maximum number of middle switches per group depends on the taper implemented at the edge switches. Here, 32 with no taper, and 16 with 3 edge links per edge switch up-link. The maximum number of edge switches per group depends on the taper implemented at the middle switches. Here, 32 with no taper, and 48 with 3 down-links per middle switch up-link.
Groups are formed from the sets of edge switches 912 and middle switches 916 that are interconnected. Local routing is used within these groups. Global routing directs frames to the correct group. For small systems, the groups are formed from the endpoints of each leaf switch. The tables in
This scheme supports the full range of three-stage networks shown in Switch Fat Tree Networks (see Table 3). Two-stage networks can be formed using online local routing within a single group.
The fabric routing configuration of a Switch device depends on the number of stages in the fat-tree network and on the stage within the network at which that device is located. The following sub-sections describe how Switch can be used to support, three, two, and one stage fat-trees. The routing functionality provided by the Switch of Dragonfly routing, can also be applied to other network topologies including fat-tree.
As noted, in a fat-tree network, bottom groups are formed of the sets of edge-level switches 912 and middle-level switches 916 that are interconnected. Switches at the spine-level are also organized into groups (spine groups), where the number of switches per spine group is equal to the number of middle switches 916 per bottom group and the number of spine groups is equal to the number of up-links per middle switch. This organization has the following characteristics.
Each edge switch 912 connects to each middle switch 916 within its group, and vice versa.
Each middle switch 916 connects to one switch in each spine group.
Each spine switch 918 connects to all bottom groups. Therefore, each bottom group also connects to all spine switches.
The maximum number of bottom groups is equal to the number of down-links per spine switch: 64. The maximum number of spine groups is equal to the number of up-links per middle switch: 32 if there is no taper at the middle switches, fewer if there is a taper. Therefore the maximum number of groups of all types is 96.
The maximum number of edge switches 912 per bottom group is equal to the number of down-links per middle switch: 32 if there is no taper at the middle switches, but up to 63 with the greatest possible taper. Tire maximum number of middle switches 916 per group is equal to the number of up-links per edge switch: 32 if there is no taper at the edge switches, fewer if there is a taper. Therefore the maximum number of switches per bottom group is 95.
The maximum number of switches per spine group is equal to the number of middle switches 916 per bottom group: 32 if there is no taper at the edge switches, fewer if there is a taper.
Almost all traffic within the fat-tree network is expected to be traffic from one edge port to another.
All variations of three-stage fat-tree networks, can be implemented with seven significant bits configured for both the global_id and the switch_id.
global_id values between 0 and 63, inclusive, are used to identify the bottom groups.
global_id values between 64 and 127, inclusive, are used to identify the spine groups.
switch_id values between 0 and 63, inclusive, are used to identify the edge switches 912 within the bottom groups.
switch_id values between 64 and 127, inclusive, are used to identify the middle switches 916 within bottom groups.
switch_id values between 64 and 127, inclusive, are used to identify the switches within spine groups.
To support in-band management traffic between Local Management Processors (LMPs) distributed throughout the network, potentially at every switch in the network, the switch can be configured to also allow traffic to be routed from any port of any switch in the network to any port of any switch in the network.
To support the routing of management traffic to specific spine switches, each spine switch's switch id—value must be the same as the switch—id value of all of the middle switches 916 to which it connects. This restriction arises because there is no direct connectivity between spine switches. The down-links of the edge switches 912 are, naturally, configured to be edge links. The links that interconnect the switches within a bottom group are the up-links of the edge switches 912 and the down-links of the middle switches. These links are configured to be local links. The middle switch uplinks and all spine switch links are configured to be global links.
For routing between edge switches, when a frame is already in its destination group, local routing is used to direct the frame to its destination switch within the group and to its egress port of the destination switch. When a frame is not in its destination group, global routing is used to direct the frame toward its destination group.
For local routing toward an edge switch, when at an edge switch 912 in the destination group, but not at the destination edge switch, minimal routing, using the Local Switch Table, is enabled by the Routing Algorithm Table. A Local Switch Table entry corresponding to the destination switch is used to select candidate up-links. In the absence of faults within the network, when the destination switch is another edge switch, all uplinks are candidates.
When at a middle switch 916 in the destination group, minimal routing, using the Local Switch Table, is enabled by the Routing Algorithm Table. The Local Switch Table entry corresponding to the destination switch is used to select candidate down-links. In the absence of faults that cause there to be no connectivity between the middle switch 916 and the destination edge switch 918, the set of candidates consists of only the link or links that connect directly to the destination edge switch.
When at the destination switch, minimal routing, using a Local Port Table, is enabled by the Routing Algorithm Table. The Local Port Table entry, that corresponds to the endpoint_id in the frame's Destination Fabric Address (DFA), is used to select the frame's egress port, or set of candidate egress ports.
For global routing toward an edge switch 912, when at an edge switch 912 in a group that is not the destination group, the frame must be directed to an up-link of the edge switch 912. In the absence of faults within the network, the frame can be routed to any up-link. Either global minimal or global non-minimal routing can be used to select the set of candidate up-links. If global non-minimal routing is used, the adaptive choice between the edge switch's up-links will be based on the link's Global Non-Minimal Local Port (GNMLP) load. This has the benefit of allowing the mean load of the middle switches' up-links (global links) to be factored into the choice of which up-link of the edge switch 912 is chosen. By doing this, the middle switches, whose up-links are less heavily loaded, will be favored.
To enable global non-minimal routing at an edge port, global non-minimal routing must be enabled in the port's Routing Algorithm Table. The mask that controls which local ports are candidates for use for global non-minimal routing, must be configured to select the allowed up-links. In the absence of faults in the network, all up-links are allowed. For fat-tree networks, the adaptive routing bias, for non-minimal port selections, should be configured the same as it is for minimal port selections.
When at a down-link (local port) of a middle switch, minimal routing using the Global Table is enabled by the Routing Algorithm Table. The Global Table entry corresponding to the destination group is used to select candidate up-links. In the absence of faults in the network, all up-links (all global links) are candidates when routing to a bottom group.
When at a spine switch, minimal routing using the Global Table is enabled by the Routing Algorithm Table. The Global Table entry corresponding to the destination group is configured to select candidate down-links. When the destination group is a bottom group, the set of candidate downlinks consists of only the down-link or links that connect directly to the destination group.
On reaching the up-link of a middle switch 916 of the destination group, local routing is used to direct the frame to its destination switch and egress port.
For routing to or from a non-edge switch, frames can be routed between the management processors in each of the switches using the same mechanisms.
For application of the remote switch busy port functionality, the switch's Remote Switch Busy Port (RSBP) functionality provides a mechanism to allow the loads at the ports of neighboring switches to affect routing decisions made at the current switch. This can be used in situations when, at the current switch, there is a choice of which neighboring switch to route through to reach a particular destination group or a particular destination switch. Particular neighboring switches can be avoided if their links to the destination group or switch are heavily loaded.
Within the three-stage fat-tree network, there are two places where the RSBP functionality can be beneficially applied:
RSBP application when routing between bottom groups. When at a middle switch 916 and globally routing to a different bottom group, particular spine switches can be avoided if their links to the destination group are heavily loaded.
RSBP application when routing between edge switches. When at an edge switch 912 and routing locally to a different edge switch 912 within the same group, particular middle switches 916 can be avoided if their links to the destination edge switch 912 are heavily loaded.
A two-stage fat-tree network can be implemented as a single one of the bottom groups shown in
Each edge switch 912 connects to each spine (middle) switch (916), and vice versa.
The maximum number of edge switches 912 is equal to the number of down-links per spine (middle) switch: 64. Spine (middle) switches have no up-links.
The maximum number of spine (middle) switches is equal to the number of up-links per edge switch: 32 if there is no taper at the edge switches, fewer if there is a taper. The maximum number of switches in the network is 96.
In a two-stage fat-tree network the down-links of the edge switches 912 are, naturally, configured to be edge links. The edge switch 912 up-links and spine switch down-links are configured to be local links.
Routing for the two-stage network is implemented with minimal routing using the Local Switch Table to route between switches and the Local Port Table to identify the egress port once the destination switch has been reached. The routing configuration is a subset of that required for three-stage networks.
A one-stage fat-tree network consists of a single Switch device. All 64 of its ports can be used as edge ports 912. Routing between ports is implemented using the minimal Local Port Table.
Aspects of how frames with unicast and sw_port DFAs are routed are now described. The Routing Algorithm Table is a software configurable table that determines valid choices based on the frame's current routing state. Valid choices are decisions such as whether a local minimal, global minimal, local non-minimal, or global non-minimal path is allowed to be chosen for the frame's next hop. The routing state includes information such as the VC the frame was received on, and whether it is in the source, the destination, or an intermediate group.
If the Routing Algorithm Table entry corresponding to the frame's current routing state is disabled, the frame is deemed to be unexpected and error EMPTY ROUTE_UF is reported. Routing Algorithm Table entries are considered to be disabled if they allow neither minimal nor non-minimal routing.
The Routing Algorithm Table, along with the Adaptive Select function, also determines the VC to be used for the frame's next hop. This table is implemented as an ECC protected memory of 64 words by 13 bits (plus ECC) per word.
There are three minimal tables: min_global, min_local_switch, and min_local_port, collectively referred to as the Minimal Tables. They are used to determine ports which can be used to route the frame via a minimal path. As only one of these tables is ever accessed at a time, all are implemented within the same memory with specific address ranges, within the memory, assigned to each. The min_global table is indexed by the DFA global_id field. The min_local_switch table is indexed by the DFA switch_id field. The min_local_port table is indexed by the DFA endpoint_id field.
The configuration of the Routing Algorithm Table determines when each table is used; however, min global is intended to be used when the frame has not yet arrived at its destination group to identify global ports that connect directly to the destination group and local ports that connect to a switch, in the current group, that has one or more global ports that connect to the destination group. Similarly, min local switch is intended to be used when the frame has arrived at the destination group, but not at the destination switch, to identify local ports that can be used to reach the destination switch. Lastly, min_local_port is intended to be used when the frame has arrived at the destination switch to identify edge ports that connect to the endpoint device.
The FRF design supports the possibility of multiple edge ports, off of the same Switch device, corresponding to the same DFA. If multiple edge ports are enabled in the min_local_port table, the downstream port selection logic will adaptively choose one based on loading and pseudo-random selection just as it does when multiple ports are enabled in the min local_switch or min global tables.
When the min global table is being used to route a frame, depending on the configuration of field RAND_BITS in CSR R_TF FRF CFG_GMIN_TABLE_BLKS (Section 9.7.5.33 in the SDG), up to four of the min_global table's upper address bits can be set pseudo-randomly instead of being determined by the global_id in the DFA of the frame being routed. This functionality enables implementation of weighting such that some ports are more likely to be chosen than others.
The format of these tables' output is a bit-field, 64 bits wide, where each bit corresponds to a different output port of the current switch. Bits that are set identify valid candidate ports to which the frame may be forwarded.
The Minimal Tables are implemented as an ECC protected memory of 704 (512 min_global+128 min_local_switch+64 min_local_port) words by 64 bits (plus ECC) per word.
When a failure occurs failures in Fat-Tree networks, the network's logical topology is not modified, but routing configurations are modified so as to limit paths that traffic can take in a way that avoids the missing component. It is not necessary to perform the routing updates atomically from the point of view of traffic in the network; traffic can continue to flow while the routing configuration is modified.
Normally when routing upward, any upward-facing link can be chosen. This free choice in the upward link selection has simply been shown as “up” in the tables. When coming back down the tree, the choice of downward link is restricted, dependent on the destination, as shown in the tables.
When a failure occurs, upward choice must be limited so as to prevent a downward packet from arriving at a point where it needs to use the failed component. Assume in
The ability to limit the choice of link based on the destination group would naturally be present in routing structures designed to support Dragonfly routing; this isn't special functionality that would be required only to support failure handling in Fat-Tree networks.
The handling of the failure of a switch is essentially equivalent to the handling required for the failure of all of the downward links connected to the switch. Switches in the level below the failed switch are affected.
Below is a Driven Dragonfly Routing table.
The following Routing Algorithm Table Inputs and Outputs describes the inputs and the outputs of the Routing Algorithm Table.
The computer system 1300 also includes a main memory 1306, such as a random access memory (RAM), cache and/or other dynamic storage devices, coupled to bus 1302 for storing information and instructions to be executed by processor 1304. Main memory 1306 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 1304. Such instructions, when stored in storage media accessible to processor 1304, render computer system 1300 into a special-purpose machine that is customized to perform the operations specified in the instructions.
The computer system 1300 further includes a read only memory (ROM) 1308 or other static storage device coupled to bus 1302 for storing static information and instructions for processor 1304. A storage device 1310, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 1302 for storing information and instructions.
The computer system 1300 may be coupled via bus 1302 to a display 1312, such as a liquid crystal display (LCD) (or touch screen), for displaying information to a computer user. An input device 1314, including alphanumeric and other keys, is coupled to bus 1302 for communicating information and command selections to processor 1304. Another type of user input device is cursor control 1316, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 1304 and for controlling cursor movement on display 1312. In some embodiments, the same direction information and command selections as cursor control may be implemented via receiving touches on a touch screen without a cursor.
The computing system 1300 may include a user interface module to implement a GUI that may be stored in a mass storage device as executable software codes that are executed by the computing device(s). This and other modules may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables.
In general, the word “component,” “engine,” “system,” “database,” data store,” and the like, as used herein, can refer to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, C or C++. A software component may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software components may be callable from other components or from themselves, and/or may be invoked in response to detected events or interrupts. Software components configured for execution on computing devices may be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, magnetic disc, or any other tangible medium, or as a digital download (and may be originally stored in a compressed or installable format that requires installation, decompression or decryption prior to execution). Such software code may be stored, partially or fully, on a memory device of the executing computing device, for execution by the computing device. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware components May be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors.
The computer system 1300 may implement the techniques described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the computer system causes or programs computer system 1300 to be a special-purpose machine. According to one embodiment, the techniques herein are performed by computer system 1300 in response to processor(s) 1304 executing one or more sequences of one or more instructions contained in main memory 1306. Such instructions may be read into main memory 1306 from another storage medium, such as storage device 1310. Execution of the sequences of instructions contained in main memory 1306 causes processor(s) 1304 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions.
The term “non-transitory media,” and similar terms, as used herein refers to any media that store data and/or instructions that cause a machine to operate in a specific fashion. Such non-transitory media may comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 1310. Volatile media includes dynamic memory, such as main memory 1306. Common forms of non-transitory media include, for example, a floppy disk, a flexible disk, hard disk, solid state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge, and networked versions of the same.
Non-transitory media is distinct from but may be used in conjunction with transmission media. Transmission media participates in transferring information between non-transitory media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 1302. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.
The computer system 1300 also includes a communication interface 1318 coupled to bus 1302. Network interface 1318 provides a two-way data communication coupling to one or more network links that are connected to one or more local networks. For example, communication interface 1318 may be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, network interface 1318 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN (or WAN component to communicated with a WAN). Wireless links may also be implemented. In any such implementation, network interface 1318 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
A network link typically provides data communication through one or more networks to other data devices. For example, a network link may provide a connection through local network to a host computer or to data equipment operated by an Internet Service Provider (ISP). The ISP in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet.” Local network and Internet both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link and through communication interface 1318, which carry the digital data to and from computer system 1300, are example forms of transmission media.
The computer system 1300 can send messages and receive data, including program code, through the network(s), network link and communication interface 1318. In the Internet example, a server might transmit a requested code for an application program through the Internet, the ISP, the local network and the communication interface 1318.
The received code may be executed by processor 1304 as it is received, and/or stored in storage device 1310, or other non-volatile storage for later execution.
Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code components executed by one or more computer systems or computer processors comprising computer hardware. The one or more computer systems or computer processors may also operate to support performance of the relevant operations in a “cloud computing” environment or as a “software as a service” (SaaS). The processes and algorithms may be implemented partially or wholly in application-specific circuitry. The various features and processes described above may be used independently of one another, or may be combined in various ways. Different combinations and sub-combinations are intended to fall within the scope of this disclosure, and certain method or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate, or may be performed in parallel, or in some other manner. Blocks or states may be added to or removed from the disclosed example embodiments. The performance of certain of the operations or processes may be distributed among computer systems or computers processors, not only residing within a single machine, but deployed across a number of machines.
As used herein, a circuit might be implemented utilizing any form of hardware, software, or a combination thereof. For example, one or more processors, controllers, ASICs, PLAs, PALs, CPLDs, FPGAs, logical components, software routines or other mechanisms might be implemented to make up a circuit. In implementation, the various circuits described herein might be implemented as discrete circuits or the functions and features described can be shared in part or in total among one or more circuits. Even though various features or elements of functionality may be individually described or claimed as separate circuits, these features and functionality can be shared among one or more common circuits, and such description shall not require or imply that separate circuits are required to implement such features or functionality. Where a circuit is implemented in whole or in part using software, such software can be implemented to operate with a computing or processing system capable of carrying out the functionality described with respect thereto, such as computer system 1300.
As used herein, the term “or” may be construed in either an inclusive or exclusive sense. Moreover, the description of resources, operations, or structures in the singular shall not be read to exclude the plural. Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps.
Terms and phrases used in this document, and variations thereof, unless otherwise expressly stated, should be construed as open ended as opposed to limiting. Adjectives such as “conventional,” “traditional,” “normal,” “standard,” “known,” and terms of similar meaning should not be construed as limiting the item described to a given time period or to an item available as of a given time, but instead should be read to encompass conventional, traditional, normal, or standard technologies that may be available or known now or at any time in the future. The presence of broadening words and phrases such as “one or more,” “at least,” “but not limited to” or other like phrases in some instances shall not be read to mean that the narrower case is intended or required in instances where such broadening phrases may be absent.
This application claims the benefit of U.S. Provisional Patent Application No. 62/852,273, filed May 23, 2019, entitled “Network Switch,” U.S. Provisional Patent Application No. 62/852,203, filed May 23, 2019, entitled “Network Interface Controller,” and U.S. Provisional Patent Application No. 62/852,289, filed May 23, 2019, entitled “Network Computer System,” the disclosures of which are incorporated herein by reference in their entirety for all purposes.
The invention(s) described herein were made with U.S. Government support under one or more of the contracts set forth below. The U.S. Government has certain rights in these inventions. Contract TitleCustomer/AgencyContract ReferenceFastForward-2Lawrence Livermore NationalSubcontract B609229 underSecurity, LLC/Dept of Energyprime contract DE-AC52-07NA27344BeePresentMaryland Procurement OfficeH98230-15-D-0020; DeliveryOrder 003SeaBiscuitMaryland Procurement OfficeII98230-14-C-0758PathForwardLawrence Livermore NationalSubcontract B620872 underSecurity, LLC/Dept of Energyprime contract DE-AC52-07NA27344DesignForwardThe Regents of the UniversitySubcontract 7078453 underof California/Dept of Energyprime contract DE-AC02-05CII11231DesignForward-2The Regents of the UniversitySubcontract 7216357 underof California/Dept of Energyprime contract DE-AC02-05CII11231
| Filing Document | Filing Date | Country | Kind |
|---|---|---|---|
| PCT/US2020/024192 | 3/23/2020 | WO |
| Publishing Document | Publishing Date | Country | Kind |
|---|---|---|---|
| WO2020/236264 | 11/26/2020 | WO | A |
| Number | Name | Date | Kind |
|---|---|---|---|
| 4807118 | Lin et al. | Feb 1989 | A |
| 5138615 | Lamport et al. | Aug 1992 | A |
| 5457687 | Newman | Oct 1995 | A |
| 5937436 | Watkins | Aug 1999 | A |
| 5960178 | Cochinwala et al. | Sep 1999 | A |
| 5970232 | Passint et al. | Oct 1999 | A |
| 5983332 | Watkins | Nov 1999 | A |
| 6112265 | Harriman et al. | Aug 2000 | A |
| 6230252 | Passint et al. | May 2001 | B1 |
| 6246682 | Roy et al. | Jun 2001 | B1 |
| 6493347 | Sindhu et al. | Dec 2002 | B2 |
| 6545981 | Garcia et al. | Apr 2003 | B1 |
| 6633580 | Toerudbakken et al. | Oct 2003 | B1 |
| 6674720 | Passint et al. | Jan 2004 | B1 |
| 6714553 | Poole et al. | Mar 2004 | B1 |
| 6728211 | Peris et al. | Apr 2004 | B1 |
| 6732212 | Sugahara et al. | May 2004 | B2 |
| 6735173 | Lenoski et al. | May 2004 | B1 |
| 6894974 | Aweva et al. | May 2005 | B1 |
| 7023856 | Washabaugh et al. | Apr 2006 | B1 |
| 7133940 | Blightman et al. | Nov 2006 | B2 |
| 7218637 | Best et al. | May 2007 | B1 |
| 7269180 | Bly et al. | Sep 2007 | B2 |
| 7305487 | Blumrich et al. | Dec 2007 | B2 |
| 7337285 | Tanoue | Feb 2008 | B2 |
| 7397797 | Alfieri et al. | Jul 2008 | B2 |
| 7430559 | Lomet | Sep 2008 | B2 |
| 7441006 | Biran et al. | Oct 2008 | B2 |
| 7464174 | Ngai | Dec 2008 | B1 |
| 7483442 | Torudbakken et al. | Jan 2009 | B1 |
| 7562366 | Pope et al. | Jul 2009 | B2 |
| 7593329 | Kwan et al. | Sep 2009 | B2 |
| 7596628 | Aloni et al. | Sep 2009 | B2 |
| 7620791 | Wentzlaff et al. | Nov 2009 | B1 |
| 7633869 | Morris et al. | Dec 2009 | B1 |
| 7639616 | Manula et al. | Dec 2009 | B1 |
| 7734894 | Wentzlaff et al. | Jun 2010 | B1 |
| 7774461 | Tanaka et al. | Aug 2010 | B2 |
| 7782869 | Chitlur Srinivasa | Aug 2010 | B1 |
| 7796579 | Bruss | Sep 2010 | B2 |
| 7856026 | Finan et al. | Dec 2010 | B1 |
| 7933282 | Gupta et al. | Apr 2011 | B1 |
| 7953002 | Opsasnick | May 2011 | B2 |
| 7975120 | Sabbatini, Jr. et al. | Jul 2011 | B2 |
| 8014278 | Subramanian et al. | Sep 2011 | B1 |
| 8023521 | Woo et al. | Sep 2011 | B2 |
| 8050180 | Judd | Nov 2011 | B2 |
| 8077606 | Litwack | Dec 2011 | B1 |
| 8103788 | Miranda | Jan 2012 | B1 |
| 8160085 | Voruganti et al. | Apr 2012 | B2 |
| 8175107 | Yalagandula et al. | May 2012 | B1 |
| 8249072 | Sugumar et al. | Aug 2012 | B2 |
| 8281013 | Mundkur et al. | Oct 2012 | B2 |
| 8352727 | Chen et al. | Jan 2013 | B2 |
| 8353003 | Noehring et al. | Jan 2013 | B2 |
| 8443151 | Tang et al. | May 2013 | B2 |
| 8473783 | Andrade et al. | Jun 2013 | B2 |
| 8543534 | Alves et al. | Sep 2013 | B2 |
| 8619793 | Lavian et al. | Dec 2013 | B2 |
| 8626957 | Blumrich et al. | Jan 2014 | B2 |
| 8650582 | Archer et al. | Feb 2014 | B2 |
| 8706832 | Blocksome | Apr 2014 | B2 |
| 8719543 | Kaminski et al. | May 2014 | B2 |
| 8811183 | Anand et al. | Aug 2014 | B1 |
| 8948175 | Bly et al. | Feb 2015 | B2 |
| 8971345 | McCanne et al. | Mar 2015 | B1 |
| 9001663 | Attar et al. | Apr 2015 | B2 |
| 9053012 | Northcott et al. | Jun 2015 | B1 |
| 9088496 | Vaidya et al. | Jul 2015 | B2 |
| 9094327 | Jacobs et al. | Jul 2015 | B2 |
| 9178782 | Matthews et al. | Nov 2015 | B2 |
| 9208071 | Talagala et al. | Dec 2015 | B2 |
| 9218278 | Talagala et al. | Dec 2015 | B2 |
| 9231876 | Mir et al. | Jan 2016 | B2 |
| 9231888 | Bogdanski et al. | Jan 2016 | B2 |
| 9239804 | Kegel et al. | Jan 2016 | B2 |
| 9269438 | Nachimuthu et al. | Feb 2016 | B2 |
| 9276771 | Zhou | Mar 2016 | B1 |
| 9276864 | Pradeep | Mar 2016 | B1 |
| 9436651 | Underwood et al. | Sep 2016 | B2 |
| 9455915 | Sinha et al. | Sep 2016 | B2 |
| 9460178 | Bashyam et al. | Oct 2016 | B2 |
| 9479426 | Munger et al. | Oct 2016 | B2 |
| 9496991 | Plamondon et al. | Nov 2016 | B2 |
| 9544234 | Markine | Jan 2017 | B1 |
| 9548924 | Pettit et al. | Jan 2017 | B2 |
| 9594521 | Blagodurov et al. | Mar 2017 | B2 |
| 9635121 | Mathew et al. | Apr 2017 | B2 |
| 9716592 | Mandal | Jul 2017 | B1 |
| 9722932 | Brandwine | Aug 2017 | B1 |
| 9742855 | Shuler et al. | Aug 2017 | B2 |
| 9762488 | Previdi et al. | Sep 2017 | B2 |
| 9762497 | Kishore et al. | Sep 2017 | B2 |
| 9830273 | Bk et al. | Nov 2017 | B2 |
| 9838500 | Lan et al. | Dec 2017 | B1 |
| 9853900 | Mula et al. | Dec 2017 | B1 |
| 9887923 | Chorafakis et al. | Feb 2018 | B2 |
| 10003544 | Liu et al. | Jun 2018 | B2 |
| 10009270 | Stark et al. | Jun 2018 | B1 |
| 10031857 | Menachem et al. | Jul 2018 | B2 |
| 10033638 | Stark | Jul 2018 | B1 |
| 10050896 | Yang et al. | Aug 2018 | B2 |
| 10061613 | Brooker et al. | Aug 2018 | B1 |
| 10063481 | Jiang et al. | Aug 2018 | B1 |
| 10089220 | McKelvie et al. | Oct 2018 | B1 |
| 10169060 | Mncent et al. | Jan 2019 | B1 |
| 10178035 | Dillon | Jan 2019 | B2 |
| 10200279 | Aljaedi | Feb 2019 | B1 |
| 10218634 | Aldebert et al. | Feb 2019 | B2 |
| 10270700 | Burnette et al. | Apr 2019 | B2 |
| 10305772 | Zur et al. | May 2019 | B2 |
| 10331590 | Macnamara et al. | Jun 2019 | B2 |
| 10353833 | Hagspiel et al. | Jul 2019 | B2 |
| 10454835 | Contavalli et al. | Oct 2019 | B2 |
| 10498672 | Graham et al. | Dec 2019 | B2 |
| 10567307 | Fairhurst et al. | Feb 2020 | B2 |
| 10728173 | Agrawal et al. | Jul 2020 | B1 |
| 10802828 | Volpe et al. | Oct 2020 | B1 |
| 10817502 | Talagala et al. | Oct 2020 | B2 |
| 11128561 | Matthews et al. | Sep 2021 | B1 |
| 11271869 | Agrawal et al. | Mar 2022 | B1 |
| 11416749 | Bshara et al. | Aug 2022 | B2 |
| 11444886 | Stawitzky et al. | Sep 2022 | B1 |
| 20010010692 | Sindhu et al. | Aug 2001 | A1 |
| 20010047438 | Forin | Nov 2001 | A1 |
| 20020174279 | Wynne et al. | Nov 2002 | A1 |
| 20030016808 | Hu et al. | Jan 2003 | A1 |
| 20030041168 | Musoll | Feb 2003 | A1 |
| 20030110455 | Baumgartner et al. | Jun 2003 | A1 |
| 20030174711 | Shankar | Sep 2003 | A1 |
| 20030200363 | Futral | Oct 2003 | A1 |
| 20030223420 | Ferolito | Dec 2003 | A1 |
| 20040008716 | Stiliadis | Jan 2004 | A1 |
| 20040059828 | Hooper et al. | Mar 2004 | A1 |
| 20040095882 | Hamzah et al. | May 2004 | A1 |
| 20040133634 | Luke et al. | Jul 2004 | A1 |
| 20040223452 | Santos et al. | Nov 2004 | A1 |
| 20050021837 | Haselhorst et al. | Jan 2005 | A1 |
| 20050047334 | Paul et al. | Mar 2005 | A1 |
| 20050088969 | Carlsen et al. | Apr 2005 | A1 |
| 20050091396 | Nilakantan et al. | Apr 2005 | A1 |
| 20050108444 | Flauaus et al. | May 2005 | A1 |
| 20050108518 | Pandya | May 2005 | A1 |
| 20050152274 | Simpson | Jul 2005 | A1 |
| 20050182854 | Pinkerton et al. | Aug 2005 | A1 |
| 20050270974 | Mayhew | Dec 2005 | A1 |
| 20050270976 | Yang et al. | Dec 2005 | A1 |
| 20060023705 | Zoranovic et al. | Feb 2006 | A1 |
| 20060067347 | Naik et al. | Mar 2006 | A1 |
| 20060075480 | Noehring et al. | Apr 2006 | A1 |
| 20060174251 | Pope et al. | Aug 2006 | A1 |
| 20060203728 | Kwan et al. | Sep 2006 | A1 |
| 20070061433 | Reynolds et al. | Mar 2007 | A1 |
| 20070070901 | Aloni et al. | Mar 2007 | A1 |
| 20070198804 | Moyer | Aug 2007 | A1 |
| 20070211746 | Oshikiri et al. | Sep 2007 | A1 |
| 20070242611 | Archer et al. | Oct 2007 | A1 |
| 20070268825 | Corwin et al. | Nov 2007 | A1 |
| 20080013453 | Chiang et al. | Jan 2008 | A1 |
| 20080013549 | Okagawa et al. | Jan 2008 | A1 |
| 20080071757 | Ichiriu et al. | Mar 2008 | A1 |
| 20080084864 | Archer et al. | Apr 2008 | A1 |
| 20080091915 | Moertl et al. | Apr 2008 | A1 |
| 20080147881 | Krishnamurthy et al. | Jun 2008 | A1 |
| 20080159138 | Shepherd et al. | Jul 2008 | A1 |
| 20080253289 | Naven et al. | Oct 2008 | A1 |
| 20090003212 | Kwan et al. | Jan 2009 | A1 |
| 20090010157 | Holmes et al. | Jan 2009 | A1 |
| 20090013175 | Elliott | Jan 2009 | A1 |
| 20090055496 | Garg et al. | Feb 2009 | A1 |
| 20090092046 | Naven et al. | Apr 2009 | A1 |
| 20090141621 | Fan et al. | Jun 2009 | A1 |
| 20090198958 | Arimilli et al. | Aug 2009 | A1 |
| 20090259713 | Blumrich et al. | Oct 2009 | A1 |
| 20090285222 | Hoover et al. | Nov 2009 | A1 |
| 20100061241 | Sindhu et al. | Mar 2010 | A1 |
| 20100169608 | Kuo et al. | Jul 2010 | A1 |
| 20100172260 | Kwan et al. | Jul 2010 | A1 |
| 20100183024 | Gupta | Jul 2010 | A1 |
| 20100220595 | Petersen | Sep 2010 | A1 |
| 20100274876 | Kagan et al. | Oct 2010 | A1 |
| 20100302942 | Shankar et al. | Dec 2010 | A1 |
| 20100316053 | Miyoshi et al. | Dec 2010 | A1 |
| 20110051724 | Scott et al. | Mar 2011 | A1 |
| 20110066824 | Bestler | Mar 2011 | A1 |
| 20110072179 | Lacroute et al. | Mar 2011 | A1 |
| 20110099326 | Jung et al. | Apr 2011 | A1 |
| 20110110383 | Yang et al. | May 2011 | A1 |
| 20110128959 | Bando et al. | Jun 2011 | A1 |
| 20110158096 | Leung et al. | Jun 2011 | A1 |
| 20110158248 | Vorunganti et al. | Jun 2011 | A1 |
| 20110164496 | Loh et al. | Jul 2011 | A1 |
| 20110173370 | Jacobs et al. | Jul 2011 | A1 |
| 20110264822 | Ferguson et al. | Oct 2011 | A1 |
| 20110276699 | Pedersen | Nov 2011 | A1 |
| 20110280125 | Jayakumar | Nov 2011 | A1 |
| 20110320724 | Mejdrich et al. | Dec 2011 | A1 |
| 20120093505 | Yeap et al. | Apr 2012 | A1 |
| 20120102506 | Hopmann et al. | Apr 2012 | A1 |
| 20120117423 | Andrade et al. | May 2012 | A1 |
| 20120137075 | Vorbach | May 2012 | A1 |
| 20120144064 | Parker et al. | Jun 2012 | A1 |
| 20120144065 | Parker et al. | Jun 2012 | A1 |
| 20120147752 | Ashwood-Smith et al. | Jun 2012 | A1 |
| 20120170462 | Sinha | Jul 2012 | A1 |
| 20120170575 | Mehra | Jul 2012 | A1 |
| 20120213118 | Lindsay et al. | Aug 2012 | A1 |
| 20120250512 | Jagadeeswaran et al. | Oct 2012 | A1 |
| 20120287821 | Godfrey et al. | Nov 2012 | A1 |
| 20120297083 | Ferguson et al. | Nov 2012 | A1 |
| 20120300669 | Zahavi | Nov 2012 | A1 |
| 20120314707 | Epps et al. | Dec 2012 | A1 |
| 20130010636 | Regula | Jan 2013 | A1 |
| 20130039169 | Schlansker | Feb 2013 | A1 |
| 20130060944 | Archer et al. | Mar 2013 | A1 |
| 20130103777 | Kagan et al. | Apr 2013 | A1 |
| 20130121178 | Mainaud et al. | May 2013 | A1 |
| 20130136090 | Liu et al. | May 2013 | A1 |
| 20130182704 | Jacobs et al. | Jul 2013 | A1 |
| 20130194927 | Yamaguchi et al. | Aug 2013 | A1 |
| 20130203422 | Masputra et al. | Aug 2013 | A1 |
| 20130205002 | Wang et al. | Aug 2013 | A1 |
| 20130208593 | Nandagopal | Aug 2013 | A1 |
| 20130246552 | Underwood et al. | Sep 2013 | A1 |
| 20130290673 | Archer et al. | Oct 2013 | A1 |
| 20130301645 | Bogdanski et al. | Nov 2013 | A1 |
| 20130304988 | Totolos et al. | Nov 2013 | A1 |
| 20130311525 | Neerincx et al. | Nov 2013 | A1 |
| 20130329577 | Suzuki et al. | Dec 2013 | A1 |
| 20130336164 | Yang | Dec 2013 | A1 |
| 20140019661 | Hormuth et al. | Jan 2014 | A1 |
| 20140032695 | Michels et al. | Jan 2014 | A1 |
| 20140036680 | Lih et al. | Feb 2014 | A1 |
| 20140064082 | Yeung et al. | Mar 2014 | A1 |
| 20140095753 | Crupnicoff et al. | Apr 2014 | A1 |
| 20140098675 | Frost et al. | Apr 2014 | A1 |
| 20140119367 | Han et al. | May 2014 | A1 |
| 20140122560 | Ramey et al. | May 2014 | A1 |
| 20140129664 | McDaniel et al. | May 2014 | A1 |
| 20140133292 | Yamatsu et al. | May 2014 | A1 |
| 20140136646 | Tamir et al. | May 2014 | A1 |
| 20140169173 | Naouri et al. | Jun 2014 | A1 |
| 20140185621 | Decusatis et al. | Jul 2014 | A1 |
| 20140189174 | Ajanovic et al. | Jul 2014 | A1 |
| 20140207881 | Nussle et al. | Jul 2014 | A1 |
| 20140211804 | Makikeni et al. | Jul 2014 | A1 |
| 20140226488 | Shamis et al. | Aug 2014 | A1 |
| 20140241164 | Cociglio et al. | Aug 2014 | A1 |
| 20140258438 | Ayoub | Sep 2014 | A1 |
| 20140301390 | Scott et al. | Oct 2014 | A1 |
| 20140307554 | Basso et al. | Oct 2014 | A1 |
| 20140325013 | Tamir et al. | Oct 2014 | A1 |
| 20140328172 | Kumar et al. | Nov 2014 | A1 |
| 20140347997 | Bergamasco et al. | Nov 2014 | A1 |
| 20140362698 | Arad | Dec 2014 | A1 |
| 20140369360 | Carlstrom | Dec 2014 | A1 |
| 20140379847 | Williams | Dec 2014 | A1 |
| 20150003247 | Mejia et al. | Jan 2015 | A1 |
| 20150006849 | Xu et al. | Jan 2015 | A1 |
| 20150009823 | Ganga et al. | Jan 2015 | A1 |
| 20150026361 | Matthews et al. | Jan 2015 | A1 |
| 20150029848 | Jain | Jan 2015 | A1 |
| 20150055476 | Decusatis et al. | Feb 2015 | A1 |
| 20150055661 | Boucher et al. | Feb 2015 | A1 |
| 20150067095 | Gopal et al. | Mar 2015 | A1 |
| 20150089495 | Persson et al. | Mar 2015 | A1 |
| 20150103667 | Elias et al. | Apr 2015 | A1 |
| 20150124826 | Edsall et al. | May 2015 | A1 |
| 20150146527 | Kishore et al. | May 2015 | A1 |
| 20150154004 | Aggarwal | Jun 2015 | A1 |
| 20150161064 | Pope | Jun 2015 | A1 |
| 20150180782 | Rimmer et al. | Jun 2015 | A1 |
| 20150186318 | Kim et al. | Jul 2015 | A1 |
| 20150193262 | Archer et al. | Jul 2015 | A1 |
| 20150195204 | Haramaty | Jul 2015 | A1 |
| 20150195388 | Snyder et al. | Jul 2015 | A1 |
| 20150208145 | Parker et al. | Jul 2015 | A1 |
| 20150220449 | Stark et al. | Aug 2015 | A1 |
| 20150237180 | Swartzentruber et al. | Aug 2015 | A1 |
| 20150244617 | Nakil et al. | Aug 2015 | A1 |
| 20150244804 | Warfield et al. | Aug 2015 | A1 |
| 20150261434 | Kagan et al. | Sep 2015 | A1 |
| 20150263955 | Talaski et al. | Sep 2015 | A1 |
| 20150263994 | Haramaty et al. | Sep 2015 | A1 |
| 20150288626 | Aybay | Oct 2015 | A1 |
| 20150365337 | Pannell | Dec 2015 | A1 |
| 20150370586 | Cooper et al. | Dec 2015 | A1 |
| 20160006664 | Sabato et al. | Jan 2016 | A1 |
| 20160012002 | Arimilli et al. | Jan 2016 | A1 |
| 20160028613 | Haramaty et al. | Jan 2016 | A1 |
| 20160065455 | Wang et al. | Mar 2016 | A1 |
| 20160094450 | Ghanwani et al. | Mar 2016 | A1 |
| 20160134518 | Callon et al. | May 2016 | A1 |
| 20160134535 | Callon | May 2016 | A1 |
| 20160134559 | Abel et al. | May 2016 | A1 |
| 20160134573 | Gagliardi et al. | May 2016 | A1 |
| 20160142318 | Beecroft | May 2016 | A1 |
| 20160154756 | Dodson et al. | Jun 2016 | A1 |
| 20160182383 | Pedersen | Jun 2016 | A1 |
| 20160182450 | Mihelich | Jun 2016 | A1 |
| 20160205023 | Janardhanan | Jul 2016 | A1 |
| 20160226797 | Aravinthan et al. | Aug 2016 | A1 |
| 20160254991 | Eckert | Sep 2016 | A1 |
| 20160259394 | Ragavan | Sep 2016 | A1 |
| 20160283422 | Crupnicoff et al. | Sep 2016 | A1 |
| 20160285545 | Schmidtke et al. | Sep 2016 | A1 |
| 20160285677 | Kashyap et al. | Sep 2016 | A1 |
| 20160294694 | Parker et al. | Oct 2016 | A1 |
| 20160294926 | Zur et al. | Oct 2016 | A1 |
| 20160301610 | Amit et al. | Oct 2016 | A1 |
| 20160344620 | G. Santos et al. | Nov 2016 | A1 |
| 20160381189 | Caulfield et al. | Dec 2016 | A1 |
| 20170024263 | Verplanken | Jan 2017 | A1 |
| 20170039063 | Gopal et al. | Feb 2017 | A1 |
| 20170041239 | Goldenberg et al. | Feb 2017 | A1 |
| 20170048144 | Liu | Feb 2017 | A1 |
| 20170054633 | Underwood et al. | Feb 2017 | A1 |
| 20170091108 | Arellano et al. | Mar 2017 | A1 |
| 20170097840 | Bridgers | Apr 2017 | A1 |
| 20170103108 | Datta et al. | Apr 2017 | A1 |
| 20170118090 | Pettit et al. | Apr 2017 | A1 |
| 20170118098 | Littlejohn et al. | Apr 2017 | A1 |
| 20170153852 | Ma et al. | Jun 2017 | A1 |
| 20170177541 | Berman et al. | Jun 2017 | A1 |
| 20170220500 | Tong | Aug 2017 | A1 |
| 20170237654 | Turner et al. | Aug 2017 | A1 |
| 20170237671 | Rimmer et al. | Aug 2017 | A1 |
| 20170242753 | Sherlock et al. | Aug 2017 | A1 |
| 20170250914 | Caulfield et al. | Aug 2017 | A1 |
| 20170251394 | Johansson et al. | Aug 2017 | A1 |
| 20170270051 | Chen et al. | Sep 2017 | A1 |
| 20170272331 | Lissack | Sep 2017 | A1 |
| 20170272370 | Ganga et al. | Sep 2017 | A1 |
| 20170286316 | Doshi et al. | Oct 2017 | A1 |
| 20170289066 | Haramaty et al. | Oct 2017 | A1 |
| 20170295098 | Watkins et al. | Oct 2017 | A1 |
| 20170324664 | Xu et al. | Nov 2017 | A1 |
| 20170371778 | McKelvie et al. | Dec 2017 | A1 |
| 20180004705 | Menachem et al. | Jan 2018 | A1 |
| 20180019948 | Patwardhan et al. | Jan 2018 | A1 |
| 20180026878 | Zahavi et al. | Jan 2018 | A1 |
| 20180077064 | Wang | Mar 2018 | A1 |
| 20180083868 | Cheng | Mar 2018 | A1 |
| 20180097645 | Rajagopalan et al. | Apr 2018 | A1 |
| 20180097912 | Chumbalkar et al. | Apr 2018 | A1 |
| 20180113618 | Chan et al. | Apr 2018 | A1 |
| 20180115469 | Erickson et al. | Apr 2018 | A1 |
| 20180131602 | Civanlar et al. | May 2018 | A1 |
| 20180131678 | Agarwal et al. | May 2018 | A1 |
| 20180150374 | Ratcliff | May 2018 | A1 |
| 20180152317 | Chang et al. | May 2018 | A1 |
| 20180152357 | Natham et al. | May 2018 | A1 |
| 20180173557 | Nakil et al. | Jun 2018 | A1 |
| 20180183724 | Callard et al. | Jun 2018 | A1 |
| 20180191609 | Caulfield et al. | Jul 2018 | A1 |
| 20180198736 | Labonte et al. | Jul 2018 | A1 |
| 20180212876 | Bacthu et al. | Jul 2018 | A1 |
| 20180212902 | Steinmacher-Burow | Jul 2018 | A1 |
| 20180219804 | Graham et al. | Aug 2018 | A1 |
| 20180225238 | Karguth et al. | Aug 2018 | A1 |
| 20180234343 | Zdornov | Aug 2018 | A1 |
| 20180254945 | Bogdanski | Sep 2018 | A1 |
| 20180260324 | Marathe et al. | Sep 2018 | A1 |
| 20180278540 | Shalev et al. | Sep 2018 | A1 |
| 20180287928 | Levi et al. | Oct 2018 | A1 |
| 20180323898 | Dods | Nov 2018 | A1 |
| 20180335974 | Simionescu et al. | Nov 2018 | A1 |
| 20180341494 | Sood et al. | Nov 2018 | A1 |
| 20190007349 | Wang et al. | Jan 2019 | A1 |
| 20190018808 | Beard et al. | Jan 2019 | A1 |
| 20190036771 | Sharpless et al. | Jan 2019 | A1 |
| 20190042337 | Dinan et al. | Feb 2019 | A1 |
| 20190042518 | Marolia | Feb 2019 | A1 |
| 20190044809 | Willis | Feb 2019 | A1 |
| 20190044827 | Ganapathi | Feb 2019 | A1 |
| 20190044863 | Mula et al. | Feb 2019 | A1 |
| 20190044872 | Ganapathi et al. | Feb 2019 | A1 |
| 20190044875 | Murty et al. | Feb 2019 | A1 |
| 20190052327 | Motozuka | Feb 2019 | A1 |
| 20190058663 | Song | Feb 2019 | A1 |
| 20190068501 | Schneider et al. | Feb 2019 | A1 |
| 20190081903 | Kobayashi et al. | Mar 2019 | A1 |
| 20190095134 | Li | Mar 2019 | A1 |
| 20190104057 | Goel et al. | Apr 2019 | A1 |
| 20190104206 | Goel et al. | Apr 2019 | A1 |
| 20190108106 | Aggarwal et al. | Apr 2019 | A1 |
| 20190108332 | Glew et al. | Apr 2019 | A1 |
| 20190109791 | Mehra et al. | Apr 2019 | A1 |
| 20190121781 | Kasichainula | Apr 2019 | A1 |
| 20190140979 | Levi et al. | May 2019 | A1 |
| 20190146477 | Cella et al. | May 2019 | A1 |
| 20190171612 | Shahar et al. | Jun 2019 | A1 |
| 20190196982 | Rozas et al. | Jun 2019 | A1 |
| 20190199646 | Singh et al. | Jun 2019 | A1 |
| 20190253354 | Caulfield et al. | Aug 2019 | A1 |
| 20190280978 | Schmatz et al. | Sep 2019 | A1 |
| 20190294575 | Dennison et al. | Sep 2019 | A1 |
| 20190306134 | Shanbhogue et al. | Oct 2019 | A1 |
| 20190332314 | Zhang et al. | Oct 2019 | A1 |
| 20190334624 | Bernard | Oct 2019 | A1 |
| 20190356611 | Das et al. | Nov 2019 | A1 |
| 20190361728 | Kumar et al. | Nov 2019 | A1 |
| 20190379610 | Srinivasan et al. | Dec 2019 | A1 |
| 20200036644 | Belogolovy et al. | Jan 2020 | A1 |
| 20200084150 | Burstein et al. | Mar 2020 | A1 |
| 20200145725 | Eberle et al. | May 2020 | A1 |
| 20200177505 | Li | Jun 2020 | A1 |
| 20200177521 | Blumrich et al. | Jun 2020 | A1 |
| 20200259755 | Wang et al. | Aug 2020 | A1 |
| 20200272579 | Humphrey et al. | Aug 2020 | A1 |
| 20200274832 | Humphrey et al. | Aug 2020 | A1 |
| 20200334195 | Chen et al. | Oct 2020 | A1 |
| 20200349098 | Caulfield et al. | Nov 2020 | A1 |
| 20210081410 | Chavan et al. | Mar 2021 | A1 |
| 20210152494 | Johnsen | May 2021 | A1 |
| 20210263779 | Haghighat et al. | Aug 2021 | A1 |
| 20210334206 | Colgrove et al. | Oct 2021 | A1 |
| 20210377156 | Michael et al. | Dec 2021 | A1 |
| 20210409351 | Das et al. | Dec 2021 | A1 |
| 20220131768 | Ganapathi et al. | Apr 2022 | A1 |
| 20220166705 | Froese | May 2022 | A1 |
| 20220200900 | Roweth | Jun 2022 | A1 |
| 20220210058 | Bataineh | Jun 2022 | A1 |
| 20220217078 | Ford et al. | Jul 2022 | A1 |
| 20220217101 | Yefet et al. | Jul 2022 | A1 |
| 20220245072 | Roweth et al. | Aug 2022 | A1 |
| 20220278941 | Shalev et al. | Sep 2022 | A1 |
| 20220309025 | Chen et al. | Sep 2022 | A1 |
| 20230035420 | Sankaran et al. | Feb 2023 | A1 |
| 20230046221 | Pismenny et al. | Feb 2023 | A1 |
| Number | Date | Country |
|---|---|---|
| 101729609 | Jun 2010 | CN |
| 102932203 | Feb 2013 | CN |
| 110324249 | Oct 2019 | CN |
| 110601888 | Dec 2019 | CN |
| 0275135 | Jul 1988 | EP |
| 2187576 | May 2010 | EP |
| 2219329 | Aug 2010 | EP |
| 2947832 | Nov 2015 | EP |
| 3445006 | Feb 2019 | EP |
| 2003-244196 | Aug 2003 | JP |
| 3459653 | Oct 2003 | JP |
| 10-2012-0062864 | Jun 2012 | KR |
| 10-2012-0082739 | Jul 2012 | KR |
| 10-2014-0100529 | Aug 2014 | KR |
| 10-2015-0026939 | Mar 2015 | KR |
| 10-2015-0104056 | Sep 2015 | KR |
| 10-2017-0110106 | Oct 2017 | KR |
| 10-1850749 | Apr 2018 | KR |
| 2001069851 | Sep 2001 | WO |
| 0247329 | Jun 2002 | WO |
| 2003019861 | Mar 2003 | WO |
| 2004001615 | Dec 2003 | WO |
| 2005094487 | Oct 2005 | WO |
| 2007034184 | Mar 2007 | WO |
| 2009010461 | Jan 2009 | WO |
| 2009018232 | Feb 2009 | WO |
| 2014092780 | Jun 2014 | WO |
| 2014137382 | Sep 2014 | WO |
| 2014141005 | Sep 2014 | WO |
| 2018004977 | Jan 2018 | WO |
| 2018046703 | Mar 2018 | WO |
| 2019072072 | Apr 2019 | WO |
| Entry |
|---|
| Awerbuch, B., et al.; “An On-Demand Secure Routing Protocol Resilient to Byzantine Failures”; Sep. 2002; 10 pages. |
| Belayneh L.W., et al.; “Method and Apparatus for Routing Data in an Inter-Nodal Communications Lattice of a Massively Parallel Computer System by Semi-Randomly Varying Routing Policies for Different Packets”; 2019; 3 pages. |
| Bhatele, A., et al.; “Analyzing Network Health and Congestion in Dragonfly-based Supercomputers”; May 23-27, 2016; 10 pages. |
| Blumrich, M.A., et al.; “Exploiting Idle Resources in a High-Radix Switch for Supplemental Storage”; Nov. 2018; 13 pages. |
| Chang, F., et al.; “PVW: Designing Vir PVW: Designing Virtual World Ser orld Server Infr er Infrastructur astructure”; 2010; 8 pages. |
| Chang, F., et al.; “PVW: Designing Virtual World Server Infrastructure”; 2010; 8 pages. |
| Chen, F., et al.; “Requirements for RoCEv3 Congestion Management”; Mar. 21, 2019; 8 pages. |
| Cisco Packet Tracer; “packet-tracer;—ping”; https://www.cisco.com/c/en/us/td/docs/security/asa/asa-command-reference/I-R/cmdref2/p1.html; 2017. |
| Cisco; “Understanding Rapid Spanning Tree Protocol (802.1w)”; Aug. 1, 2017; 13 pages. |
| Eardley, ED, P; “Pre-Congestion Notification (PCN) Architecture”; Jun. 2009; 54 pages. |
| Escudero-Sahuquillo, J., et al.; “Combining Congested-Flow Isolation and Injection Throttling in HPC Interconnection Networks”; Sep. 13-16, 2011; 3 pages. |
| Hong, Y.; “Mitigating the Cost, Performance, and Power Overheads Induced by Load Variations in Multicore Cloud Servers”; Fall 2013; 132 pages. |
| Huawei; “The Lossless Network for Data Centers”; Nov. 7, 2017; 15 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024248, dated Jul. 8, 2020, 11 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US20/024332, dated Jul. 8, 2020, 13 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US20/24243, dated July 9. 2020, 10 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US20/24253, dated July 6. 2020, 12 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US20/24256, dated Jul. 7, 2020, 11 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US20/24257, dated Jul. 7, 2020, 10 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US20/24258, dated Jul. 7, 2020, 9 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US20/24259, dated Jul. 9, 2020, 13 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US20/24260, dated Jul. 7, 2020, 11 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US20/24268, dated Jul. 9, 2020, 11 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US20/24269, dated Jul. 9, 2020, 11 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US20/24339, dated Jul. 8, 2020, 11 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024125, dated Jul. 10, 2020, 5 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024129, dated Jul. 10, 2020, 11 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024237, dated Jul. 14, 2020, 5 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024239, dated Jul. 14, 2020, 11 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024241, dated Jul. 14, 2020, 13 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024242, dated Jul. 6, 2020, 11 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024244, dated Jul. 13, 2020, 10 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024245, dated Jul. 14, 2020, 11 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024246, dated Jul. 14, 2020, 10 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024250, dated Jul. 14, 2020, 12 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024254, dated Jul. 13, 2020, 10 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024262, dated Jul. 13, 2020, 10 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024266, dated Jul. 9, 2020, 10 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024270, dated Jul. 10, 2020, 13 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024271, dated Jul. 9, 2020, 10 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024272, dated Jul. 9, 2020, 10 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024276, dated Jul. 13, 2020, 9 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024304, dated Jul. 15, 2020, 11 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024311, dated Jul. 17, 2020, 8 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024321, dated Jul. 9, 2020, 9 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024324, dated Jul. 14, 2020, 10 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/024327, dated Jul. 10, 2020, 15 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/24158, dated Jul. 6, 2020, 18 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/24251, dated Jul. 6, 2020, 11 pages. |
| International Search Report and Written Opinion received for PCT Application No. PCT/US2020/24267, dated Jul. 6, 2020, 9 pages. |
| Ramakrishnan et al., RFC 3168, “The addition of Explicit Congestion Notification (ECN) to IP”, Sep. 2001 (Year: 2001). |
| International Search Report and Written Opinion received for PCT Patent Application No. PCT/US20/24303, dated Oct. 21, 2020, 9 pages. |
| International Search Report and Written Opinion received for PCT Patent Application No. PCT/US20/24340, dated Oct. 26, 2020, 9 pages. |
| International Search Report and Written Opinion received for PCT Patent Application No. PCT/US20/24342, dated Oct. 27, 2020, 10 pages. |
| International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2020/024192, dated Oct. 23, 2020, 9 pages. |
| International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2020/024221, dated Oct. 26, 2020, 9 pages. |
| International Search Report cited in PCT/US2020/024170 dated Dec. 16, 2020; 3 pages. |
| Maabi, S., et al.; “ERFAN: Efficient reconfigurable fault-tolerant deflection routing algorithm for 3-D Network-on-Chip”; Sep. 6-9, 2016. |
| Maglione-Mathey, G., et al.; “Scalable Deadlock-Free Deterministic Minimal-Path Routing Engine for InfiniBand-Based Dragonfly Networks”; Aug. 21, 2017; 15 pages. |
| Mamidala, A. R., et al.; “Efficient Barrier and Allreduce on Infiniband clusters using multicast and adaptive algorithms”; Sep. 20-23, 2004; 10 pages. |
| Mammeri, Z; “Reinforcement Learning Based Routing in Networks: Review and Classification of Approaches”; Apr. 29, 2019; 35 pages. |
| Mollah; M. A., et al.; “High Performance Computing Systems. Performance Modeling, Benchmarking, and Simulation: 8th International Workshop”; Nov. 13, 2017. |
| Open Networking Foundation; “OpenFlow Switch Specification”; Mar. 26, 2015; 283 pages. |
| Prakash, P., et al.; “The TCP Outcast Problem: Exposing Unfairness in Data Center Networks”; 2011; 15 pages. |
| Ramakrishnan, K., et al.; “The Addition of Explicit Congestion Notification (ECN) to IP”; Sep. 2001; 63 pages. |
| Roth, P. C., et al.; “MRNet: A Software-Based Multicast/Reduction Network for Scalable Tools1”; Nov. 15-21, 2003; 16 pages. |
| Silveira, J., et al.; “Preprocessing of Scenarios for Fast and Efficient Routing Reconfiguration in Fault-Tolerant NoCs”; Mar. 4-6, 2015. |
| Tsunekawa, K.; “Fair bandwidth allocation among LSPs for AF class accommodating TCP and UDP traffic in a Diffserv-capable MPLS network”; Nov. 17, 2005; 9 pages. |
| Underwood, K.D., et al.; “A hardware acceleration unit for MPI queue processing”; Apr. 18, 2005; 10 pages. |
| Wu, J.; “Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels”; Feb. 2000; 11 pages. |
| Xiang, D., et al.; “Fault-Tolerant Adaptive Routing in Dragonfly Networks”; Apr. 12, 2017; 15 pages. |
| Xiang, D., et al.; “Deadlock-Free Broadcast Routing in Dragonfly Networks without Virtual Channels”, submission to IEEE transactions on Parallel and Distributed Systems, 2015, 15 pages. |
| Extended European Search Report and Search Opinion received for EP Application No. 20809930.9, dated Mar. 2, 2023, 9 pages. |
| Extended European Search Report and Search Opinion received for EP Application No. 20810784.7, dated Mar. 9, 2023, 7 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20220210058 A1 | Jun 2022 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62852289 | May 2019 | US | |
| 62852273 | May 2019 | US | |
| 62852203 | May 2019 | US |
