公开(公告)号：US12267153B2

公开(公告)日：2025-04-01

申请号：US17660222

申请日：2022-04-22

Applicant: NXP B.V.

Inventor： Mark Andrew Schellhorn ,  Bernard Francois St-Denis ,  John Pillar

IPC: G06F13/28 ,  H04J3/06

Abstract: A network station scheduling a frame to be transmitted by a transmitter of the network station at a transmit time. The transmit time is based on a first clock. A request is then issued to a direct memory access (DMA) circuit to retrieve the frame from a system memory. An advance time offset associated with the first clock is determined based on an estimated DMA latency of the DMA circuit. A frame retrieved by the DMA circuit is provided to a staging circuit. When a time of a second clock reaches the transmit time of the frame in the staging circuit, the frame is transmitted at the transmit time. In an example, a time of the first clock is ahead of a time of the second clock by the advance time offset.

公开(公告)号：US20230344539A1

公开(公告)日：2023-10-26

申请号：US17660222

申请日：2022-04-22

Applicant: NXP B.V.

Inventor： Mark Andrew Schellhorn ,  Bernard Francois St-Denis ,  John Pillar

IPC: H04J3/06 ,  G06F13/28

CPC classification number: H04J3/0667 ,  H04J3/0697 ,  G06F13/287

Abstract: A network station scheduling a frame to be transmitted by a transmitter of the network station at a transmit time. The transmit time is based on a first clock. A request is then issued to a direct memory access (DMA) circuit to retrieve the frame from a system memory. An advance time offset associated with the first clock is determined based on an estimated DMA latency of the DMA circuit. A frame retrieved by the DMA circuit is provided to a staging circuit. When a time of a second clock reaches the transmit time of the frame in the staging circuit, the frame is transmitted at the transmit time. In an example, a time of the first clock is ahead of a time of the second clock by the advance time offset.

公开(公告)号：US11924102B2

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

申请号：US17658029

申请日：2022-04-05

Applicant: NXP B.V.

Inventor： Timothy John Buick ,  John Pillar ,  James Lancelot Hardman ,  Matthew Erwin Sippert

IPC: G06F7/02 ,  G06F16/00 ,  G06F16/13 ,  H04L45/02 ,  H04L45/12 ,  H04L45/42 ,  H04L45/7453 ,  G06F16/22 ,  G06F16/901

CPC classification number: H04L45/7453 ,  G06F16/137 ,  H04L45/02 ,  H04L45/12 ,  H04L45/42 ,  G06F16/2255 ,  G06F16/9014

Abstract: A computer-implemented method, network switch and computer program product for performing exact match lookup operations in a table. A hash of the lookup key is performed to generate a value which is used to identify a location in the hash memory space. The generated value is separated into a bucket row, a bucket column, a bucket plane and a secondary hash value, where the bucket row, bucket column and bucket plane are used to identify an originating home hash root bucket. The head entry on the collision chain of a hash root bucket identified via the secondary hash value that is a neighbor to the home hash root bucket is read to determine if an exact match of the lookup key exists. If the head entry exactly matches the lookup key, then a finding of an exact match of the lookup key is reported.

公开(公告)号：US20230318975A1

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

申请号：US17658029

申请日：2022-04-05

Applicant: NXP B.V.

Inventor： Timothy John Buick ,  John Pillar ,  James Lancelot Hardman ,  Matthew Erwin Sippert

IPC: H04L45/7453 ,  H04L45/42 ,  H04L45/02 ,  H04L45/12

CPC classification number: H04L45/7453 ,  H04L45/42 ,  H04L45/02 ,  H04L45/12

Abstract: A computer-implemented method, network switch and computer program product for performing exact match lookup operations in a table. A hash of the lookup key is performed to generate a value which is used to identify a location in the hash memory space. The generated value is separated into a bucket row, a bucket column, a bucket plane and a secondary hash value, where the bucket row, bucket column and bucket plane are used to identify an originating home hash root bucket. The head entry on the collision chain of a hash root bucket identified via the secondary hash value that is a neighbor to the home hash root bucket is read to determine if an exact match of the lookup key exists. If the head entry exactly matches the lookup key, then a finding of an exact match of the lookup key is reported.