Hewlett-Packard Development Company, L.p.

Hewlett-Packard Company

Hewlett Packard Enterprise Development LP

Darel N Emmot

Byron Alan Alcorn

Nicholas George McDonald

Desi Rhoden

Ronald D Larson

Gregg Bernard Lesartre

David Pinedo

Ryan Dean Menhusen

Jon L Ashburn

Daniel William Dauwe

Gary Belgrave Gostin

Derek Alan Sherlock

Eric M Rentschler

Bryan G Prouty

John Kim

Steven P Tucker

Blaine Douglas Gaither

Alan Lynn Davis

Benjamin Daniel Osecky

Michael Kennard Tayler

Matthew B Lovell

Judson Eugene Veazey

David Paul Hannum

David M Olson

Asheesh Kashyap

Courtney D Goeltzenleuchter

James Robert Peterson

Al Davis

Norell Estella Menhusen

John Dykstal

Steven Paul Tucker

Khaled Zakharia

Faisal Bhamani

James D Gibson

A system for facilitating sender-side congestion control is provided. During operation, the system, on a sender node, can determine the utilization of a buffer at a last-hop switch to a receiver node based on in-flight packets to the receiver node. The receiver node can be reachable from the sender node via the last-hop switch. The system can then determining a fraction of available space in the buffer for packets from the sender node based on the utilization of the buffer. Subsequently, the system can determine whether the fraction of the available space in the buffer can accommodate a next packet from the sender node while avoiding congestion at the buffer at the receiver node. If the fraction of the available space in the buffer can accommodate the next packet, the system can allow the sender node to send the next packet to the receiver node.

Method and system for dynamic quota-based congestion management

Candidates for selection in a weighted arbitration system are assigned priority weights and random weights. The winning candidate is determined using a tree of selectors such as a comparators. At each stage of the tree, the candidate having the greatest priority weight is selected to pass to the next stage. If multiple candidates are tied for the greatest priority weight, the candidate having the greatest random weight is selected to pass to the next stage.

Arbiter with random tie breaking

A system for facilitating sender-side granular congestion control is provided. During operation, the first and second processes of an application can run on sender and receiver nodes, respectively. A first buffer on the sender node can be allocated to the first process. For the first process, the system can then identify a second buffer at a last-hop switch of the receiver node. The system can determine, based on in-flight packets, the utilization of the second buffer. The system can also determine a fraction of available space in the second buffer for packets from the first buffer based on the utilization. Subsequently, the system can determine whether the fraction of the available space can accommodate the next packet from the first buffer. If the fraction of the available space can accommodate the next packet, the system can allow the first process to send the next packet to the second process.

Method and system for granular dynamic quota-based congestion management

An example hierarchical switching device may include sub-switches that form a fully interconnected all-to-all network, wherein the sub-switches comprise external output ports, internal input ports and internal output ports to exchange packets with other sub-switches within the fully interconnected all-to-all network. The switching device may further include a deadlockable storage, a storage partition and a switch controller. The deadlockable storage space is exclusively assigned to an internal input port of the internal input ports of the sub-switch including the deadlockable storage. The storage partition is exclusively assigned to an external output port of the external output ports and exclusively assigned to the internal input port. The switch controller is to route a packet destined for an external output port of a sub-switch through the internal input port of the sub-switch to the deadlockable storage or if the packet corresponds to the external output port, to the storage partition.

Hierarchical switching device with deadlockable storage and storage partitions

In some examples, a system includes a processing entity and a memory to store data arranged in a plurality of bins associated with respective key values of a key. The system includes a cache to store cached data elements for respective accumulators that are updatable to represent occurrences of the respective key values of the key, where each accumulator corresponds to a different bin of the plurality of bins, and each cached data element has a range that is less than a range of a corresponding bin of the plurality of bins. Responsive to a value of a given cached data element as updated by a given accumulator satisfying a criterion, the processing entity is to cause an aggregation of the value of the given cached data element with a bin value in a respective bin.

Accumulators corresponding to bins in memory

A method comprises receiving a message comprising an identifier for an address template, using the identifier to select the address template from a set of address templates, determining a set of memory addresses for a corresponding set of memory operations using the address template, and executing the memory operations.

Remote memory access using memory address templates

A switch includes a plurality of ingress ports, a plurality of egress ports, and a plurality of buffers comprising a buffer coupled to each ingress port, egress port pair. An ingress port is to determine a plurality of potential egress ports for a packet. The ingress port is to select an egress port of the plurality of potential egress ports based on congestion of the corresponding buffers coupled to the ingress port and to each of the plurality of potential egress ports. The ingress port is to place the packet into the corresponding buffer coupled to the ingress port and the selected egress port.

Route selection based on buffer congestion

Example implementations relate to hybrid arbitration of requests for access to a shared pool of resources. An example implementation includes receiving a set of requests for access to the shared pool of resources. The requests may each be from any number of traffic classes. A traffic class may be selected according to turn-based arbitration logic. Additionally, a request from each traffic class of a subset of received requests may be selected. A request selected by the age-based arbitration logic and of the selected traffic class may be granted access to the shared pool of resources.

Request arbitration by age and traffic classes

Examples relate to hierarchical switching devices comprising a plurality of sub-switches forming a fully interconnected all-to-all network. The sub-switches comprise internal input ports and internal output ports to exchange packets with other sub-switches within the fully interconnected all-to-all network. The internal input ports of the sub-switches have exclusive access to a queue partition for each external output port of the respective sub-switch. A switch controller receives a packet at a first sub-switch of the plurality of sub-switches that is to be routed to a particular external output port of a second sub-switch of the plurality of sub-switches. The switch controller routes the packet directly from the first sub-switch to the second sub-switch using an internal output port of the first sub-switch and a queue partition of the second sub-switch that is for the particular external output port of the second sub-switch.

Hierarchical switching devices

An arbiter may include a plurality of cells, mapping logic, a fixed priority arbiter, and unmapping logic. Each cell may be associated with a corresponding client and configured to store a priority for the corresponding client. The mapping logic may be connected to the plurality of cells to order requests received from the clients according to the priorities stored in the cells. The fixed priority arbiter may receive the ordered requests and generate a grant for a winning request of the requests. The unmapping logic may use the stored priorities to yield the grant back to the winning client that sent the winning request.

Prioritized arbitration using fixed priority arbiter

Examples relate to switching devices comprising a switch controller and a plurality of interconnected sub-switches forming an internal network of the switching device. A packet is received at a first sub-switch of the plurality of interconnected sub-switches. The packet is to be routed to a particular external output port of a second sub-switch of the plurality of interconnected sub-switches. Upon reception of the packet, the switch controller reserves a space for the packet in a queue associated to the particular external output port. Then, the switch controller routes the packet on the internal network to the particular external output to occupy the reserved space for the packet.

Reservation-based switching devices

A system, includes a plurality of sub-queues. Each sub-queue is assigned to an age class of a sequence of age classes. A set of age thresholds divides the sub-queues. A queue manager places a received transaction into a sub-queue based on a comparison of an age of the received transaction to the set of age thresholds.

Age class based arbitration

Examples relate to virtual channel routing in networks considering VC actions to be performed by the packets while routed through the network. A packet is received at an input port of a network device of a network and an output port and a VC action is determined from a routing table associated to the input port based on a packet's destination network device. A VC mask is determined from a Virtual Channel Action Table (VCAT), associated to the routing table, based on a packet's ingress VC and the VC action. A particular VC among the set of VCs defined in the VC mask is selected and the packet is routed to the destination network device using the output port and the particular VC.

Growing community of inventors

Ft. Collins, CO, United States of America

Darel N Emmot