Abstract: A computerized method for processing packets in parallel using a reorder queue is described. As packets are received, it is determined which packet is the first packet in the flow. Once identified, the first packet in the flow, along with all other packets in the flow, is sent to the reorder queue while only a copy of the first packet in the flow is sent to a packet scheduler for processing on one of a plurality of processing cores. After the copy of the first packet in the flow is processed, the reorder queue releases each of the packets for the flow from the reorder queue in an order in which they were received. Thereafter, each of the packets released from the reorder queue are processed based on the processing of the copy of the first packet.

Abstract: Barrel-shifters may be implemented in field programmable gate array (FPGA) using digital signal processor (DSP) multipliers, rather than consuming lookup table (LUT) resources. This advantageously uses otherwise under-utilized assets, leaving previously heavily-burdened LUT resources available for other uses. Building blocks of 8-bit and 4-bit DSP-based shifters are implemented in parallel sets for wide data and in tandem stages for larger shifts. For example, a 32-bit barrel-shifter may be implemented using a set of seven (7) parallel 8-bit shifters to handle the width of the data in a first stage and another set of eight (8) parallel 4-bit shifters in a second stage that operates in tandem with the first stage, to complete the shift. In an example, the first stage provides fine shifting and the second stage provides coarse shifting. To achieve even wider barrel-shifters, for example a 256-bit shifter, 32-bit barrel-shifter may be used recursively.

Abstract: The present disclosure relates to methods and devices for graphics processing including an apparatus, e.g., a GPU. The apparatus may process a first workload of a plurality of workloads at each of multiple clusters in a GPU pipeline. The apparatus may also increment a plurality of performance counters during the processing of the first workload at each of the multiple clusters. Further, the apparatus may determine, at each of the multiple clusters, whether the first workload is finished processing. The apparatus may also read, upon determining that the first workload is finished processing, a value of each of the multiple clusters for each of the plurality of performance counters. Additionally, the apparatus may transmit an indication of the read value of each of the multiple clusters for all of the plurality of performance counters.

Abstract: The present disclosure relates to methods and devices for graphics processing including an apparatus, e.g., a GPU. The apparatus may process a first workload of a plurality of workloads at each of multiple clusters in a GPU pipeline. The apparatus may also increment a plurality of performance counters during the processing of the first workload at each of the multiple clusters. Further, the apparatus may determine, at each of the multiple clusters, whether the first workload is finished processing. The apparatus may also read, upon determining that the first workload is finished processing, a value of each of the multiple clusters for each of the plurality of performance counters. Additionally, the apparatus may transmit an indication of the read value of each of the multiple clusters for all of the plurality of performance counters.