公开(公告)号：US20210258252A1

公开(公告)日：2021-08-19

申请号：US17247473

申请日：2020-12-11

Applicant: Hewlett Packard Enterprise Development LP

Inventor： David Olson ,  Darel Neal Emmot ,  Nicholas George McDonald ,  John Kim

IPC: H04L12/721 ,  H04L12/707 ,  H04L12/717 ,  H04L12/873 ,  H04L12/803 ,  H04L12/801

Abstract: 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.

公开(公告)号：US20210112015A1

公开(公告)日：2021-04-15

申请号：US16949148

申请日：2020-10-15

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Gregg B. Lesartre ,  Darel Neal Emmot ,  James D. Gibson

IPC: H04L12/863 ,  H04L12/865 ,  H04L12/937 ,  H04L12/44

Abstract: 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.

公开(公告)号：US20200076742A1

公开(公告)日：2020-03-05

申请号：US16115121

申请日：2018-08-28

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Nicholas George McDonald ,  Darel Neal Emmot

IPC: H04L12/801 ,  H04L12/835 ,  H04L12/851 ,  H04L12/925 ,  H04L12/915 ,  H04L12/861

Abstract: Examples relate to methods for sending data between a senders and receivers coupled by a link. These methods comprise allocating a plurality of credit pools in a buffer on the receiver. These credits represent a portion of memory space in the buffer to store data received from the sender. Then, the sender allocates a number of credits from a plurality of credits to each virtual channel. A number of virtual channels from the plurality of virtual channels is mapped to the credit pools. The sender sends a data block to the receiver through a particular virtual channel when there are enough credits available in at least one of the particular virtual channel and the data pool to which the particular virtual channel is mapped. The sender decrements a credit counter associated with the corresponding at least one of the particular virtual channel and the data pool.

公开(公告)号：US11943149B2

公开(公告)日：2024-03-26

申请号：US16949148

申请日：2020-10-15

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Gregg B. Lesartre ,  Darel Neal Emmot ,  James D. Gibson

IPC: H04L47/62 ,  H04L12/44 ,  H04L45/00 ,  H04L45/122 ,  H04L45/48 ,  H04L47/6275 ,  H04L49/253

CPC classification number: H04L47/623 ,  H04L12/44 ,  H04L45/122 ,  H04L45/20 ,  H04L45/48 ,  H04L47/6275 ,  H04L49/254

Abstract: 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.

公开(公告)号：US11748281B2

公开(公告)日：2023-09-05

申请号：US17514720

申请日：2021-10-29

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Gregg B. Lesartre ,  Darel Neal Emmot

IPC: G06F12/02 ,  G06F12/06 ,  G06F13/16

CPC classification number: G06F13/1678 ,  G06F12/0238 ,  G06F13/1631 ,  G06F13/1663 ,  G06F12/0646

Abstract: 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.

公开(公告)号：US11722406B2

公开(公告)日：2023-08-08

申请号：US17247473

申请日：2020-12-11

Applicant: Hewlett Packard Enterprise Development LP

Inventor： David Olson ,  Darel Neal Emmot ,  Nicholas George McDonald ,  John Kim

IPC: H04L45/00 ,  H04L45/24 ,  H04L47/10 ,  H04L47/52 ,  H04L47/122 ,  H04L45/42

CPC classification number: H04L45/38 ,  H04L45/24 ,  H04L45/42 ,  H04L47/122 ,  H04L47/29 ,  H04L47/52

Abstract: 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.

公开(公告)号：US20230066848A1

公开(公告)日：2023-03-02

申请号：US17410492

申请日：2021-08-24

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Ryan Dean Menhusen ,  Darel Neal Emmot ,  Daniel William Dauwe

IPC: H04L12/803 ,  H04L12/801 ,  H04L12/835

Abstract: 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.

公开(公告)号：US20200304424A1

公开(公告)日：2020-09-24

申请号：US16946162

申请日：2020-06-08

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Nicholas George McDonald ,  Darel Neal Emmot

IPC: H04L12/911 ,  H04L12/863

Abstract: 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.

公开(公告)号：US20240259315A1

公开(公告)日：2024-08-01

申请号：US18443475

申请日：2024-02-16

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Ryan Dean Menhusen ,  Darel Neal Emmot ,  Daniel William Dauwe

IPC: H04L47/122 ,  H04L47/17 ,  H04L47/30 ,  H04L47/35

CPC classification number: H04L47/122 ,  H04L47/17 ,  H04L47/30 ,  H04L47/35

Abstract: 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.

公开(公告)号：US20240134929A1

公开(公告)日：2024-04-25

申请号：US17971486

申请日：2022-10-20

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： DANIEL DAUWE ,  Avinash Kethineedi ,  Darel Neal Emmot ,  Ponnamanda Bhaskar Sampath Sai Sriram

IPC: G06F17/16

CPC classification number: G06F17/16

Abstract: Systems and methods implement a column-partition sparse matrix (CPSM) format that provides enhanced/efficient matrix operations, e.g., sparse matrix vector multiplication (SpMV). The CPSM format is an enhanced layout, the data being arranged by column-partitioning the sparse matrix, and partitioning the dense matrix in a manner that improves scalability, computational efficiency, and leverages distributed computing architecture in performing SpMV operations. For example, data can be arranged by partitioning, by column, one or more contiguous columns of a sparse matrix of data into a plurality of column partitions, where the sparse matrix is associated with a sparse matrix multiplication operation. A plurality of column partition groups is formed. Each of the plurality of column partition groups are then distributed to a respective processor from a plurality of processors such that a portion of the sparse matrix multiplication operation is independently performed by each processor of the plurality of processors.