US20130007573A1 | 2013-01-03 | |||
US20180067810A1 | 2018-03-08 |
KIM JAEYOUNG ET AL: "A fast and energy-efficient Hamming decoder for software-defined radio using graphics processing units", JOURNAL OF SUPERCOMPUTING, KLUWER ACADEMIC PUBLISHERS, DORDRECHT, NL, vol. 71, no. 7, 5 March 2015 (2015-03-05), pages 2454 - 2472, XP035506614, ISSN: 0920-8542, [retrieved on 20150305], DOI: 10.1007/S11227-015-1396-X
CHI MUCONG ET AL: "VACA: A high-performance variable-length adaptive CRC algorithm", 2017 IEEE 28TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), IEEE, 8 October 2017 (2017-10-08), pages 1 - 6, XP033321114, ISBN: 978-1-5386-3529-2, [retrieved on 20180214], DOI: 10.1109/PIMRC.2017.8292219
JUNHO CHO ET AL: "Block-interleaving based parallel CRC computation for multi-processor systems", 2010 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEM (SIPS 2010) : SAN FRANCISCO, CALIFORNIA, USA, 6 - 8 OCTOBER 2010, IEEE, PISCATAWAY, NJ, USA, 6 October 2010 (2010-10-06), pages 311 - 316, XP031792425, ISBN: 978-1-4244-8932-9
PATENT Attorney Docket No.0112912-050WO0 Client Reference No.19-SC-0204WO01 CLAIMS WHAT IS CLAIMED IS: 1. A method, comprising: obtaining an input data sequence; obtaining a cyclic redundancy check sequence; and allocating the input data sequence to threads of a plurality of threads of a graphics processing unit; allocating the cyclic redundancy check sequence to threads of the plurality of threads of the graphics processing unit; performing a cyclic redundancy check operation over the input data sequence and the cyclic redundancy check sequence using the threads of the plurality of threads of the graphics processing unit; and outputting a cyclic redundancy check result of the cyclic redundancy check operation. 2. The method of claim 1, wherein the cyclic redundancy check sequence is a first function of a generator polynomial, the input data sequence corresponds to a data polynomial, and the cyclic redundancy check result comprises a remainder of a polynomial division of a second function of the data polynomial times the generator polynomial. 3. The method of claim 2, wherein allocating the input data sequence to the plurality of threads comprises allocating the data polynomial among threads of the plurality of threads by parsing the data polynomial into a plurality of input data segments sized to fit a thread local memory data width. 4. The method of claim 3, wherein allocating the cyclic redundancy check sequence to the plurality of threads comprises allocating at least one of the generator polynomial or a polynomial factor among threads of the plurality of threads by parsing at least one of the generator polynomial or the polynomial factor into a plurality of generator segments sized to the thread local memory data width. 5. The method of claim 4, further comprising: storing the plurality of input data segments in local memory of the threads; and storing the plurality of generator segments in a global memory accessible to the plurality of threads of the graphics processing unit. 6. The method of claim 4, further comprising: computing a precomputed generator segment independent of the input data sequence as a third function of a thread position and the generator polynomial; storing the precomputed generator segment in a global memory accessible to the plurality of threads of the graphics processing unit. 7. The method of claim 4, further comprising: determining a thread position; determining an associated generator segment associated with the thread position; computing values of a thread output for a thread having the thread position in the plurality of threads; and providing access to the values to the thread having the thread position, usable as a lookup table to look up a thread output for a given input data segment. 8. A cyclic redundancy checker, comprising: a first plurality of thread hardware units of a graphics processing unit, wherein a first thread hardware unit comprises: 1) a first execution core; 2) local memory for storage of an input data segment, wherein the input data segment is a portion of an input data sequence for which a cyclic redundancy check value is to be obtained; and 3) an interface to access a global memory of the graphics processing unit and accessible to the first plurality of thread hardware units, for storing a plurality of generator segments in the global memory, wherein the generator segments are based on a cyclic redundancy check sequence; a second plurality of thread hardware units, wherein a second thread hardware unit comprises: 1) a second execution core; and 2) an instruction cache having stored therein first instructions for performing a modulo operation with a thread output of the first thread hardware unit modulo a generator polynomial corresponding to the cyclic redundancy check sequence and second instructions for performing an exclusive OR operation with thread outputs of the first plurality of thread hardware units; and an output for outputting the cyclic redundancy check value. 9. The cyclic redundancy checker of claim 8, further comprising: a comparator for comparing the cyclic redundancy check value with a received cyclic redundancy check value received in association with the input data segment; and a first storage for storing a precomputed generator segment computed as a first function of a thread position and the generator polynomial, wherein the first storage is stored in a graphics processing unit global memory. 10. The cyclic redundancy checker of claim 8, wherein the second plurality of thread hardware units comprise a third plurality of thread hardware units for executing a parallel tree of exclusive OR operations. 11. The cyclic redundancy checker of claim 8, wherein the cyclic redundancy check sequence is a first function of the generator polynomial, the input data sequence corresponds to a data polynomial, and the cyclic redundancy check value comprises a remainder of a polynomial division of a second function of the data polynomial times the generator polynomial. 12. The cyclic redundancy checker of claim 11, further comprising a thread manager for allocating the data polynomial among threads of the first plurality of thread hardware units by parsing the data polynomial into a plurality of input data segments sized to fit a thread local memory data width. 13. The cyclic redundancy checker of claim 12, wherein the interface allocates at least one of the generator polynomial or a polynomial factor among threads of the first plurality of thread hardware units by parsing at least one of the generator polynomial or the polynomial factor into the plurality of generator segments sized to fit the thread local memory data width. 14. The cyclic redundancy checker of claim 12, further comprising: a second storage in the global memory for storage of a precomputed generator segment independent of the input data sequence as a third function of a thread position and the generator polynomial. 15. The cyclic redundancy checker of claim 12, further comprising: a second storage in the global memory for a lookup table, wherein the lookup table comprises a first set of precomputed entries for a first thread having a first thread position, and wherein the first set of precomputed entries comprises values of polynomial multiplication of possible values of input data segments and a first generator segment associated with the first thread position. 16. A software-defined radio for communications in a mobile device communications system, comprising: a graphics processing unit comprising a plurality of thread hardware units comprising: a) a first thread hardware unit comprising a first execution core, a first instruction cache, a first local memory, and a first load/store unit coupled to a shared memory shared among threads of the plurality of thread hardware units and coupled to a global memory of the graphics processing unit; and b) a second thread hardware unit comprising a second execution core, a second instruction cache, a second local memory, and a second load/store unit coupled to the shared memory shared and coupled to the global memory, wherein the first instruction cache comprises a first set of instructions for: 1) obtaining a first input data segment, wherein the first input data segment is a first portion of an input data sequence received by the software-defined radio; 2) obtaining a first cyclic redundancy check segment, wherein the first cyclic redundancy check segment is a first portion of a cyclic redundancy check sequence; and 3) performing a first multiplication operation on the first input data segment and the first cyclic redundancy check segment to form a first thread output; and wherein the second instruction cache comprises a second set of instructions for: 1) obtaining a second input data segment, wherein the second input data segment is a second portion of the input data sequence received by the software- defined radio; 2) obtaining a second cyclic redundancy check segment, wherein the second cyclic redundancy check segment is a second portion of the cyclic redundancy check sequence; and 3) performing a second multiplication operation on the second input data segment and the second cyclic redundancy check segment to form a second thread output; and c) a third thread hardware unit for performing a reduction operation on the first thread output and the second thread output to perform performing a cyclic redundancy check operation over the input data sequence and the cyclic redundancy check sequence, to form a cyclic redundancy check result representing a cyclic redundancy check of the input data sequence. 17. The software-defined radio of claim 16, wherein the cyclic redundancy check sequence is a first function of a generator polynomial, the input data sequence corresponds to a data polynomial, and the cyclic redundancy check result comprises a remainder of a polynomial division of a second function of the data polynomial times the generator polynomial. 18. The software-defined radio of claim 17, wherein the graphics processing unit is configured to allocate the input data sequence to the first thread hardware unit and the second thread hardware unit by allocating the data polynomial among the first thread hardware unit and the second thread hardware unit by parsing the data polynomial into a plurality of input data segments sized to fit a thread local memory data width. 19. The software-defined radio of claim 18, wherein the graphics processing unit is configured to allocate the cyclic redundancy check sequence to the first thread hardware unit and the second thread hardware unit comprises allocating at least one of the generator polynomial or a polynomial factor among the first thread hardware unit and the second thread hardware unit by parsing at least one of the generator polynomial or the polynomial factor into a plurality of generator segments sized to fit the thread local memory data width. 20. The software-defined radio of claim 17, further comprising: a second storage in the global memory for storage of a precomputed generator segment independent of the input data sequence as a third function of a thread position and the generator polynomial. 21. The software-defined radio of claim 17, further comprising: a second storage in the global memory for a lookup table, wherein the lookup table comprises a first set of precomputed entries for the first thread hardware unit having a first thread position, and wherein the first set of precomputed entries comprises values of polynomial multiplication of possible values of input data segments and a first generator segment associated with the first thread position. 22. A method, comprising: obtaining an input data sequence, representable as a binary polynomial; obtaining a generator polynomial for a cyclic redundancy check (CRC) process; parsing the binary polynomial into a plurality of input data segments; allocating a first input data segment of the plurality of input data segments to a first thread of a graphics processing unit (GPU) according to a first thread position of the first thread; allocating a second input data segment of the plurality of input data segments to a second thread of the GPU according to a second thread position of the second thread; parsing the generator polynomial into a plurality of generator segments; allocating a first generator segment of the plurality of generator segments to the first thread, wherein the first generator segment is a first monomial modulo the generator polynomial, wherein a first degree of the first monomial corresponds to the first thread position; allocating a second generator segment of the plurality of generator segments to the second thread, wherein the second generator segment is a second monomial modulo the generator polynomial, wherein a second degree of the second monomial corresponds to the second thread position; using the first thread, performing a first polynomial multiplication of the first input data segment and the first generator segment modulo the generator polynomial to form a first thread output; using the second thread, performing a second polynomial multiplication of the second input data segment and the second generator segment modulo the generator polynomial to form a second thread output, wherein the second thread performs the second polynomial multiplication in parallel with the first thread performing the first polynomial multiplication; using at least a third thread of the GPU, performing an exclusive OR operation on the first thread output and the second thread output to form a third thread output; and performing zero or more exclusive OR operations on the third thread output and on threads allocated additional input data segments other than the first input data segment and the second input data segment to form a computed CRC value comprising a polynomial multiplication of the binary polynomial by a CRC monomial with a CRC monomial degree corresponding to a degree of the generator polynomial modulo the generator polynomial. 23. The method of claim 22, wherein the generator polynomial is one or more of 24. The method of claim 22, further comprising: obtaining a received CRC value received in association with the input data sequence; and comparing the received CRC value with the computed CRC value. 25. The method of claim 24, further comprising: determining if the received CRC value and the computed CRC value differ; and flagging a difference between the received CRC value and the computed CRC value. 26. The method of claim 22, further comprising: providing the computed CRC value to associated with the input data sequence. 27. The method of claim 22, wherein the computed CRC value is computed for data on an uplink for a mobile device to cellular infrastructure servicing multiple mobile devices. |
In at least one embodiment, exemplary registers that may be initialized by an operating system are shown in Table 2. Table 2 –Operating System Initialized Registers In at least one embodiment, each WD 1584 is specific to a particular graphics acceleration module 1546 and/or graphics processing engines 1531-1532, N. In at least one embodiment, it contains all information required by a graphics processing engine 1531-1532, N to do work or it can be a pointer to a memory location where an application has set up a command queue of work to be completed. FIG.15E illustrates additional details for at least one embodiment of a shared model. In at least one embodiment, a hypervisor real address space 1598 is included in which a process element list 1599 is stored. In at least one embodiment, hypervisor real address space 1598 is accessible via a hypervisor 1596 that virtualizes graphics acceleration module engines for operating system 1595. In at least one embodiment, shared programming models allow for all or a subset of processes from all or a subset of partitions in a system to use a graphics acceleration module 1546. In at least one embodiment, there are two programming models where graphics acceleration module 1546 is shared by multiple processes and partitions: time-sliced shared and graphics directed shared. In at least one embodiment, in this model, system hypervisor 1596 owns graphics acceleration module 1546 and makes its function available to all operating systems 1595. In at least one embodiment, for a graphics acceleration module 1546 to support virtualization by system hypervisor 1596, graphics acceleration module 1546 may adhere to the following: 1) An application’s job request must be autonomous (that is, state does not need to be maintained between jobs), or graphics acceleration module 1546 must provide a context save and restore mechanism; 2) An application’s job request is guaranteed by graphics acceleration module 1546 to complete in a specified amount of time, including any translation faults, or graphics acceleration module 1546 provides an ability to preempt processing of a job; and 3) Graphics acceleration module 1546 must be guaranteed fairness between processes when operating in a directed shared programming model. In at least one embodiment, application 1580 is required to make an operating system 1595 system call with a graphics acceleration module 1546 type, a work descriptor (WD), an authority mask register (AMR) value, and a context save/restore area pointer (CSRP). In at least one embodiment, graphics acceleration module 1546 type describes a targeted acceleration function for a system call. In at least one embodiment, graphics acceleration module 1546 type may be a system-specific value. In at least one embodiment, WD is formatted specifically for graphics acceleration module 1546 and can be in a form of a graphics acceleration module 1546 command, an effective address pointer to a user-defined structure, an effective address pointer to a queue of commands, or any other data structure to describe work to be done by graphics acceleration module 1546. In at least one embodiment, an AMR value is an AMR state to use for a current process. In at least one embodiment, a value passed to an operating system is similar to an application setting an AMR. In at least one embodiment, if accelerator integration circuit 1536 and graphics acceleration module 1546 implementations do not support a User Authority Mask Override Register (UAMOR), an operating system may apply a current UAMOR value to an AMR value before passing an AMR in a hypervisor call. In at least one embodiment, hypervisor 1596 may apply a current Authority Mask Override Register (AMOR) value before placing an AMR into process element 1583. In at least one embodiment, CSRP is one of registers 1545 containing an effective address of an area in an application’s address space 1582 for graphics acceleration module 1546 to save and restore context state. In at least one embodiment, this pointer is not required if no state is required to be saved between jobs or when a job is preempted. In at least one embodiment, context save/restore area may be pinned system memory. In at least one embodiment, upon receiving a system call, operating system 1595 may verify that application 1580 has registered and been given authority to use graphics acceleration module 1546. In at least one embodiment, operating system 1595 then calls hypervisor 1596 with information shown in Table 3. Table 3 –OS to Hypervisor Call Parameters In at least one embodiment, upon receiving a hypervisor call, hypervisor 1596 verifies that operating system 1595 has registered and been given authority to use graphics acceleration module 1546. In at least one embodiment, hypervisor 1596 then puts process element 1583 into a process element linked list for a corresponding graphics acceleration module 1546 type. In at least one embodiment, a process element may include information shown in Table 4. Table 4 –Process Element Information In at least one embodiment, hypervisor initializes a plurality of accelerator integration slice 1590 registers 1545. In at least one embodiment, as illustrated in FIG.15F, a unified memory is used, addressable via a common virtual memory address space used to access physical processor memories 1501-1502 and GPU memories 1520-1523. In at least one embodiment, in this implementation, operations executed on GPUs 1510-1513 utilize a same virtual/effective memory address space to access processor memories 1501-1502 and vice versa, thereby simplifying programmability. In at least one embodiment, a first portion of a virtual/effective address space is allocated to processor memory 1501, a second portion to second processor memory 1502, a third portion to GPU memory 1520, and so on. In at least one embodiment, an entire virtual/effective memory space (sometimes referred to as an effective address space) is thereby distributed across each of processor memories 1501-1502 and GPU memories 1520-1523, allowing any processor or GPU to access any physical memory with a virtual address mapped to that memory. In at least one embodiment, bias/coherence management circuitry 1594A-1594E within one or more of MMUs 1539A-1539E ensures cache coherence between caches of one or more host processors (e.g., 1505) and GPUs 1510-1513 and implements biasing techniques indicating physical memories in which certain types of data should be stored. While multiple instances of bias/coherence management circuitry 1594A-1594E are illustrated in FIG.15F, bias/coherence circuitry may be implemented within an MMU of one or more host processors 1505 and/or within accelerator integration circuit 1536. One embodiment allows GPU-attached memory 1520-1523 to be mapped as part of system memory, and accessed using shared virtual memory (SVM) technology, but without suffering performance drawbacks associated with full system cache coherence. In at least one embodiment, an ability for GPU-attached memory 1520-1523 to be accessed as system memory without onerous cache coherence overhead provides a beneficial operating environment for GPU offload. In at least one embodiment, this arrangement allows host processor 1505 software to setup operands and access computation results, without overhead of tradition I/O DMA data copies. In at least one embodiment, such traditional copies involve driver calls, interrupts and memory mapped I/O (MMIO) accesses that are all inefficient relative to simple memory accesses. In at least one embodiment, an ability to access GPU attached memory 1520-1523 without cache coherence overheads can be critical to execution time of an offloaded computation. In at least one embodiment, in cases with substantial streaming write memory traffic, for example, cache coherence overhead can significantly reduce an effective write bandwidth seen by a GPU 1510-1513. In at least one embodiment, efficiency of operand setup, efficiency of results access, and efficiency of GPU computation may play a role in determining effectiveness of a GPU offload. In at least one embodiment, selection of GPU bias and host processor bias is driven by a bias tracker data structure. In at least one embodiment, a bias table may be used, for example, which may be a page-granular structure (e.g., controlled at a granularity of a memory page) that includes 1 or 2 bits per GPU-attached memory page. In at least one embodiment, a bias table may be implemented in a stolen memory range of one or more GPU-attached memories 1520-1523, with or without a bias cache in GPU 1510-1513 (e.g., to cache frequently/recently used entries of a bias table). In at least one embodiment, alternatively, an entire bias table may be maintained within a GPU. In at least one embodiment, a bias table entry associated with each access to GPU-attached memory 1520-1523 is accessed prior to actual access to a GPU memory, causing the following operations. In at least one embodiment, first, local requests from GPU 1510-1513 that find their page in GPU bias are forwarded directly to a corresponding GPU memory 1520-1523. In at least one embodiment, local requests from a GPU that find their page in host bias are forwarded to processor 1505 (e.g., over a high-speed link as discussed above). In at least one embodiment, requests from processor 1505 that find a requested page in host processor bias complete a request like a normal memory read. In at least one embodiment, alternatively, requests directed to a GPU-biased page may be forwarded to GPU 1510-1513. In at least one embodiment, a GPU may then transition a page to a host processor bias if it is not currently using a page. In at least one embodiment, bias state of a page can be changed either by a software-based mechanism, a hardware-assisted software- based mechanism, or, for a limited set of cases, a purely hardware-based mechanism. In at least one embodiment, one mechanism for changing bias state employs an API call (e.g., OpenCL), which, in turn, calls a GPU’s device driver which, in turn, sends a message (or enqueues a command descriptor) to a GPU directing it to change a bias state and, for some transitions, perform a cache flushing operation in a host. In at least one embodiment, cache flushing operation is used for a transition from host processor 1505 bias to GPU bias, but is not for an opposite transition. In at least one embodiment, cache coherency is maintained by temporarily rendering GPU-biased pages uncacheable by host processor 1505. In at least one embodiment, to access these pages, processor 1505 may request access from GPU 1510 which may or may not grant access right away. In at least one embodiment, thus, to reduce communication between processor 1505 and GPU 1510 it is beneficial to ensure that GPU-biased pages are those which are required by a GPU but not host processor 1505 and vice versa. In at least one embodiment, hardware structure(s) 715 are used to perform one or more embodiments. Details regarding the hardware structure(x) 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIG.15 to perform CRC generation and/or checking. FIGS.16A and 16B illustrate exemplary integrated circuits and associated graphics processors that may be fabricated using one or more IP cores, according to various embodiments described herein. In addition to what is illustrated, other logic and circuits may be included in at least one embodiment, including additional graphics processors/cores, peripheral interface controllers, or general-purpose processor cores. FIGS.16A and 16B are block diagrams illustrating exemplary graphics processors for use within a SoC, according to embodiments described herein. FIG.16A illustrates an exemplary graphics processor 1610 of a system on a chip integrated circuit that may be fabricated using one or more IP cores, according to at least one embodiment. FIG.16B illustrates an additional exemplary graphics processor 1640 of a system on a chip integrated circuit that may be fabricated using one or more IP cores, according to at least one embodiment. In at least one embodiment, graphics processor 1610 of FIG.16A is a low power graphics processor core. In at least one embodiment, graphics processor 1640 of FIG. 16B is a higher performance graphics processor core. In at least one embodiment, each of graphics processors 1610, 1640 can be variants of graphics processor 1410 of FIG.14. In at least one embodiment, a graphics processor 1610 includes a vertex processor 1605 and one or more fragment processor(s) 1615A-1615N (e.g., 1615A, 1615B, 1615C, 1615D, through 1615N-1, and 1615N). In at least one embodiment, a graphics processor 1610 can execute different shader programs via separate logic, such that a vertex processor 1605 is optimized to execute operations for vertex shader programs, while one or more fragment processor(s) 1615A-1615N execute fragment (e.g., pixel) shading operations for fragment or pixel shader programs. In at least one embodiment, a vertex processor 1605 performs a vertex processing stage of a 3D graphics pipeline and generates primitives and vertex data. In at least one embodiment, fragment processor(s) 1615A-1615N use primitive and vertex data generated by vertex processor 1605 to produce a framebuffer that is displayed on a display device. In at least one embodiment, fragment processor(s) 1615A-1615N are optimized to execute fragment shader programs as provided for in an OpenGL API, which may be used to perform similar operations as a pixel shader program as provided for in a Direct 3D API. In at least one embodiment, a graphics processor 1610 additionally includes one or more memory management units (MMUs) 1620A-1620B, cache(s) 1625A-1625B, and circuit interconnect(s) 1630A-1630B. In at least one embodiment, one or more MMU(s) 1620A- 1620B provide for virtual to physical address mapping for a graphics processor 1610, including for a vertex processor 1605 and/or fragment processor(s) 1615A-1615N, which may reference vertex or image/texture data stored in memory, in addition to vertex or image/texture data stored in one or more cache(s) 1625A-1625B. In at least one embodiment, one or more MMU(s) 1620A-1620B may be synchronized with other MMUs within a system, including one or more MMUs associated with one or more application processor(s) 1405, image processors 1415, and/or video processors 1420 of FIG.14, such that each processor 1405-1420 can participate in a shared or unified virtual memory system. In at least one embodiment, one or more circuit interconnect(s) 1630A-1630B enable a graphics processor 1610 to interface with other IP cores within SoC, either via an internal bus of aSoC or via a direct connection. In at least one embodiment, a graphics processor 1640 includes one or more MMU(s) 1620A-1620B, caches 1625A-1625B, and circuit interconnects 1630A-1630B of graphics processor 1610 of FIG.16A. In at least one embodiment, a graphics processor 1640 includes one or more shader core(s) 1655A-1655N (e.g., 1655A, 1655B, 1655C, 1655D, 1655E, 1655F, through 1655N-1, and 1655N), which provides for a unified shader core architecture in which a single core or type of core can execute all types of programmable shader code, including shader program code to implement vertex shaders, fragment shaders, and/or compute shaders. In at least one embodiment, a number of shader cores can vary. In at least one embodiment, a graphics processor 1640 includes an inter-core task manager 1645, which acts as a thread dispatcher to dispatch execution threads to one or more shader cores 1655A-1655N and a tiling unit 1658 to accelerate tiling operations for tile-based rendering, in which rendering operations for a scene are subdivided in image space, for example to exploit local spatial coherence within a scene or to optimize use of internal caches. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, inference and/or training logic 715 may be used in integrated circuit 16A and/or 16B for inferencing or predicting operations based, at least in part, on weight parameters calculated using neural network training operations, neural network functions and/or architectures, or neural network use cases described herein. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIG.16A or 16B to perform CRC generation and/or checking. FIGS.17A and 17B illustrate additional exemplary graphics processor logic according to embodiments described herein. FIG.17A illustrates a graphics core 1700 that may be included within a graphics processor 1410 of FIG.14, in at least one embodiment, and may be a unified shader core 1655A-1655N as in FIG.16B in at least one embodiment. FIG.17B illustrates a highly parallel general-purpose graphics processing unit 1730 suitable for deployment on a multi-chip module in at least one embodiment. In at least one embodiment, a graphics core 1700 includes a shared instruction cache 1702, a texture unit 1718, and a cache/shared memory 1720 that are common to execution resources within a graphics core 1700. In at least one embodiment, a graphics core 1700 can include multiple slices 1701A-1701N or partitions for each core, and a graphics processor can include multiple instances of a graphics core 1700. In at least one embodiment, slices 1701A-1701N can include support logic including a local instruction cache 1704A-1704N, a thread scheduler 1706A-1706N, a thread dispatcher 1708A-1708N, and a set of registers 1710A-1710N. In at least one embodiment, slices 1701A-1701N can include a set of additional function units (AFUs 1712A-1712N), floating-point units (FPU 1714A-1714N), integer arithmetic logic units (ALUs 1716-1716N), address computational units (ACU 1713A-1713N), double-precision floating-point units (DPFPU 1715A-1715N), and matrix processing units (MPU 1717A-1717N). In at least one embodiment, FPUs 1714A-1714N can perform single-precision (32- bit) and half-precision (16-bit) floating point operations, while DPFPUs 1715A-1715N perform double precision (64-bit) floating point operations. In at least one embodiment, ALUs 1716A-1716N can perform variable precision integer operations at 8-bit, 16-bit, and 32-bit precision, and can be configured for mixed precision operations. In at least one embodiment, MPUs 1717A-1717N can also be configured for mixed precision matrix operations, including half-precision floating point and 8-bit integer operations. In at least one embodiment, MPUs 1717-1717N can perform a variety of matrix operations to accelerate machine learning application frameworks, including enabling support for accelerated general matrix to matrix multiplication (GEMM). In at least one embodiment, AFUs 1712A-1712N can perform additional logic operations not supported by floating-point or integer units, including trigonometric operations (e.g., sine, cosine, etc.). Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, inference and/or training logic 715 may be used in graphics core 1700 for inferencing or predicting operations based, at least in part, on weight parameters calculated using neural network training operations, neural network functions and/or architectures, or neural network use cases described herein. FIG.17B illustrates a general-purpose processing unit (GPGPU) 1730 that can be configured to enable highly parallel compute operations to be performed by an array of graphics processing units, in at least one embodiment. In at least one embodiment, a GPGPU 1730 can be linked directly to other instances of a GPGPU 1730 to create a multi-GPU cluster to improve training speed for deep neural networks. In at least one embodiment, a GPGPU 1730 includes a host interface 1732 to enable a connection with a host processor. In at least one embodiment, a host interface 1732 is a PCI Express interface. In at least one embodiment, host interface 1732 can be a vendor specific communications interface or communications fabric. In at least one embodiment, a GPGPU 1730 receives commands from a host processor and uses a global scheduler 1734 to distribute execution threads associated with those commands to a set of compute clusters 1736A-1736H. In at least one embodiment, compute clusters 1736A-1736H share a cache memory 1738. In at least one embodiment, cache memory 1738 can serve as a higher-level cache for cache memories within compute clusters 1736A-1736H. In at least one embodiment, GPGPU 1730 includes memory 1744A-1744B coupled with compute clusters 1736A-1736H via a set of memory controllers 1742A-1742B. In at least one embodiment, memory 1744A-1744B can include various types of memory devices including dynamic random access memory (DRAM) or graphics random access memory, such as synchronous graphics random access memory (SGRAM), including graphics double data rate (GDDR) memory. In at least one embodiment, compute clusters 1736A-1736H each include a set of graphics cores, such as a graphics core 1700 of FIG.17A, which can include multiple types of integer and floating point logic units that can perform computational operations at a range of precisions including suited for machine learning computations. For example, in at least one embodiment, at least a subset of floating point units in each of compute clusters 1736A- 1736H can be configured to perform 16-bit or 32-bit floating point operations, while a different subset of those floating point units can be configured to perform 64-bit floating point operations. In at least one embodiment, multiple instances of a GPGPU 1730 can be configured to operate as a compute cluster. In at least one embodiment, communication used by compute clusters 1736A-1736H for synchronization and data exchange varies across embodiments. In at least one embodiment, multiple instances of a GPGPU 1730 communicate over a host interface 1732. In at least one embodiment, a GPGPU 1730 includes an I/O hub 1739 that couples a GPGPU 1730 with a GPU link 1740 that enables a direct connection to other instances of a GPGPU 1730. In at least one embodiment, a GPU link 1740 is coupled to a dedicated GPU-to-GPU bridge that enables communication and synchronization between multiple instances of a GPGPU 1730. In at least one embodiment, a GPU link 1740 couples with a high speed interconnect to transmit and receive data to other GPGPUs or parallel processors. In at least one embodiment, multiple instances of a GPGPU 1730 are located in separate data processing systems and communicate via a network device that is accessible via host interface 1732. In at least one embodiment, a GPU link 1740 can be configured to enable a connection to a host processor in addition to or as an alternative to host interface 1732. In at least one embodiment, a GPGPU 1730 can be configured to train neural networks. In at least one embodiment, a GPGPU 1730 can be used within an inferencing platform. In at least one embodiment, in which a GPGPU 1730 is used for inferencing, a GPGPU may include fewer compute clusters 1736A-1736H relative to when a GPGPU is used for training a neural network. In at least one embodiment, memory technology associated with memory 1744A-1744B may differ between inferencing and training configurations, with higher bandwidth memory technologies devoted to training configurations. In at least one embodiment, inferencing configuration of a GPGPU 1730 can support inferencing specific instructions. For example, in at least one embodiment, an inferencing configuration can provide support for one or more 8-bit integer dot product instructions, which may be used during inferencing operations for deployed neural networks. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, inference and/or training logic 715 may be used in a GPGPU 1730 for inferencing or predicting operations based, at least in part, on weight parameters calculated using neural network training operations, neural network functions and/or architectures, or neural network use cases described herein. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIG.17A or FIG.17B to perform CRC generation and/or checking. FIG.18 is a block diagram illustrating a computing system 1800 according to at least one embodiment. In at least one embodiment, a computing system 1800 includes a processing subsystem 1801 having one or more processor(s) 1802 and a system memory 1804 communicating via an interconnection path that may include a memory hub 1805. In at least one embodiment, a memory hub 1805 may be a separate component within a chipset component or may be integrated within one or more processor(s) 1802. In at least one embodiment, a memory hub 1805 couples with an I/O subsystem 1811 via a communication link 1806. In at least one embodiment, an I/O subsystem 1811 includes an I/O hub 1807 that can enable a computing system 1800 to receive input from one or more input device(s) 1808. In at least one embodiment, an I/O hub 1807 can enable a display controller, which may be included in one or more processor(s) 1802, to provide outputs to one or more display device(s) 1810A. In at least one embodiment, one or more display device(s) 1810A coupled with I/O hub 1807 can include a local, internal, or embedded display device. In at least one embodiment, a processing subsystem 1801 includes one or more parallel processor(s) 1812 coupled to a memory hub 1805 via a bus or other communication link 1813 as shown in FIG.18. In at least one embodiment, a communication link 1813 may be one of any number of standards based communication link technologies or protocols, such as, but not limited to PCI Express, or may be a vendor specific communications interface or communications fabric. In at least one embodiment, one or more parallel processor(s) 1812 form a computationally focused parallel or vector processing system that can include a large number of processing cores and/or processing clusters, such as a many integrated core (MIC) processor. In at least one embodiment, one or more parallel processor(s) 1812 form a graphics processing subsystem that can output pixels to one of one or more display device(s) 1810A coupled via I/O Hub 1807. In at least one embodiment, one or more parallel processor(s) 1812 can also include a display controller and display interface (not shown) to enable a direct connection to one or more display device(s) 1810B. In at least one embodiment, a system storage unit 1814 can connect to an I/O hub 1807 to provide a storage mechanism for computing system 1800. In at least one embodiment, an I/O switch 1816 can be used to provide an interface mechanism to enable connections between an I/O hub 1807 and other components, such as a network adapter 1818 and/or wireless network adapter 1819 that may be integrated into a platform, and various other devices that can be added via one or more add-in device(s) 1820. In at least one embodiment, a network adapter 1818 can be an Ethernet adapter or another wired network adapter. In at least one embodiment, a wireless network adapter 1819 can include one or more of a Wi-Fi, Bluetooth, near field communication (NFC), or other network device that includes one or more wireless radios. In at least one embodiment, a computing system 1800 can include other components not explicitly shown, including USB or other port connections, optical storage drives, video capture devices, and the like, may also be connected to an I/O hub 1807. In at least one embodiment, communication paths interconnecting various components in FIG.18 may be implemented using any suitable protocols, such as PCI (Peripheral Component Interconnect) based protocols (e.g., PCI-Express), or other bus or point-to-point communication interfaces and/or protocol(s), such as an NVLink high-speed interconnect, or interconnect protocols. In at least one embodiment, one or more parallel processor(s) 1812 incorporate circuitry optimized for graphics and video processing, including, for example, video output circuitry, and constitute a graphics processing unit (GPU). In at least one embodiment, one or more parallel processor(s) 1812 incorporate circuitry optimized for general purpose processing. In at least one embodiment, components of a computing system 1800 may be integrated with one or more other system elements on a single integrated circuit. For example, in at least one embodiment, one or more parallel processor(s) 1812, a memory hub 1805, processor(s) 1802, and an I/O hub 1807 can be integrated into a system on chip (SoC) integrated circuit. In at least one embodiment, components of a computing system 1800 can be integrated into a single package to form a system in package (SIP) configuration. In at least one embodiment, at least a portion of components of computing system 1800 can be integrated into a multi-chip module (MCM), which can be interconnected with other multi- chip modules into a modular computing system. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, inference and/or training logic 715 may be used in system FIG.18 for inferencing or predicting operations based, at least in part, on weight parameters calculated using neural network training operations, neural network functions and/or architectures, or neural network use cases described herein. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIG.18 to perform CRC generation and/or checking. PROCESSORS FIG.19A illustrates a parallel processor 1900 according to at least one embodiment. In at least one embodiment, various components of a parallel processor 1900 may be implemented using one or more integrated circuit devices, such as programmable processors, application specific integrated circuits (ASICs), or field programmable gate arrays (FPGA). In at least one embodiment, an illustrated parallel processor 1900 is a variant of one or more parallel processor(s) 1812 shown in FIG.18 according to at least one embodiment. In at least one embodiment, a parallel processor 1900 includes a parallel processing unit 1902. In at least one embodiment, a parallel processing unit 1902 includes an I/O unit 1904 that enables communication with other devices, including other instances of a parallel processing unit 1902. In at least one embodiment, I/O unit 1904 may be directly connected to other devices. In at least one embodiment, I/O unit 1904 connects with other devices via use of a hub or switch interface, such as memory hub 1905. In at least one embodiment, connections between a memory hub 1905 and an I/O unit 1904 form a communication link 1813 as shown in FIG.18. In at least one embodiment, an I/O unit 1904 connects with a host interface 1906 and a memory crossbar 1916, where host interface 1906 receives commands directed to performing processing operations and a memory crossbar 1916 receives commands directed to performing memory operations. In at least one embodiment, when a host interface 1906 receives a command buffer via an I/O unit 1904, a host interface 1906 can direct work operations to perform those commands to a front end 1908. In at least one embodiment, a front end 1908 couples with a scheduler 1910, which is configured to distribute commands or other work items to a processing cluster array 1912. In at least one embodiment, a scheduler 1910 ensures that processing cluster array 1912 is properly configured and in a valid state before tasks are distributed to a processing cluster array 1912. In at least one embodiment, a scheduler 1910 is implemented via firmware logic executing on a microcontroller. In at least one embodiment, a microcontroller implemented scheduler 1910 is configurable to perform complex scheduling and work distribution operations at coarse and fine granularity, enabling rapid preemption and context switching of threads executing on a processing array 1912. In at least one embodiment, host software can prove workloads for scheduling on a processing array 1912 via one of multiple graphics processing doorbells. In at least one embodiment, workloads can then be automatically distributed across a processing array 1912 by a scheduler 1910 logic within a microcontroller including a scheduler 1910. In at least one embodiment, a processing cluster array 1912 can include up to “N” processing clusters (e.g., cluster 1914A, cluster 1914B, through cluster 1914N). In at least one embodiment, each cluster 1914A-1914N of a processing cluster array 1912 can execute a large number of concurrent threads. In at least one embodiment, a scheduler 1910 can allocate work to clusters 1914A-1914N of a processing cluster array 1912 using various scheduling and/or work distribution algorithms, which may vary depending on workload arising for each type of program or computation. In at least one embodiment, scheduling can be handled dynamically by a scheduler 1910, or can be assisted in part by compiler logic during compilation of program logic configured for execution by processing cluster array 1912. In at least one embodiment, different clusters 1914A-1914N of processing cluster array 1912 can be allocated for processing different types of programs or for performing different types of computations. In at least one embodiment, a processing cluster array 1912 can be configured to perform various types of parallel processing operations. In at least one embodiment, a processing cluster array 1912 is configured to perform general-purpose parallel compute operations. For example, in at least one embodiment, a processing cluster array 1912 can include logic to execute processing tasks including filtering of video and/or audio data, performing modeling operations, including physics operations, and performing data transformations. In at least one embodiment, a processing cluster array 1912 is configured to perform parallel graphics processing operations. In at least one embodiment, a processing cluster array 1912 can include additional logic to support execution of such graphics processing operations, including, but not limited to texture sampling logic to perform texture operations, as well as tessellation logic and other vertex processing logic. In at least one embodiment, a processing cluster array 1912 can be configured to execute graphics processing related shader programs such as, but not limited to vertex shaders, tessellation shaders, geometry shaders, and pixel shaders. In at least one embodiment, a parallel processing unit 1902 can transfer data from a system memory via an I/O unit 1904 for processing. In at least one embodiment, during processing, transferred data can be stored to on-chip memory (e.g., parallel processor memory 1922) during processing, then written back to system memory. In at least one embodiment, when a parallel processing unit 1902 is used to perform graphics processing, a scheduler 1910 can be configured to divide a processing workload into approximately equal sized tasks, to better enable distribution of graphics processing operations to multiple clusters 1914A-1914N of a processing cluster array 1912. In at least one embodiment, portions of a processing cluster array 1912 can be configured to perform different types of processing. For example, in at least one embodiment, a first portion may be configured to perform vertex shading and topology generation, a second portion may be configured to perform tessellation and geometry shading, and a third portion may be configured to perform pixel shading or other screen space operations, to produce a rendered image for display. In at least one embodiment, intermediate data produced by one or more of clusters 1914A-1914N may be stored in buffers to allow intermediate data to be transmitted between clusters 1914A-1914N for further processing. In at least one embodiment, a processing cluster array 1912 can receive processing tasks to be executed via a scheduler 1910, which receives commands defining processing tasks from a front end 1908. In at least one embodiment, processing tasks can include indices of data to be processed, e.g., surface (patch) data, primitive data, vertex data, and/or pixel data, as well as state parameters and commands defining how data is to be processed (e.g., what program is to be executed). In at least one embodiment, a scheduler 1910 may be configured to fetch indices corresponding to tasks or may receive indices from a front end 1908. In at least one embodiment, a front end 1908 can be configured to ensure a processing cluster array 1912 is configured to a valid state before a workload specified by incoming command buffers (e.g., batch-buffers, push buffers, etc.) is initiated. In at least one embodiment, each of one or more instances of a parallel processing unit 1902 can couple with parallel processor memory 1922. In at least one embodiment, parallel processor memory 1922 can be accessed via a memory crossbar 1916, which can receive memory requests from a processing cluster array 1912 as well as an I/O unit 1904. In at least one embodiment, a memory crossbar 1916 can access parallel processor memory 1922 via a memory interface 1918. In at least one embodiment, memory interface 1918 can include multiple partition units (e.g., partition unit 1920A, partition unit 1920B, through partition unit 1920N) that can each couple to a portion (e.g., memory unit) of parallel processor memory 1922. In at least one embodiment, a number of partition units 1920A- 1920N is configured to be equal to a number of memory units, such that a first partition unit 1920A has a corresponding first memory unit 1924A, a second partition unit 1920B has a corresponding memory unit 1924B, and an Nth partition unit 1920N has a corresponding Nth memory unit 1924N. In at least one embodiment, a number of partition units 1920A-1920N may not be equal to a number of memory devices. In at least one embodiment, memory units 1924A-1924N can include various types of memory devices, including dynamic random access memory (DRAM) or graphics random access memory, such as synchronous graphics random access memory (SGRAM), including graphics double data rate (GDDR) memory. In at least one embodiment, memory units 1924A-1924N may also include 3D stacked memory, including but not limited to high bandwidth memory (HBM). In at least one embodiment, render targets, such as frame buffers or texture maps may be stored across memory units 1924A-1924N, allowing partition units 1920A-1920N to write portions of each render target in parallel to efficiently use available bandwidth of parallel processor memory 1922. In at least one embodiment, a local instance of parallel processor memory 1922 may be excluded in favor of a unified memory design that utilizes system memory in conjunction with local cache memory. In at least one embodiment, any one of clusters 1914A-1914N of a processing cluster array 1912 can process data that will be written to any of memory units 1924A-1924N within a parallel processor memory 1922. In at least one embodiment, a memory crossbar 1916 can be configured to transfer an output of each cluster 1914A-1914N to any partition unit 1920A-1920N or to another cluster 1914A-1914N, which can perform additional processing operations on an output. In at least one embodiment, each cluster 1914A-1914N can communicate with a memory interface 1918 through a memory crossbar 1916 to read from or write to various external memory devices. In at least one embodiment, a memory crossbar 1916 has a connection to a memory interface 1918 to communicate with an I/O unit 1904, as well as a connection to a local instance of a parallel processor memory 1922, enabling processing units within different processing clusters 1914A-1914N to communicate with system memory or other memory that is not local to a parallel processing unit 1902. In at least one embodiment, a memory crossbar 1916 can use virtual channels to separate traffic streams between clusters 1914A-1914N and partition units 1920A-1920N. In at least one embodiment, multiple instances of a parallel processing unit 1902 can be provided on a single add-in card, or multiple add-in cards can be interconnected. In at least one embodiment, different instances of a parallel processing unit 1902 can be configured to inter-operate even if different instances have different numbers of processing cores, different amounts of local parallel processor memory, and/or other configuration differences. For example, in at least one embodiment, some instances of a parallel processing unit 1902 can include higher precision floating point units relative to other instances. In at least one embodiment, systems incorporating one or more instances of a parallel processing unit 1902 or parallel processor 1900 can be implemented in a variety of configurations and form factors, including but not limited to desktop, laptop, or handheld personal computers, servers, workstations, game consoles, and/or embedded systems. FIG.19B is a block diagram of a partition unit 1920 according to at least one embodiment. In at least one embodiment, a partition unit 1920 is an instance of one of partition units 1920A-1920N of FIG.19A. In at least one embodiment, partition unit 1920 includes an L2 cache 1921, a frame buffer interface 1925, and an ROP 1926 (raster operations unit). In at least one embodiment, an L2 cache 1921 is a read/write cache that is configured to perform load and store operations received from a memory crossbar 1916 and ROP 1926. In at least one embodiment, read misses and urgent write-back requests are output by an L2 cache 1921 to frame buffer interface 1925 for processing. In at least one embodiment, updates can also be sent to a frame buffer via a frame buffer interface 1925 for processing. In at least one embodiment, a frame buffer interface 1925 interfaces with one of memory units in parallel processor memory, such as memory units 1924A-1924N of FIG. 19A (e.g., within parallel processor memory 1922). In at least one embodiment, an ROP 1926 is a processing unit that performs raster operations such as stencil, z test, blending, and a like. In at least one embodiment, an ROP 1926 then outputs processed graphics data that is stored in graphics memory. In at least one embodiment, an ROP 1926 includes compression logic to compress depth or color data that is written to memory and decompress depth or color data that is read from memory. In at least one embodiment, compression logic can be lossless compression logic that makes use of one or more of multiple compression algorithms. In at least one embodiment, types of compression that are performed by ROP 1926 can vary based on statistical characteristics of data to be compressed. For example, in at least one embodiment, delta color compression is performed on depth and color data on a per-tile basis. In at least one embodiment, ROP 1926 is included within each processing cluster (e.g., cluster 1914A-1914N of FIG.19) instead of within a partition unit 1920. In at least one embodiment, read and write requests for pixel data are transmitted over a memory crossbar 1916 instead of pixel fragment data. In at least one embodiment, processed graphics data may be displayed on a display device, such as one of one or more display device(s) 1810 of FIG.18, routed for further processing by processor(s) 1802, or routed for further processing by processing entities within a parallel processor 1900 of FIG.19A. FIG.19C is a block diagram of a processing cluster 1914 within a parallel processing unit according to at least one embodiment. In at least one embodiment, a processing cluster is an instance of one of processing clusters 1914A-1914N of FIG.19A. In at least one embodiment, a processing cluster 1914 can be configured to execute many threads in parallel, where term “thread” refers to an instance of a particular program executing on a particular set of input data. In at least one embodiment, single-instruction, multiple-data (SIMD) instruction issue techniques are used to support parallel execution of a large number of threads without providing multiple independent instruction units. In at least one embodiment, single-instruction, multiple-thread (SIMT) techniques are used to support parallel execution of a large number of generally synchronized threads, using a common instruction unit configured to issue instructions to a set of processing engines within each processing cluster. In at least one embodiment, operation of a processing cluster 1914 can be controlled via a pipeline manager 1932 that distributes processing tasks to SIMT parallel processors. In at least one embodiment, a pipeline manager 1932 receives instructions from a scheduler 1910 of FIG.19A and manages execution of those instructions via a graphics multiprocessor 1934 and/or a texture unit 1936. In at least one embodiment, a graphics multiprocessor 1934 is an exemplary instance of an SIMT parallel processor. However, in at least one embodiment, various types of SIMT parallel processors of differing architectures may be included within a processing cluster 1914. In at least one embodiment, one or more instances of a graphics multiprocessor 1934 can be included within a processing cluster 1914. In at least one embodiment, a graphics multiprocessor 1934 can process data and a data crossbar 1940 can be used to distribute processed data to one of multiple possible destinations, including other shader units. In at least one embodiment, a pipeline manager 1932 can facilitate distribution of processed data by specifying destinations for processed data to be distributed via a data crossbar 1940. In at least one embodiment, each graphics multiprocessor 1934 within processing cluster 1914 can include an identical set of functional execution logic (e.g., arithmetic logic units, load-store units, etc.). In at least one embodiment, functional execution logic can be configured in a pipelined manner in which new instructions can be issued before previous instructions are complete. In at least one embodiment, functional execution logic supports a variety of operations including integer and floating point arithmetic, comparison operations, Boolean operations, bit-shifting, and computation of various algebraic functions. In at least one embodiment, those same functional-unit hardware can be leveraged to perform different operations and any combination of functional units may be present. In at least one embodiment, instructions transmitted to a processing cluster 1914 constitute a thread. In at least one embodiment, a set of threads executing across a set of parallel processing engines is a thread group. In at least one embodiment, a thread group executes a program on different input data. In at least one embodiment, each thread within a thread group can be assigned to a different processing engine within a graphics multiprocessor 1934. In at least one embodiment, a thread group may include fewer threads than a number of processing engines within a graphics multiprocessor 1934. In at least one embodiment, when a thread group includes fewer threads than a number of processing engines, one or more of said processing engines may be idle during cycles in which that thread group is being processed. In at least one embodiment, a thread group may also include more threads than a number of processing engines within a graphics multiprocessor 1934. In at least one embodiment, when a thread group includes more threads than number of processing engines within a graphics multiprocessor 1934, processing can be performed over consecutive clock cycles. In at least one embodiment, multiple thread groups can be executed concurrently on a graphics multiprocessor 1934. In at least one embodiment, a graphics multiprocessor 1934 includes an internal cache memory to perform load and store operations. In at least one embodiment, a graphics multiprocessor 1934 can forego an internal cache and use a cache memory (e.g., an L1 cache 1948) within a processing cluster 1914. In at least one embodiment, each graphics multiprocessor 1934 also has access to L2 caches within partition units (e.g., partition units 1920A-1920N of FIG.19A) that are shared among all processing clusters 1914 and may be used to transfer data between threads. In at least one embodiment, a graphics multiprocessor 1934 may also access off-chip global memory, which can include one or more of local parallel processor memory and/or system memory. In at least one embodiment, any memory external to a parallel processing unit 1902 may be used as global memory. In at least one embodiment, a processing cluster 1914 includes multiple instances of graphics multiprocessor 1934 that can share common instructions and data, which may be stored in L1 cache 1948. In at least one embodiment, each processing cluster 1914 may include an MMU 1945 (memory management unit) that is configured to map virtual addresses into physical addresses. In at least one embodiment, one or more instances of an MMU 1945 may reside within a memory interface 1918 of FIG.19A. In at least one embodiment, an MMU 1945 includes a set of page table entries (PTEs) used to map a virtual address to a physical address of a tile (talk more about tiling) and a cache line index, if used. In at least one embodiment, an MMU 1945 may include address translation lookaside buffers (TLB) or caches that may reside within graphics multiprocessor 1934 or an L1 cache or processing cluster 1914. In at least one embodiment, a physical address is processed to distribute a surface data access locality to allow efficient request interleaving among partition units. In at least one embodiment, a cache line index may be used to determine whether a request for a cache line is a hit or miss. In at least one embodiment, a processing cluster 1914 may be configured such that each graphics multiprocessor 1934 is coupled to a texture unit 1936 for performing texture mapping operations, e.g., determining texture sample positions, reading texture data, and filtering texture data. In at least one embodiment, texture data is read from an internal texture L1 cache (not shown) or from an L1 cache within a graphics multiprocessor 1934 and is fetched from an L2 cache, a local parallel processor memory, or system memory, as needed. In at least one embodiment, each graphics multiprocessor 1934 outputs processed tasks to a data crossbar 1940 to provide a processed task to another processing cluster 1914 for further processing or to store a processed task in an L2 cache, local parallel processor memory, or system memory via a memory crossbar 1916. In at least one embodiment, a preROP 1942 (pre-raster operations unit) is configured to receive data from a graphics multiprocessor 1934, direct data to ROP units, which may be located with partition units as described herein (e.g., partition units 1920A-1920N of FIG.19A). In at least one embodiment, a PreROP 1942 unit can perform optimizations for color blending, organize pixel color data, and perform address translations. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, inference and/or training logic 715 may be used in a graphics processing cluster 1914 for inferencing or predicting operations based, at least in part, on weight parameters calculated using neural network training operations, neural network functions and/or architectures, or neural network use cases described herein. FIG.19D shows a graphics multiprocessor 1934 according to at least one embodiment. In at least one embodiment, a graphics multiprocessor 1934 couples with a pipeline manager 1932 of a processing cluster 1914. In at least one embodiment, a graphics multiprocessor 1934 has an execution pipeline including but not limited to an instruction cache 1952, an instruction unit 1954, an address mapping unit 1956, a register file 1958, one or more general purpose graphics processing unit (GPGPU) cores 1962, and one or more load/store units 1966. In at least one embodiment, GPGPU cores 1962 and load/store units 1966 are coupled with a cache memory 1972 and a shared memory 1970 via a memory and a cache interconnect 1968. In at least one embodiment, an instruction cache 1952 receives a stream of instructions to execute from a pipeline manager 1932. In at least one embodiment, instructions are cached in an instruction cache 1952 and dispatched for execution by an instruction unit 1954. In at least one embodiment, an instruction unit 1954 can dispatch instructions as thread groups (e.g., warps), with each thread of a thread group assigned to a different execution unit within a GPGPU core 1962. In at least one embodiment, an instruction can access any of a local, shared, or global address space by specifying an address within a unified address space. In at least one embodiment, an address mapping unit 1956 can be used to translate addresses in a unified address space into a distinct memory address that can be accessed by load/store units 1966. In at least one embodiment, a register file 1958 provides a set of registers for functional units of a graphics multiprocessor 1934. In at least one embodiment, a register file 1958 provides temporary storage for operands connected to data paths of functional units (e.g., GPGPU cores 1962, load/store units 1966) of a graphics multiprocessor 1934. In at least one embodiment, a register file 1958 is divided between each of those functional units such that each functional unit is allocated a dedicated portion of a register file 1958. In at least one embodiment, a register file 1958 is divided between different warps being executed by a graphics multiprocessor 1934. In at least one embodiment, GPGPU cores 1962 can each include floating point units (FPUs) and/or integer arithmetic logic units (ALUs) that are used to execute instructions of a graphics multiprocessor 1934. In at least one embodiment, GPGPU cores 1962 can be similar in architecture or can differ in architecture. In at least one embodiment, a first portion of GPGPU cores 1962 includes a single precision FPU and an integer ALU while a second portion of GPGPU cores includes a double precision FPU. In at least one embodiment, FPUs can implement the IEEE 754-2008 standard for floating point arithmetic or enable variable precision floating point arithmetic. In at least one embodiment, a graphics multiprocessor 1934 can additionally include one or more fixed function or special function units to perform specific functions such as copy rectangle or pixel blending operations. In at least one embodiment, one or more of GPGPU cores can also include fixed or special function logic. In at least one embodiment, GPGPU cores 1962 include SIMD logic capable of performing a single instruction on multiple sets of data. In at least one embodiment, GPGPU cores 1962 can physically execute SIMD4, SIMD8, and SIMD16 instructions and logically execute SIMD1, SIMD2, and SIMD32 instructions. In at least one embodiment, SIMD instructions for GPGPU cores can be generated at compile time by a shader compiler or automatically generated when executing programs written and compiled for single program multiple data (SPMD) or SIMT architectures. In at least one embodiment, multiple threads of a program configured for an SIMT execution model can executed via a single SIMD instruction. For example, in at least one embodiment, eight SIMT threads that perform same or similar operations can be executed in parallel via a single SIMD8 logic unit. In at least one embodiment, a memory and cache interconnect 1968 is an interconnect network that connects each functional unit of a graphics multiprocessor 1934 to register file 1958 and to a shared memory 1970. In at least one embodiment, a memory and cache interconnect 1968 is a crossbar interconnect that allows a load/store unit 1966 to implement load and store operations between a shared memory 1970 and a register file 1958. In at least one embodiment, a register file 1958 can operate at a same frequency as GPGPU cores 1962, thus data transfer between GPGPU cores 1962 and a register file 1958 is very low latency. In at least one embodiment, a shared memory 1970 can be used to enable communication between threads that execute on functional units within a graphics multiprocessor 1934. In at least one embodiment, a cache memory 1972 can be used as a data cache for example, to cache texture data communicated between functional units and a texture unit 1936. In at least one embodiment, a shared memory 1970 can also be used as a program managed cache. In at least one embodiment, threads executing on GPGPU cores 1962 can programmatically store data within a shared memory in addition to automatically cached data that is stored within a cache memory 1972. In at least one embodiment, a parallel processor or GPGPU as described herein is communicatively coupled to host/processor cores to accelerate graphics operations, machine-learning operations, pattern analysis operations, and various general purpose GPU (GPGPU) functions. In at least one embodiment, a GPU may be communicatively coupled to host processor/cores over a bus or other interconnect (e.g., a high speed interconnect such as PCIe or NVLink). In at least one embodiment, a GPU may be integrated on same package or chip as cores and communicatively coupled to cores over an internal processor bus/interconnect (e.g., internal to a package or chip). In at least one embodiment, regardless of manner in which a GPU is connected, processor cores may allocate work to a GPU in form of sequences of commands/instructions contained in a work descriptor. In at least one embodiment, a GPU then uses dedicated circuitry/logic for efficiently processing these commands/instructions. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, inference and/or training logic 715 may be used in a graphics multiprocessor 1934 for inferencing or predicting operations based, at least in part, on weight parameters calculated using neural network training operations, neural network functions and/or architectures, or neural network use cases described herein. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIG.19A through 19D to perform CRC generation and/or checking. FIG.20 illustrates a multi-GPU computing system 2000, according to at least one embodiment. In at least one embodiment, multi-GPU computing system 2000 can include a processor 2002 coupled to multiple general purpose graphics processing units (GPGPUs) 2006A-D via a host interface switch 2004. In at least one embodiment, host interface switch 2004 is a PCI express switch device that couples processor 2002 to a PCI express bus over which processor 2002 can communicate with GPGPUs 2006A-D. In at least one embodiment, GPGPUs 2006A-D can interconnect via a set of high-speed point to point GPU to GPU links 2016. In at least one embodiment, GPU to GPU links 2016 connect to each of GPGPUs 2006A-D via a dedicated GPU link. In at least one embodiment, P2P GPU links 2016 enable direct communication between each of GPGPUs 2006A-D without requiring communication over host interface bus 2004 to which processor 2002 is connected. In at least one embodiment, with GPU-to-GPU traffic directed to P2P GPU links 2016, host interface bus 2004 remains available for system memory access or to communicate with other instances of multi-GPU computing system 2000, for example, via one or more network devices. While in at least one embodiment GPGPUs 2006A-D connect to processor 2002 via host interface switch 2004, in at least one embodiment processor 2002 includes direct support for P2P GPU links 2016 and can connect directly to GPGPUs 2006A-D. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, inference and/or training logic 715 may be used in multi-GPU computing system 2000 for inferencing or predicting operations based, at least in part, on weight parameters calculated using neural network training operations, neural network functions and/or architectures, or neural network use cases described herein. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIG.20 to perform CRC generation and/or checking. FIG.21 is a block diagram of a graphics processor 2100, according to at least one embodiment. In at least one embodiment, graphics processor 2100 includes a ring interconnect 2102, a pipeline front-end 2104, a media engine 2137, and graphics cores 2180A-2180N. In at least one embodiment, ring interconnect 2102 couples graphics processor 2100 to other processing units, including other graphics processors or one or more general-purpose processor cores. In at least one embodiment, graphics processor 2100 is one of many processors integrated within a multi-core processing system. In at least one embodiment, graphics processor 2100 receives batches of commands via ring interconnect 2102. In at least one embodiment, incoming commands are interpreted by a command streamer 2103 in pipeline front-end 2104. In at least one embodiment, graphics processor 2100 includes scalable execution logic to perform 3D geometry processing and media processing via graphics core(s) 2180A-2180N. In at least one embodiment, for 3D geometry processing commands, command streamer 2103 supplies commands to geometry pipeline 2136. In at least one embodiment, for at least some media processing commands, command streamer 2103 supplies commands to a video front end 2134, which couples with a media engine 2137. In at least one embodiment, media engine 2137 includes a Video Quality Engine (VQE) 2130 for video and image post-processing and a multi-format encode/decode (MFX) 2133 engine to provide hardware-accelerated media data encode and decode. In at least one embodiment, geometry pipeline 2136 and media engine 2137 each generate execution threads for thread execution resources provided by at least one graphics core 2180A. In at least one embodiment, graphics processor 2100 includes scalable thread execution resources featuring modular cores 2180A-2180N (sometimes referred to as core slices), each having multiple sub-cores 2150A-550N, 2160A-2160N (sometimes referred to as core sub-slices). In at least one embodiment, graphics processor 2100 can have any number of graphics cores 2180A through 2180N. In at least one embodiment, graphics processor 2100 includes a graphics core 2180A having at least a first sub-core 2150A and a second sub-core 2160A. In at least one embodiment, graphics processor 2100 is a low power processor with a single sub-core (e.g., 2150A). In at least one embodiment, graphics processor 2100 includes multiple graphics cores 2180A-2180N, each including a set of first sub-cores 2150A-2150N and a set of second sub-cores 2160A-2160N. In at least one embodiment, each sub-core in first sub-cores 2150A-2150N includes at least a first set of execution units 2152A-2152N and media/texture samplers 2154A-2154N. In at least one embodiment, each sub-core in second sub-cores 2160A-2160N includes at least a second set of execution units 2162A-2162N and samplers 2164A-2164N. In at least one embodiment, each sub-core 2150A-2150N, 2160A-2160N shares a set of shared resources 2170A-2170N. In at least one embodiment, shared resources include shared cache memory and pixel operation logic. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, inference and/or training logic 715 may be used in graphics processor 2100 for inferencing or predicting operations based, at least in part, on weight parameters calculated using neural network training operations, neural network functions and/or architectures, or neural network use cases described herein. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIG.21 to perform CRC generation and/or checking. FIG.22 is a block diagram illustrating micro-architecture for a processor 2200 that may include logic circuits to perform instructions, according to at least one embodiment. In at least one embodiment, a processor 2200 may perform instructions, including x86 instructions, ARM instructions, specialized instructions for application-specific integrated circuits (ASICs), etc. In at least one embodiment, a processor 2210 may include registers to store packed data, such as 64-bit wide MMX TM registers in microprocessors enabled with MMX technology from Intel Corporation of Santa Clara, Calif. In at least one embodiment, MMX registers, available in both integer and floating point forms, may operate with packed data elements that accompany single instruction, multiple data (“SIMD”) and streaming SIMD extensions (“SSE”) instructions. In at least one embodiment, 128-bit wide XMM registers relating to SSE2, SSE3, SSE4, AVX, or beyond (referred to generically as “SSEx”) technology may hold such packed data operands. In at least one embodiment, processors 2210 may perform instructions to accelerate machine learning or deep learning algorithms, training, or inferencing. In at least one embodiment, a processor 2200 includes an in-order front end (“front end”) 2201 to fetch instructions to be executed and prepare instructions to be used later in a processor pipeline. In at least one embodiment, a front end 2201 may include several units. In at least one embodiment, an instruction prefetcher 2226 fetches instructions from memory and feeds instructions to an instruction decoder 2228 which in turn decodes or interprets instructions. For example, in at least one embodiment, an instruction decoder 2228 decodes a received instruction into one or more operations called “micro-instructions” or “micro- operations” (also called “micro ops” or “uops”) that a machine may execute. In at least one embodiment, an instruction decoder 2228 parses instruction into an opcode and corresponding data and control fields that may be used by micro-architecture to perform operations in accordance with at least one embodiment. In at least one embodiment, a trace cache 2230 may assemble decoded uops into program ordered sequences or traces in a uop queue 2234 for execution. In at least one embodiment, when a trace cache 2230 encounters a complex instruction, a microcode ROM 2232 provides uops needed to complete operation. In at least one embodiment, some instructions may be converted into a single micro- op, whereas others need several micro-ops to complete full operation. In at least one embodiment, if more than four micro-ops are needed to complete an instruction, an instruction decoder 2228 may access microcode ROM 2232 to perform an instruction. In at least one embodiment, an instruction may be decoded into a small number of micro-ops for processing an instruction decoder 2228. In at least one embodiment, an instruction may be stored within microcode ROM 2232 should a number of micro-ops be needed to accomplish an operation. In at least one embodiment, a trace cache 2230 refers to an entry point programmable logic array (“PLA”) to determine a correct micro-instruction pointer for reading microcode sequences to complete one or more instructions from microcode ROM 2232 in accordance with at least one embodiment. In at least one embodiment, after a microcode ROM 2232 finishes sequencing micro-ops for an instruction, a front end 2201 of a machine may resume fetching micro-ops from a trace cache 2230. In at least one embodiment, an out-of-order execution engine (“out of order engine”) 2203 may prepare instructions for an execution. In at least one embodiment, an out- of-order execution logic has a number of buffers to smooth out and re-order flow of instructions to optimize performance as they go down pipeline and get scheduled for execution. In at least one embodiment, an out-of-order execution engine 2203 includes, without limitation, an allocator/register renamer 2240, a memory uop queue 2242, an integer/floating point uop queue 2244, a memory scheduler 2246, a fast scheduler 2202, a slow/general floating point scheduler (“slow/general FP scheduler”) 2204, and a simple floating point scheduler (“simple FP scheduler”) 2206. In at least one embodiment, a fast schedule 2202, a slow/general floating point scheduler 2204, and a simple floating point scheduler 2206 are also collectively referred to herein as “uop schedulers 2202, 2204, 2206.” An allocator/register renamer 2240 allocates machine buffers and resources that each uop needs in order to execute. In at least one embodiment, an allocator/register renamer 2240 renames logic registers onto entries in a register file. In at least one embodiment, an allocator/register renamer 2240 also allocates an entry for each uop in one of two uop queues, a memory uop queue 2242 for memory operations and an integer/floating point uop queue 2244 for non-memory operations, in front of a memory scheduler 2246 and uop schedulers 2202, 2204, 2206. In at least one embodiment, uop schedulers 2202, 2204, 2206, determine when a uop is ready to execute based on readiness of their dependent input register operand sources and availability of execution resources uops need to complete their operation. In at least one embodiment, a fast scheduler 2202 of at least one embodiment may schedule on each half of main clock cycle while a slow/general floating point scheduler 2204 and a simple floating point scheduler 2206 may schedule once per main processor clock cycle. In at least one embodiment, uop schedulers 2202, 2204, 2206 arbitrate for dispatch ports to schedule uops for execution. In at least one embodiment, an execution block b11 includes, without limitation, an integer register file/bypass network 2208, a floating point register file/bypass network (“FP register file/bypass network”) 2210, address generation units (“AGUs”) 2212 and 2214, fast Arithmetic Logic Units (ALUs) (“fast ALUs”) 2216 and 2218, a slow Arithmetic Logic Unit (“slow ALU”) 2220, a floating point ALU (“FP”) 2222, and a floating point move unit (“FP move”) 2224. In at least one embodiment, an integer register file/bypass network 2208 and a floating point register file/bypass network 2210 are also referred to herein as “register files 2208, 2210.” In at least one embodiment, AGUSs 2212 and 2214, fast ALUs 2216 and 2218, a slow ALU 2220, a floating point ALU 2222, and a floating point move unit 2224 are also referred to herein as “execution units 2212, 2214, 2216, 2218, 2220, 2222, and 2224.” In at least one embodiment, an execution block b11 may include, without limitation, any number (including zero) and type of register files, bypass networks, address generation units, and execution units, in any combination. In at least one embodiment, register files 2208, 2210 may be arranged between uop schedulers 2202, 2204, 2206, and execution units 2212, 2214, 2216, 2218, 2220, 2222, and 2224. In at least one embodiment, an integer register file/bypass network 2208 performs integer operations. In at least one embodiment, a floating point register file/bypass network 2210 performs floating point operations. In at least one embodiment, each of register files 2208, 2210 may include, without limitation, a bypass network that may bypass or forward just completed results that have not yet been written into register file to new dependent uops. In at least one embodiment, register files 2208, 2210 may communicate data with each other. In at least one embodiment, integer register file/bypass network 2208 may include, without limitation, two separate register files, one register file for low-order thirty-two bits of data and a second register file for high order thirty-two bits of data. In at least one embodiment, a floating point register file/bypass network 2210 may include, without limitation, 128-bit wide entries because floating point instructions typically have operands from 64 to 128 bits in width. In at least one embodiment, execution units 2212, 2214, 2216, 2218, 2220, 2222, 2224 may execute instructions. In at least one embodiment, register files 2208, 2210 store integer and floating point data operand values that micro-instructions need to execute. In at least one embodiment, a processor 2200 may include, without limitation, any number and combination of execution units 2212, 2214, 2216, 2218, 2220, 2222, 2224. In at least one embodiment, a floating point ALU 2222 and a floating point move unit 2224, may execute a floating point, MMX, SIMD, AVX and SSE, or other operations, including specialized machine learning instructions. In at least one embodiment, a floating point ALU 2222 may include, without limitation, a 64-bit by 64-bit floating point divider to execute divide, square root, and remainder micro ops. In at least one embodiment, instructions involving a floating point value may be handled with floating point hardware. In at least one embodiment, ALU operations may be passed to fast ALUs 2216, 2218. In at least one embodiment, fast ALUS 2216, 2218 may execute fast operations with an effective latency of half a clock cycle. In at least one embodiment, most complex integer operations go to a slow ALU 2220 as a slow ALU 2220 may include, without limitation, integer execution hardware for a long-latency type of operations, such as a multiplier, shifts, flag logic, and branch processing. In at least one embodiment, memory load/store operations may be executed by AGUS 2212, 2214. In at least one embodiment, a fast ALU 2216, a fast ALU 2218, and a slow ALU 2220 may perform integer operations on 64-bit data operands. In at least one embodiment, a fast ALU 2216, a fast ALU 2218, and a slow ALU 2220 may be implemented to support a variety of data bit sizes including sixteen, thirty-two, 128, 256, etc. In at least one embodiment, a floating point ALU 2222 and a floating point move unit 2224 may be implemented to support a range of operands having bits of various widths. In at least one embodiment, a floating point ALU 2222 and a floating point move unit 2224 may operate on 128-bit wide packed data operands in conjunction with SIMD and multimedia instructions. In at least one embodiment, uop schedulers 2202, 2204, 2206, dispatch dependent operations before a parent load has finished executing. In at least one embodiment, as uops may be speculatively scheduled and executed in a processor 2200, a processor 2200 may also include logic to handle memory misses. In at least one embodiment, if a data load misses in data cache, there may be dependent operations in flight in pipeline that have left scheduler with temporarily incorrect data. In at least one embodiment, a replay mechanism tracks and re-executes instructions that use incorrect data. In at least one embodiment, dependent operations might need to be replayed and independent ones may be allowed to complete. In at least one embodiment, schedulers and a replay mechanism of at least one embodiment of a processor may also be designed to catch instruction sequences for text string comparison operations. In at least one embodiment, “registers” may refer to on-board processor storage locations that may be used as part of instructions to identify operands. In at least one embodiment, registers may be those that may be usable from outside of a processor (from a programmer's perspective). In at least one embodiment, registers might not be limited to a particular type of circuit. Rather, in at least one embodiment, a register may store data, provide data, and perform functions described herein. In at least one embodiment, registers described herein may be implemented by circuitry within a processor using any number of different techniques, such as dedicated physical registers, dynamically allocated physical registers using register renaming, combinations of dedicated and dynamically allocated physical registers, etc. In at least one embodiment, integer registers store 32-bit integer data. A register file of at least one embodiment also contains eight multimedia SIMD registers for packed data. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, portions or all of inference and/or training logic 715 may be incorporated into an EXE Block 2211 and other memory or registers shown or not shown. For example, in at least one embodiment, training and/or inferencing techniques described herein may use one or more of ALUs illustrated in EXE Block 2211. Moreover, in at least one embodiment, weight parameters may be stored in an on-chip or off-chip memory and/or registers (shown or not shown) that configure ALUs of an EXE Block 2211 to perform one or more machine learning algorithms, neural network architectures, use cases, or training techniques described herein. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIG.22 to perform CRC generation and/or checking. FIG.23 illustrates a deep learning application processor 2300, according to at least one embodiment. In at least one embodiment, a deep learning application processor 2300 uses instructions that, if executed by a deep learning application processor 2300, cause a deep learning application processor 2300 to perform some or all of processes and techniques described throughout this disclosure. In at least one embodiment, a deep learning application processor 2300 is an application-specific integrated circuit (ASIC). In at least one embodiment, an application processor 2300 performs matrix multiply operations either “hard- wired” into hardware as a result of performing one or more instructions or both. In at least one embodiment, a deep learning application processor 2300 includes, without limitation, processing clusters 2310(1)-2310(12), Inter-Chip Links (“ICLs”) 2320(1)-2320(12), Inter- Chip Controllers (“ICCs”) 2330(1)-2330(2), high bandwidth memory second generation (“HBM2”) 2340(1)-2340(4), memory controllers (“Mem Ctrlrs”) 2342(1)-2342(4), a high bandwidth memory physical layer (“HBM PHY”) 2344(1)-2344(4), a management-controller central processing unit (“management-controller CPU”) 2350, a Serial Peripheral Interface, Inter-Integrated Circuit, and General Purpose Input/Output block (“SPI, I2C, GPIO”) 2360, a peripheral component interconnect express controller and direct memory access block (“PCIe Controller and DMA”) 2370, and a sixteen-lane peripheral component interconnect express port (“PCI Express x 16”) 2380. In at least one embodiment, processing clusters 2310 may perform deep learning operations, including inference or prediction operations based on weight parameters calculated based at least in part on one or more training techniques, including those described herein. In at least one embodiment, each processing cluster 2310 may include, without limitation, any number and type of processors. In at least one embodiment, a deep learning application processor 2300 may include any number and type of processing clusters 2300. In at least one embodiment, Inter-Chip Links 2320 are bi-directional. In at least one embodiment, Inter-Chip Links 2320 and Inter-Chip Controllers 2330 enable multiple deep learning application processors 2300 to exchange information, including activation information resulting from performing one or more machine learning algorithms embodied in one or more neural networks. In at least one embodiment, a deep learning application processor 2300 may include any number (including zero) and type of ICLs 2320 and ICCs 2330. In at least one embodiment, HBM2s 2340 provide a total of 32 Gigabytes (GB) of memory. In at least one embodiment, an HBM22340(i) is associated with both a memory controller 2342(i) and an HBM PHY 2344(i). In at least one embodiment, any number of HBM2s 2340 may provide any type and total amount of high bandwidth memory and may be associated with any number (including zero) and type of memory controllers 2342 and HBM PHYs 2344. In at least one embodiment, an SPI, I2C, GPIO 2360, PCIe Controller and DMA 2370, and/or a PCIe 2380 may be replaced with any number and type of blocks that enable any number and type of communication standards in any technically feasible fashion. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, a deep learning application processor is used to train a machine learning model, such as a neural network, to predict or infer information provided to a deep learning application processor 2300. In at least one embodiment, a deep learning application processor 2300 is used to infer or predict information based on a trained machine learning model (e.g., neural network) that has been trained by another processor or system or by a deep learning application processor 2300. In at least one embodiment, a processor 2300 may be used to perform one or more neural network use cases described herein. FIG.24 is a block diagram of a neuromorphic processor 2400, according to at least one embodiment. In at least one embodiment, a neuromorphic processor 2400 may receive one or more inputs from sources external to a neuromorphic processor 2400. In at least one embodiment, these inputs may be transmitted to one or more neurons 2402 within a neuromorphic processor 2400. In at least one embodiment, neurons 2402 and components thereof may be implemented using circuitry or logic, including one or more arithmetic logic units (ALUs). In at least one embodiment, a neuromorphic processor 2400 may include, without limitation, thousands or millions of instances of neurons 2402, but any suitable number of neurons 2402 may be used. In at least one embodiment, each instance of a neuron 2402 may include a neuron input 2404 and a neuron output 2406. In at least one embodiment, neurons 2402 may generate outputs that may be transmitted to inputs of other instances of neurons 2402. For example, in at least one embodiment, neuron inputs 2404 and neuron outputs 2406 may be interconnected via synapses 2408. In at least one embodiment, neurons 2402 and synapses 2408 may be interconnected such that a neuromorphic processor 2400 operates to process or analyze information received by a neuromorphic processor 2400. In at least one embodiment, neurons 2402 may transmit an output pulse (or “fire” or “spike”) when inputs received through a neuron input 2404 exceed a threshold. In at least one embodiment, neurons 2402 may sum or integrate signals received at neuron inputs 2404. For example, in at least one embodiment, neurons 2402 may be implemented as leaky integrate-and-fire neurons, wherein if a sum (referred to as a “membrane potential”) exceeds a threshold value, a neuron 2402 may generate an output (or “fire”) using a transfer function such as a sigmoid or threshold function. In at least one embodiment, a leaky integrate-and-fire neuron may sum signals received at neuron inputs 2404 into a membrane potential and may also apply a decay factor (or leak) to reduce a membrane potential. In at least one embodiment, a leaky integrate-and-fire neuron may fire if multiple input signals are received at neuron inputs 2404 rapidly enough to exceed a threshold value (e.g., before a membrane potential decays too low to fire). In at least one embodiment, neurons 2402 may be implemented using circuits or logic that receive inputs, integrate inputs into a membrane potential, and decay a membrane potential. In at least one embodiment, inputs may be averaged, or any other suitable transfer function may be used. Furthermore, in at least one embodiment, neurons 2402 may include, without limitation, comparator circuits or logic that generate an output spike at neuron output 2406 when result of applying a transfer function to neuron input 2404 exceeds a threshold. In at least one embodiment, once a neuron 2402 fires, it may disregard previously received input information by, for example, resetting a membrane potential to 0 or another suitable default value. In at least one embodiment, once a membrane potential is reset to 0, a neuron 2402 may resume normal operation after a suitable period of time (or a refractory period). In at least one embodiment, neurons 2402 may be interconnected through synapses 2408. In at least one embodiment, synapses 2408 may operate to transmit signals from an output of a first neuron 2402 to an input of a second neuron 2402. In at least one embodiment, neurons 2402 may transmit information over more than one instance of a synapse 2408. In at least one embodiment, one or more instances of neuron output 2406 may be connected, via an instance of a synapse 2408, to an instance of neuron input 2404 in same neuron 2402. In at least one embodiment, an instance of neuron 2402 generating an output to be transmitted over an instance of a synapse 2408 may be referred to as a “pre-synaptic neuron” with respect to that instance of a synapse 2408. In at least one embodiment, an instance of a neuron 2402 receiving an input transmitted over an instance of a synapse 2408 may be referred to as a “post-synaptic neuron” with respect to that instance of a synapse 2408. Because an instance of a neuron 2402 may receive inputs from one or more instances of a synapse 2408, and may also transmit outputs over one or more instances of a synapse 2408, a single instance of a neuron 2402 may therefore be both a “pre-synaptic neuron” and “post-synaptic neuron,” with respect to various instances of synapses 2408, in at least one embodiment. In at least one embodiment, neurons 2402 may be organized into one or more layers. In at least one embodiment, each instance of a neuron 2402 may have one neuron output 2406 that may fan out through one or more synapses 2408 to one or more neuron inputs 2404. In at least one embodiment, neuron outputs 2406 of neurons 2402 in a first layer 2410 may be connected to neuron inputs 2404 of neurons 2402 in a second layer 2412. In at least one embodiment, a layer 2410 may be referred to as a “feed-forward layer.” In at least one embodiment, each instance of a neuron 2402 in an instance of a first layer 2410 may fan out to each instance of a neuron 2402 in a second layer 2412. In at least one embodiment, a first layer 2410 may be referred to as a “fully connected feed-forward layer.” In at least one embodiment, each instance of a neuron 2402 in an instance of a second layer 2412 may fan out to fewer than all instances of neuron 2402 in a third layer 2414. In at least one embodiment, a second layer 2412 may be referred to as a “sparsely connected feed-forward layer.” In at least one embodiment, neurons 2402 in a second layer 2412 may fan out to neurons 2402 in multiple other layers, including to neurons 2402 in (same) second layer 2412. In at least one embodiment, a second layer 2412 may be referred to as a “recurrent layer.” A neuromorphic processor 2400 may include, without limitation, any suitable combination of recurrent layers and feed-forward layers, including, without limitation, both sparsely connected feed-forward layers and fully connected feed-forward layers. In at least one embodiment, a neuromorphic processor 2400 may include, without limitation, a reconfigurable interconnect architecture or dedicated hard wired interconnects to connect synapse 2408 to neurons 2402. In at least one embodiment, a neuromorphic processor 2400 may include, without limitation, circuitry or logic that allows synapses to be allocated to different neurons 2402 as needed based on neural network topology and neuron fan-in/out. For example, in at least one embodiment, synapses 2408 may be connected to neurons 2402 using an interconnect fabric, such as network-on-chip, or with dedicated connections. In at least one embodiment, synapse interconnections and components thereof may be implemented using circuitry or logic. FIG.25 is a block diagram of a graphics processor 2500, which may be a discrete graphics processing unit, or may be a graphics processor integrated with a plurality of processing cores. In at least one embodiment, a graphics processor 2500 communicates via a memory mapped I/O interface to registers on a graphics processor 2500 and with commands placed into memory. In at least one embodiment, a graphics processor 2500 includes a memory interface 2514 to access memory. In at least one embodiment, a memory interface 2514 is an interface to local memory, one or more internal caches, one or more shared external caches, and/or to system memory. In at least one embodiment, a graphics processor 2500 also includes a display controller 2502 to drive display output data to a display device 2520. In at least one embodiment, a display controller 2502 includes hardware for one or more overlay planes for a display device 2520 and a composition of multiple layers of video or user interface elements. In at least one embodiment, a display device 2520 can be an internal or external display device. In at least one embodiment, a display device 2520 is a head mounted display device, such as a virtual reality (VR) display device or an augmented reality (AR) display device. In at least one embodiment, a graphics processor 2500 includes a video codec engine 2506 to encode, decode, or transcode media to, from, or between one or more media encoding formats, including, but not limited to Moving Picture Experts Group (MPEG) formats such as MPEG-2, Advanced Video Coding (AVC) formats such as H.264/MPEG-4 AVC, as well as the Society of Motion Picture & Television Engineers (SMPTE) 421M/VC- 1, and Joint Photographic Experts Group (JPEG) formats such as JPEG, and Motion JPEG (MJPEG) formats. In at least one embodiment, a graphics processor 2500 includes a block image transfer (BLIT) engine 2504 to perform two-dimensional (2D) rasterizer operations including, for example, bit-boundary block transfers. However, in at least one embodiment, 2D graphics operations are performed using one or more components of a graphics processing engine (GPE) 2510. In at least one embodiment, GPE 2510 is a compute engine for performing graphics operations, including three-dimensional (3D) graphics operations and media operations. In at least one embodiment, a GPE 2510 includes a 3D pipeline 2512 for performing 3D operations, such as rendering three-dimensional images and scenes using processing functions that act upon 3D primitive shapes (e.g., rectangle, triangle, etc.). In at least one embodiment, a 3D pipeline 2512 includes programmable and fixed function elements that perform various tasks and/or spawn execution threads to a 3D/Media sub-system 2515. While a 3D pipeline 2512 can be used to perform media operations, in at least one embodiment, a GPE 2510 also includes a media pipeline 2516 that is used to perform media operations, such as video post-processing and image enhancement. In at least one embodiment, a media pipeline 2516 includes fixed function or programmable logic units to perform one or more specialized media operations, such as video decode acceleration, video de-interlacing, and video encode acceleration in place of, or on behalf of a video codec engine 2506. In at least one embodiment, a media pipeline 2516 additionally includes a thread spawning unit to spawn threads for execution on 3D/Media sub-system 2515. In at least one embodiment, spawned threads perform computations for media operations on one or more graphics execution units included in 3D/Media sub-system 2515. In at least one embodiment, a 3D/Media subsystem 2515 includes logic for executing threads spawned by a 3D pipeline 2512 and a media pipeline 2516. In at least one embodiment, a 3D pipeline 2512 and a media pipeline 2516 send thread execution requests to a 3D/Media subsystem 2515, which includes thread dispatch logic for arbitrating and dispatching various requests to available thread execution resources. In at least one embodiment, execution resources include an array of graphics execution units to process 3D and media threads. In at least one embodiment, a 3D/Media subsystem 2515 includes one or more internal caches for thread instructions and data. In at least one embodiment, a subsystem 2515 also includes a shared memory, including registers and addressable memory, to share data between threads and to store output data. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, portions or all of inference and/or training logic 715 may be incorporated into graphics processor 2500. For example, in at least one embodiment, training and/or inferencing techniques described herein may use one or more of ALUs embodied in 3D pipeline 2512. Moreover, in at least one embodiment, inferencing and/or training operations described herein may be done using logic other than logic illustrated in FIGS.7A or 7B. In at least one embodiment, weight parameters may be stored in on-chip or off-chip memory and/or registers (shown or not shown) that configure ALUs of a graphics processor 2500 to perform one or more machine learning algorithms, neural network architectures, use cases, or training techniques described herein. FIG.26 is a block diagram of a graphics processing engine 2610 of a graphics processor in accordance with at least one embodiment. In at least one embodiment, a graphics processing engine (GPE) 2610 is a version of GPE 2510 shown in FIG.25. In at least one embodiment, a media pipeline 2516 is not required and might not be explicitly included within GPE 2610. In at least one embodiment, a separate media and/or image processor is coupled to a GPE 2610. In at least one embodiment, a GPE 2610 is coupled to or includes a command streamer 2603, which provides a command stream to a 3D pipeline 2512 and/or media pipelines 2516. In at least one embodiment, a command streamer 2603 is coupled to memory, which can be system memory, or one or more of internal cache memory and shared cache memory. In at least one embodiment, a command streamer 2603 receives commands from memory and sends commands to a 3D pipeline 2512 and/or media pipeline 2516. In at least one embodiment, commands are instructions, primitives, or micro-operations fetched from a ring buffer, which stores commands for a 3D pipeline 2512 and media pipeline 2516. In at least one embodiment, a ring buffer can additionally include batch command buffers storing batches of multiple commands. In at least one embodiment, commands for a 3D pipeline 2512 can also include references to data stored in memory, such as but not limited to vertex and geometry data for 3D pipeline 2512 and/or image data and memory objects for media pipeline 2516. In at least one embodiment, a 3D pipeline 2512 and media pipeline 2516 process commands and data by performing operations or by dispatching one or more execution threads to a graphics core array 2614. In at least one embodiment, a graphics core array 2614 includes one or more blocks of graphics cores (e.g., graphics core(s) 2615A, graphics core(s) 2615B), each block including one or more graphics cores. In at least one embodiment, each graphics core includes a set of graphics execution resources that includes general-purpose and graphics specific execution logic to perform graphics and compute operations, as well as fixed function texture processing and/or machine learning and artificial intelligence acceleration logic, including inference and/or training logic 715 in FIG.7A and FIG.7B. In at least one embodiment, a 3D pipeline 2512 includes fixed function and programmable logic to process one or more shader programs, such as vertex shaders, geometry shaders, pixel shaders, fragment shaders, compute shaders, or other shader programs, by processing instructions and dispatching execution threads to a graphics core array 2614. In at least one embodiment, a graphics core array 2614 provides a unified block of execution resources for use in processing shader programs. In at least one embodiment, multi-purpose execution logic (e.g., execution units) within graphics core(s) 2615A-2615B of a graphic core array 2614 includes support for various 3D API shader languages and can execute multiple simultaneous execution threads associated with multiple shaders. In at least one embodiment, a graphics core array 2614 also includes execution logic to perform media functions, such as video and/or image processing. In at least one embodiment, execution units additionally include general-purpose logic that is programmable to perform parallel general-purpose computational operations, in addition to graphics processing operations. In at least one embodiment, output data generated by threads executing on a graphics core array 2614 can output data to a memory in a unified return buffer (URB) 2618. In at least one embodiment, a URB 2618 can store data for multiple threads. In at least one embodiment, a URB 2618 may be used to send data between different threads executing on a graphics core array 2614. In at least one embodiment, a URB 2618 may additionally be used for synchronization between threads on graphics core array 2614 and fixed function logic within shared function logic 2620. In at least one embodiment, a graphics core array 2614 is scalable, such that a graphics core array 2614 includes a variable number of graphics cores, each having a variable number of execution units based on a target power and performance level of a GPE 2610. In at least one embodiment, execution resources are dynamically scalable, such that execution resources may be enabled or disabled as needed. In at least one embodiment, a graphics core array 2614 is coupled to shared function logic 2620 that includes multiple resources that are shared between graphics cores in a graphics core array 2614. In at least one embodiment, shared functions performed by shared function logic 2620 are embodied in hardware logic units that provide specialized supplemental functionality to a graphics core array 2614. In at least one embodiment, shared function logic 2620 includes but is not limited to sampler 2621, math 2622, and inter-thread communication (ITC) 2623 logic. In at least one embodiment, one or more cache(s) 2625 are in included in, or couple to, shared function logic 2620. In at least one embodiment, a shared function is used if demand for a specialized function is insufficient for inclusion within a graphics core array 2614. In at least one embodiment, a single instantiation of a specialized function is used in shared function logic 2620 and shared among other execution resources within graphics core array 2614. In at least one embodiment, specific shared functions within shared function logic 2620 that are used extensively by a graphics core array 2614 may be included within shared function logic 2616 within a graphics core array 2614. In at least one embodiment, shared function logic 2616 within a graphics core array 2614 can include some or all logic within shared function logic 2620. In at least one embodiment, all logic elements within shared function logic 2620 may be duplicated within shared function logic 2616 of a graphics core array 2614. In at least one embodiment, shared function logic 2620 is excluded in favor of shared function logic 2616 within a graphics core array 2614. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, portions or all of inference and/or training logic 715 may be incorporated into graphics processor 2610. For example, in at least one embodiment, training and/or inferencing techniques described herein may use one or more of ALUs embodied in a 3D pipeline 2512, graphics core(s) 2615A, shared function logic 2616, graphics core(s) 2615B, shared function logic 2620, or other logic in FIG.26. Moreover, in at least one embodiment, inferencing and/or training operations described herein may be done using logic other than logic illustrated in FIGS.7A or 7B. In at least one embodiment, weight parameters may be stored in on-chip or off-chip memory and/or registers (shown or not shown) that configure ALUs of a graphics processor 2610 to perform one or more machine learning algorithms, neural network architectures, use cases, or training techniques described herein. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIG.26 to perform CRC generation and/or checking. FIG.27 is a block diagram of hardware logic of a graphics processor core 2700, according to at least one embodiment described herein. In at least one embodiment, a graphics processor core 2700 is included within a graphics core array. In at least one embodiment, a graphics processor core 2700, sometimes referred to as a core slice, can be one or multiple graphics cores within a modular graphics processor. In at least one embodiment, a graphics processor core 2700 is exemplary of one graphics core slice, and a graphics processor as described herein may include multiple graphics core slices based on target power and performance envelopes. In at least one embodiment, each graphics core 2700 can include a fixed function block 2730 coupled with multiple sub-cores 2701A-2701F, also referred to as sub-slices, that include modular blocks of general-purpose and fixed function logic. In at least one embodiment, a fixed function block 2730 includes a geometry/fixed function pipeline 2736 that can be shared by all sub-cores in a graphics processor 2700, for example, in lower performance and/or lower power graphics processor implementations. In at least one embodiment, geometry/fixed function pipeline 2736 includes a 3D fixed function pipeline, a video front-end unit, a thread spawner and thread dispatcher, and a unified return buffer manager, which manages unified return buffers. In at least one embodiment a fixed function block 2730 also includes a graphics SoC interface 2737, a graphics microcontroller 2738, and a media pipeline 2739. In at least one embodiment, a graphics SoC interface 2737 provides an interface between a graphics core 2700 and other processor cores within a system on a chip integrated circuit. In at least one embodiment, a graphics microcontroller 2738 is a programmable sub-processor that is configurable to manage various functions of graphics processor 2700, including thread dispatch, scheduling, and pre-emption. In at least one embodiment, media pipeline 2739 includes logic to facilitate decoding, encoding, pre-processing, and/or post-processing of multimedia data, including image and video data. In at least one embodiment, a media pipeline 2739 implements media operations via requests to compute or sampling logic within sub-cores 2701-2701F. In at least one embodiment, SoC interface 2737 enables a graphics core 2700 to communicate with general-purpose application processor cores (e.g., CPUs) and/or other components within a SoC, including memory hierarchy elements such as a shared last level cache memory, a system RAM, and/or an embedded on-chip or on-package DRAM. In at least one embodiment, a SoC interface 2737 can also enable communication with fixed function devices within a SoC, such as camera imaging pipelines, and enables use of and/or implements global memory atomics that may be shared between a graphics core 2700 and CPUs within a SoC. In at least one embodiment, a SoC interface 2737 can also implement power management controls for a graphics core 2700 and enable an interface between a clock domain of a graphic core 2700 and other clock domains within a SoC. In at least one embodiment, SoC interface 2737 enables receipt of command buffers from a command streamer and global thread dispatcher that are configured to provide commands and instructions to each of one or more graphics cores within a graphics processor. In at least one embodiment, commands and instructions can be dispatched to a media pipeline 2739, when media operations are to be performed, or a geometry and fixed function pipeline (e.g., geometry and fixed function pipeline 2736, a geometry and fixed function pipeline 2714) when graphics processing operations are to be performed. In at least one embodiment, a graphics microcontroller 2738 can be configured to perform various scheduling and management tasks for a graphics core 2700. In at least one embodiment, a graphics microcontroller 2738 can perform graphics and/or compute workload scheduling on various graphics parallel engines within execution unit (EU) arrays 2702A- 2702F, 2704A-2704F within sub-cores 2701A-2701F. In at least one embodiment, host software executing on a CPU core of a SoC including a graphics core 2700 can submit workloads one of multiple graphics processor doorbells, which invokes a scheduling operation on an appropriate graphics engine. In at least one embodiment, scheduling operations include determining which workload to run next, submitting a workload to a command streamer, pre-empting existing workloads running on an engine, monitoring progress of a workload, and notifying host software when a workload is complete. In at least one embodiment, a graphics microcontroller 2738 can also facilitate low-power or idle states for a graphics core 2700, providing a graphics core 2700 with an ability to save and restore registers within a graphics core 2700 across low-power state transitions independently from an operating system and/or graphics driver software on a system. In at least one embodiment, a graphics core 2700 may have greater than or fewer than illustrated sub-cores 2701A-2701F, up to N modular sub-cores. For each set of N sub- cores, in at least one embodiment, a graphics core 2700 can also include shared function logic 2710, a shared and/or cache memory 2712, a geometry/fixed function pipeline 2714, as well as additional fixed function logic 2716 to accelerate various graphics and compute processing operations. In at least one embodiment, shared function logic 2710 can include logic units (e.g., sampler, math, and/or inter-thread communication logic) that can be shared by each N sub-cores within a graphics core 2700. In at least one embodiment, shared and/or cache memory 2712 can be a last-level cache for N sub-cores 2701A-2701F within a graphics core 2700 and can also serve as a shared memory that is accessible by multiple sub-cores. In at least one embodiment, a geometry/fixed function pipeline 2714 can be included instead of a geometry/fixed function pipeline 2736 within a fixed function block 2730 and can include same or similar logic units. In at least one embodiment, a graphics core 2700 includes additional fixed function logic 2716 that can include various fixed function acceleration logic for use by a graphics core 2700. In at least one embodiment, additional fixed function logic 2716 includes an additional geometry pipeline for use in position only shading. In position-only shading, at least two geometry pipelines exist, whereas in a full geometry pipeline within a geometry/fixed function pipeline 2716, 2736, and a cull pipeline, which is an additional geometry pipeline which may be included within additional fixed function logic 2716. In at least one embodiment, a cull pipeline is a trimmed down version of a full geometry pipeline. In at least one embodiment, a full pipeline and a cull pipeline can execute different instances of an application, each instance having a separate context. In at least one embodiment, position only shading can hide long cull runs of discarded triangles, enabling shading to be completed earlier in some instances. For example, in at least one embodiment, cull pipeline logic within additional fixed function logic 2716 can execute position shaders in parallel with a main application and generally generates critical results faster than a full pipeline, as a cull pipeline fetches and shades a position attribute of vertices, without performing rasterization and rendering of pixels to a frame buffer. In at least one embodiment, a cull pipeline can use generated critical results to compute visibility information for all triangles without regard to whether those triangles are culled. In at least one embodiment, a full pipeline (which in this instance may be referred to as a replay pipeline) can consume visibility information to skip culled triangles to shade only visible triangles that are finally passed to a rasterization phase. In at least one embodiment, additional fixed function logic 2716 can also include machine-learning acceleration logic, such as fixed function matrix multiplication logic, for implementations including optimizations for machine learning training or inferencing. In at least one embodiment, each graphics sub-core 2701A-2701F includes a set of execution resources that may be used to perform graphics, media, and compute operations in response to requests by graphics pipeline, media pipeline, or shader programs. In at least one embodiment, graphics sub-cores 2701A-2701F include multiple EU arrays 2702A-2702F, 2704A-2704F, thread dispatch and inter-thread communication (TD/IC) logic 2703A-2703F, a 3D (e.g., texture) sampler 2705A-2705F, a media sampler 2706A-2706F, a shader processor 2707A-2707F, and shared local memory (SLM) 2708A-2708F. In at least one embodiment, EU arrays 2702A-2702F, 2704A-2704F each include multiple execution units, which are general-purpose graphics processing units capable of performing floating-point and integer/fixed-point logic operations in service of a graphics, media, or compute operation, including graphics, media, or compute shader programs. In at least one embodiment, TD/IC logic 2703A-2703F performs local thread dispatch and thread control operations for execution units within a sub-core and facilitate communication between threads executing on execution units of a sub-core. In at least one embodiment, 3D sampler 2705A-2705F can read texture or other 3D graphics related data into memory. In at least one embodiment, a 3D sampler can read texture data differently based on a configured sample state and texture format associated with a given texture. In at least one embodiment, a media sampler 2706A- 2706F can perform similar read operations based on a type and format associated with media data. In at least one embodiment, each graphics sub-core 2701A-2701F can alternately include a unified 3D and media sampler. In at least one embodiment, threads executing on execution units within each of sub-cores 2701A-2701F can make use of shared local memory 2708A-2708F within each sub-core, to enable threads executing within a thread group to execute using a common pool of on-chip memory. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, portions or all of inference and/or training logic 715 may be incorporated into graphics processor 2710. For example, in at least one embodiment, training and/or inferencing techniques described herein may use one or more of ALUs embodied in a 3D pipeline 2710, a graphics microcontroller 2738, a geometry & fixed function pipeline 2714 and 2736, or other logic in FIG.26. Moreover, in at least one embodiment, inferencing and/or training operations described herein may be done using logic other than logic illustrated in FIGS.7A or 7B. In at least one embodiment, weight parameters may be stored in on-chip or off-chip memory and/or registers (shown or not shown) that configure ALUs of a graphics processor 2700 to perform one or more machine learning algorithms, neural network architectures, use cases, or training techniques described herein. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIG.27 to perform CRC generation and/or checking. FIGS.28A and 28B illustrate thread execution logic 2800 including an array of processing elements of a graphics processor core according to at least one embodiment. FIG. 28A illustrates at least one embodiment, in which thread execution logic 2800 is used. FIG. 28B illustrates exemplary internal details of an execution unit, according to at least one embodiment. As illustrated in FIG.28A, in at least one embodiment, thread execution logic 2800 includes a shader processor 2802, a thread dispatcher 2804, instruction cache 2806, a scalable execution unit array including a plurality of execution units 2808A-2808N, a sampler 2810, a data cache 2812, and a data port 2814. In at least one embodiment, a scalable execution unit array can dynamically scale by enabling or disabling one or more execution units (e.g., any of execution unit 2808A, 2808B, 2808C, 2808D, through 2808N-1 and 2808N) based on computational requirements of a workload, for example. In at least one embodiment, scalable execution units are interconnected via an interconnect fabric that links to each of said execution units. In at least one embodiment, thread execution logic 2800 includes one or more connections to memory, such as system memory or cache memory, through one or more of instruction a cache 2806, a data port 2814, a sampler 2810, and execution units 2808A- 2808N. In at least one embodiment, each execution unit (e.g., 2808A) is a stand-alone programmable general-purpose computational unit that is capable of executing multiple simultaneous hardware threads while processing multiple data elements in parallel for each thread. In at least one embodiment, an array of execution units 2808A-2808N is scalable to include any number individual execution units. In at least one embodiment, execution units 2808A-2808N are primarily used to execute shader programs. In at least one embodiment, a shader processor 2802 can process various shader programs and dispatch execution threads associated with shader programs via a thread dispatcher 2804. In at least one embodiment, a thread dispatcher 2804 includes logic to arbitrate thread initiation requests from graphics and media pipelines and instantiate requested threads on one or more execution units in execution units 2808A-2808N. For example, in at least one embodiment, a geometry pipeline can dispatch vertex, tessellation, or geometry shaders to thread execution logic for processing. In at least one embodiment, a thread dispatcher 2804 can also process runtime thread spawning requests from executing shader programs. In at least one embodiment, execution units 2808A-2808N support an instruction set that includes native support for many standard 3D graphics shader instructions, such that shader programs from graphics libraries (e.g., Direct 3D and OpenGL) are executed with a minimal translation. In at least one embodiment, execution units support vertex and geometry processing (e.g., vertex programs, geometry programs, vertex shaders), pixel processing (e.g., pixel shaders, fragment shaders) and general-purpose processing (e.g., compute and media shaders). In at least one embodiment, each of execution units 2808A- 2808N, which include one or more arithmetic logic units (ALUs), is capable of multi-issue single instruction multiple data (SIMD) execution and multi-threaded operation enables an efficient execution environment despite higher latency memory accesses. In at least one embodiment, each hardware thread within each execution unit has a dedicated high- bandwidth register file and associated independent thread-state. In at least one embodiment, execution is multi-issue per clock to pipelines capable of integer, single and double precision floating point operations, SIMD branch capability, logical operations, transcendental operations, and other miscellaneous operations. In at least one embodiment, while waiting for data from memory or one of shared functions, dependency logic within execution units 2808A-2808N causes a waiting thread to sleep until requested data has been returned. In at least one embodiment, while awaiting thread is sleeping, hardware resources may be devoted to processing other threads. For example, in at least one embodiment, during a delay associated with a vertex shader operation, an execution unit can perform operations for a pixel shader, fragment shader, or another type of shader program, including a different vertex shader. In at least one embodiment, each execution unit in execution units 2808A-2808N operates on arrays of data elements. In at least one embodiment, number of data elements refers to “execution size,” or number of channels for an instruction. In at least one embodiment, an execution channel is a logical unit of execution for data element access, masking, and flow control within instructions. In at least one embodiment, a number of channels may be independent of a number of physical Arithmetic Logic Units (ALUs) or Floating Point Units (FPUs) for a particular graphics processor. In at least one embodiment, execution units 2808A-2808N support integer and floating-point data types. In at least one embodiment, an execution unit instruction set includes SIMD instructions. In at least one embodiment, various data elements can be stored as a packed data type in a register and an execution unit will process various elements based on data size of elements. For example, in at least one embodiment, when operating on a 256-bit wide vector, 256 bits of a vector are stored in a register, and an execution unit operates on vector as four separate 64-bit packed data elements (Quad-Word (QW) size data elements), eight separate 32-bit packed data elements (Double Word (DW) size data elements), sixteen separate 16-bit packed data elements (Word (W) size data elements), or thirty-two separate 8- bit data elements (byte (B) size data elements). However, in at least one embodiment, different vector widths and register sizes are possible. In at least one embodiment, one or more execution units can be combined into a fused execution unit 2809A-2809N having thread control logic (2807A-2807N) that is common to fused EUs. In at least one embodiment, multiple EUs can be fused into an EU group. In at least one embodiment, each EU in fused EU group can be configured to execute a separate SIMD hardware thread. Number of EUs in a fused EU group can vary according to various embodiments. In at least one embodiment, various SIMD widths can be performed per-EU, including but not limited to SIMD8, SIMD16, and SIMD32. In at least one embodiment, each fused graphics execution unit 2809A-2809N includes at least two execution units. For example, in at least one embodiment, a fused execution unit 2809A includes a first EU 2808A, a second EU 2808B, and thread control logic 2807A that is common to first EU 2808A and second EU 2808B. In at least one embodiment, thread control logic 2807A controls threads executed on a fused graphics execution unit 2809A, allowing each EU within fused execution units 2809A-2809N to execute using a common instruction pointer register. In at least one embodiment, one or more internal instruction caches (e.g., 2806) are included in thread execution logic 2800 to cache thread instructions for execution units. In at least one embodiment, one or more data caches (e.g., 2812) are included to cache thread data during thread execution. In at least one embodiment, a sampler 2810 is included to provide texture sampling for 3D operations and media sampling for media operations. In at least one embodiment, sampler 2810 includes specialized texture or media sampling functionality to process texture or media data during sampling process before providing sampled data to an execution unit. During execution, in at least one embodiment, graphics and media pipelines send thread initiation requests to thread execution logic 2800 via thread spawning and dispatch logic. In at least one embodiment, once a group of geometric objects has been processed and rasterized into pixel data, pixel processor logic (e.g., pixel shader logic, fragment shader logic, etc.) within shader processor 2802 is invoked to further compute output information and cause results to be written to output surfaces (e.g., color buffers, depth buffers, stencil buffers, etc.). In at least one embodiment, a pixel shader or fragment shader calculates values of various vertex attributes that are to be interpolated across a rasterized object. In at least one embodiment, pixel processor logic within a shader processor 2802 then executes an application programming interface (API)-supplied pixel or fragment shader program. In at least one embodiment, to execute a shader program, a shader processor 2802 dispatches threads to an execution unit (e.g., 2808A) via a thread dispatcher 2804. In at least one embodiment, a shader processor 2802 uses texture sampling logic in a sampler 2810 to access texture data in texture maps stored in memory. In at least one embodiment, arithmetic operations on texture data and input geometry data compute pixel color data for each geometric fragment, or discards one or more pixels from further processing. In at least one embodiment, a data port 2814 provides a memory access mechanism for thread execution logic 2800 to output processed data to memory for further processing on a graphics processor output pipeline. In at least one embodiment, a data port 2814 includes or couples to one or more cache memories (e.g., data cache 2812) to cache data for memory access via a data port. As illustrated in FIG.28B, in at least one embodiment, a graphics execution unit 2808 can include an instruction fetch unit 2837, a general register file array (GRF) 2824, an architectural register file array (ARF) 2826, a thread arbiter 2822, a send unit 2830, a branch unit 2832, a set of SIMD floating point units (FPUs) 2834, and in at least one embodiment a set of dedicated integer SIMD ALUs 2835. In at least one embodiment, GRF 2824 and ARF 2826 includes a set of general register files and architecture register files associated with each simultaneous hardware thread that may be active in a graphics execution unit 2808. In at least one embodiment, a per thread architectural state is maintained in ARF 2826, while data used during a thread execution is stored in GRF 2824. In at least one embodiment, an execution state of each thread, including instruction pointers for each thread, can be held in thread-specific registers in ARF 2826. In at least one embodiment, a graphics execution unit 2808 has an architecture that is a combination of Simultaneous Multi-Threading (SMT) and fine-grained Interleaved Multi-Threading (IMT). In at least one embodiment, architecture has a modular configuration that can be fine-tuned at design time based on a target number of simultaneous threads and number of registers per execution unit, where execution unit resources are divided across logic used to execute multiple simultaneous threads. In at least one embodiment, a graphics execution unit 2808 can co-issue multiple instructions, which may each be different instructions. In at least one embodiment, a thread arbiter 2822 of a graphics execution unit thread 2808 can dispatch instructions to one of send unit 2830, branch unit 2842, or SIMD FPU(s) 2834 for execution. In at least one embodiment, each execution thread can access 128 general-purpose registers within GRF 2824, where each register can store 32 bytes, accessible as a SIMD 8-element vector of 32-bit data elements. In at least one embodiment, each execution unit thread has access to 4 Kbytes within a GRF 2824, although embodiments are not so limited, and greater or fewer register resources may be provided in other embodiments. In at least one embodiment, up to seven threads can execute simultaneously, although number of threads per execution unit can also vary according to embodiments. In at least one embodiment, in which seven threads may access 4 Kbytes, a GRF 2824 can store a total of 28 Kbytes. In at least one embodiment, flexible addressing modes can permit registers to be addressed together to build effectively wider registers or to represent strided rectangular block data structures. In at least one embodiment, memory operations, sampler operations, and other longer-latency system communications are dispatched via “send” instructions that are executed by a message passing send unit 2830. In at least one embodiment, branch instructions are dispatched to a dedicated branch unit 2832 to facilitate SIMD divergence and eventual convergence. In at least one embodiment a graphics execution unit 2808 includes one or more SIMD floating point units (FPU(s)) 2834 to perform floating-point operations. In at least one embodiment, FPU(s) 2834 also support integer computation. In at least one embodiment, FPU(s) 2834 can SIMD execute up to M number of 32-bit floating-point (or integer) operations, or SIMD execute up to 2M 16-bit integer or 16-bit floating-point operations. In at least one embodiment, at least one of FPU(s) provides extended math capability to support high-throughput transcendental math functions and a double precision 64-bit floating-point. In at least one embodiment, a set of 8-bit integer SIMD ALUs 2835 is also present, and may be specifically optimized to perform operations associated with machine learning computations. In at least one embodiment, arrays of multiple instances of a graphics execution unit 2808 can be instantiated in a graphics sub-core grouping (e.g., a sub-slice). In at least one embodiment, an execution unit 2808 can execute instructions across a plurality of execution channels. In at least one embodiment, each thread executed on a graphics execution unit 2808 is executed on a different channel. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, portions or all of inference and/or training logic 715 may be incorporated into execution logic 2800. Moreover, in at least one embodiment, inferencing and/or training operations described herein may be done using logic other than logic illustrated in FIGS.7A or 7B. In at least one embodiment, weight parameters may be stored in on-chip or off-chip memory and/or registers (shown or not shown) that configure ALUs of execution logic 2800 to perform one or more machine learning algorithms, neural network architectures, use cases, or training techniques described herein. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIGS.28A or 28B to perform CRC generation and/or checking. FIG.29 illustrates a parallel processing unit (“PPU”) 2900, according to at least one embodiment. In at least one embodiment, PPU 2900 is configured with machine-readable code that, if executed by PPU 2900, causes PPU 2900 to perform some or all of processes and techniques described throughout this disclosure. In at least one embodiment, PPU 2900 is a multi-threaded processor that is implemented on one or more integrated circuit devices and that utilizes multithreading as a latency-hiding technique designed to process computer- readable instructions (also referred to as machine-readable instructions or simply instructions) on multiple threads in a parallel manner. In at least one embodiment, a thread refers to a thread of execution and is an instantiation of a set of instructions configured to be executed by PPU 2900. In at least one embodiment, PPU 2900 is a graphics processing unit (“GPU”) configured to implement a graphics rendering pipeline for processing three-dimensional (“3D”) graphics data in order to generate two-dimensional (“2D”) image data for display on a display device such as a liquid crystal display (“LCD”) device. In at least one embodiment, PPU 2900 is utilized to perform computations such as linear algebra operations and machine- learning operations. FIG.29 illustrates an example of a parallel processor for illustrative purposes only and should be construed as a non-limiting example of processor architectures contemplated within scope of this disclosure and that any suitable processor may be employed to supplement and/or substitute for same. In at least one embodiment, one or more PPUs 2900 are configured to accelerate any High Performance Computing (“HPC”), data center, and machine learning applications. In at least one embodiment, PPU 2900 is configured to accelerate all deep learning systems and applications including following non-limiting examples: autonomous vehicle platforms, deep learning, high-accuracy speech, image, text recognition systems, intelligent video analytics, molecular simulations, drug discovery, disease diagnosis, weather forecasting, big data analytics, astronomy, molecular dynamics simulation, financial modeling, robotics, factory automation, real-time language translation, online search optimizations, personalized user recommendations and more. In at least one embodiment, PPU 2900 includes, without limitation, an Input/Output (“I/O”) unit 2906, a front-end unit 2910, a scheduler unit 2912, a work distribution unit 2914, a hub 2916, a crossbar (“Xbar”) 2920, one or more general processing clusters (“GPCs”) 2918, and one or more partition units (“memory partition units”) 2922. In at least one embodiment, PPU 2900 is connected to a host processor or other PPUs 2900 via one or more high-speed GPU interconnects (“GPU interconnects”) 2908. In at least one embodiment, PPU 2900 is connected to a host processor or other peripheral devices via an interconnect 2902. In at least one embodiment, PPU 2900 is connected to a local memory comprising one or more memory devices (“memory”) 2904. In at least one embodiment, memory devices 2904 include, without limitation, one or more dynamic random access memory (“DRAM”) devices. In at least one embodiment, one or more DRAM devices are configured and/or configurable as high-bandwidth memory (“HBM”) subsystems, with multiple DRAM dies stacked within each device. In at least one embodiment, high-speed GPU interconnect 2908 may refer to a wire-based multi-lane communications link that is used by systems to scale and include one or more PPUs 2900 combined with one or more central processing units (“CPUs”), supports cache coherence between PPUs 2900 and CPUs, and CPU mastering. In at least one embodiment, data and/or commands are transmitted by a high-speed GPU interconnect 2908 through hub 2916 to/from other units of PPU 2900, such as one or more copy engines, video encoders, video decoders, power management units, and other components which may not be explicitly illustrated in FIG.29. In at least one embodiment, I/O unit 2906 is configured to transmit and receive communications (e.g., commands, data) from a host processor (not illustrated in FIG.29) over system bus 2902. In at least one embodiment, I/O unit 2906 communicates with host processor directly via system bus 2902 or through one or more intermediate devices such as a memory bridge. In at least one embodiment, I/O unit 2906 may communicate with one or more other processors, such as one or more of PPUs 2900 via system bus 2902. In at least one embodiment, I/O unit 2906 implements a Peripheral Component Interconnect Express (“PCIe”) interface for communications over a PCIe bus. In at least one embodiment, I/O unit 2906 implements interfaces for communicating with external devices. In at least one embodiment, I/O unit 2906 decodes packets received via system bus 2902. In at least one embodiment, at least some packets represent commands configured to cause PPU 2900 to perform various operations. In at least one embodiment, I/O unit 2906 transmits decoded commands to various other units of PPU 2900 as specified by commands. In at least one embodiment, commands are transmitted to front-end unit 2910 and/or transmitted to hub 2916 or other units of PPU 2900 such as one or more copy engines, a video encoder, a video decoder, a power management unit, etc. (not explicitly illustrated in FIG.29). In at least one embodiment, I/O unit 2906 is configured to route communications between and among various logical units of PPU 2900. In at least one embodiment, a program executed by a host processor encodes a command stream in a buffer that provides workloads to PPU 2900 for processing. In at least one embodiment, a workload comprises instructions and data to be processed by those instructions. In at least one embodiment, buffer is a region in a memory that is accessible (e.g., read/write) by both host processor and PPU 2900 — a host interface unit may be configured to access buffer in a system memory connected to system bus 2902 via memory requests transmitted over system bus 2902 by I/O unit 2906. In at least one embodiment, host processor writes command stream to buffer and then transmits a pointer to start of command stream to PPU 2900 such that front-end unit 2910 receives pointers to one or more command streams and manages one or more command streams, reading commands from command streams and forwarding commands to various units of PPU 2900. In at least one embodiment, front-end unit 2910 is coupled to scheduler unit 2912 that configures various GPCs 2918 to process tasks defined by one or more command streams. In at least one embodiment, scheduler unit 2912 is configured to track state information related to various tasks managed by scheduler unit 2912 where state information may indicate which of GPCs 2918 a task is assigned to, whether task is active or inactive, a priority level associated with a task, and so forth. In at least one embodiment, scheduler unit 2912 manages execution of a plurality of tasks on one or more of GPCs 2918. In at least one embodiment, scheduler unit 2912 is coupled to work distribution unit 2914 that is configured to dispatch tasks for execution on GPCs 2918. In at least one embodiment, work distribution unit 2914 tracks a number of scheduled tasks received from scheduler unit 2912 and work distribution unit 2914 manages a pending task pool and an active task pool for each of GPCs 2918. In at least one embodiment, pending task pool comprises a number of slots (e.g., 32 slots) that contain tasks assigned to be processed by a particular GPC 2918; an active task pool may comprise a number of slots (e.g., 4 slots) for tasks that are actively being processed by GPCs 2918, such that as one of GPCs 2918 completes execution of a task, that task is evicted from active task pool for GPC 2918 and one of other tasks from pending task pool is selected and scheduled for execution on GPC 2918. In at least one embodiment, if an active task is idle on GPC 2918, such as while waiting for a data dependency to be resolved, then active task is evicted from GPC 2918 and returned to pending task pool while another task in pending task pool is selected and scheduled for execution on GPC 2918. In at least one embodiment, work distribution unit 2914 communicates with one or more GPCs 2918 via XBar 2920. In at least one embodiment, XBar 2920 is an interconnect network that couples many of units of PPU 2900 to other units of PPU 2900, and can be configured to couple work distribution unit 2914 to a particular GPC 2918. In at least one embodiment, one or more other units of PPU 2900 may also be connected to XBar 2920 via hub 2916. In at least one embodiment, tasks are managed by scheduler unit 2912 and dispatched to one of GPCs 2918 by work distribution unit 2914. In at least one embodiment, GPC 2918 is configured to process task and generate results. In at least one embodiment, results may be consumed by other tasks within GPC 2918, routed to a different GPC 2918 via XBar 2920, or stored in memory 2904. In at least one embodiment, results can be written to memory 2904 via partition units 2922, which implement a memory interface for reading and writing data to/from memory 2904. In at least one embodiment, results can be transmitted to another PPU 2904 or CPU via high-speed GPU interconnect 2908. In at least one embodiment, PPU 2900 includes, without limitation, a number U of partition units 2922 that is equal to a number of separate and distinct memory devices 2904 coupled to PPU 2900. In at least one embodiment, partition unit 2922 will be described in more detail herein in conjunction with FIG.31. In at least one embodiment, a host processor executes a driver kernel that implements an application programming interface (“API”) that enables one or more applications executing on host processor to schedule operations for execution on PPU 2900. In at least one embodiment, multiple compute applications are simultaneously executed by PPU 2900 and PPU 2900 provides isolation, quality of service (“QoS”), and independent address spaces for multiple compute applications. In at least one embodiment, an application generates instructions (e.g., in form of API calls) that cause driver kernel to generate one or more tasks for execution by PPU 2900 and driver kernel outputs tasks to one or more streams being processed by PPU 2900. In at least one embodiment, each task comprises one or more groups of related threads, which may be referred to as a warp. In at least one embodiment, a warp comprises a plurality of related threads (e.g., 32 threads) that can be executed in parallel. In at least one embodiment, cooperating threads can refer to a plurality of threads including instructions to perform a task and that exchange data through shared memory. In at least one embodiment, threads and cooperating threads are described in more detail, in accordance with at least one embodiment, in conjunction with FIG.31. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, a deep learning application processor is used to train a machine learning model, such as a neural network, to predict or infer information provided to PPU 2900. In at least one embodiment, a deep learning application processor 2900 is used to infer or predict information based on a trained machine learning model (e.g., neural network) that has been trained by another processor or system or by PPU 2900. In at least one embodiment, PPU 2900 may be used to perform one or more neural network use cases described herein. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIG.29 to perform CRC generation and/or checking. FIG.30 illustrates a general processing cluster (“GPC”) 3000, according to at least one embodiment. In at least one embodiment, GPC 3000 is GPC 2918 of FIG.29. In at least one embodiment, each GPC 3000 includes, without limitation, a number of hardware units for processing tasks and each GPC 3000 includes, without limitation, a pipeline manager 3002, a pre-raster operations unit (“PROP”) 3004, a raster engine 3008, a work distribution crossbar (“WDX”) 3016, a memory management unit (“MMU”) 3018, one or more Data Processing Clusters (“DPCs”) 3006, and any suitable combination of parts. In at least one embodiment, operation of GPC 3000 is controlled by a pipeline manager 3002. In at least one embodiment, pipeline manager 3002 manages configuration of one or more DPCs 3006 for processing tasks allocated to GPC 3000. In at least one embodiment, pipeline manager 3002 configures at least one of one or more DPCs 3006 to implement at least a portion of a graphics rendering pipeline. In at least one embodiment, DPC 3006 is configured to execute a vertex shader program on a programmable streaming multi-processor (“SM”) 3014. In at least one embodiment, pipeline manager 3002 is configured to route packets received from a work distribution unit to appropriate logical units within GPC 3000. In at least one embodiment, and some packets may be routed to fixed function hardware units in PROP 3004 and/or raster engine 3008 while other packets may be routed to DPCs 3006 for processing by a primitive engine 3012 or SM 3014. In at least one embodiment, pipeline manager 3002 configures at least one of DPCs 3006 to implement a neural network model and/or a computing pipeline. In at least one embodiment, PROP unit 3004 is configured to route data generated by raster engine 3008 and DPCs 3006 to a Raster Operations (“ROP”) unit in a partition unit 2922, described in more detail above in conjunction with FIG.29. In at least one embodiment, PROP unit 3004 is configured to perform optimizations for color blending, organize pixel data, perform address translations, and more. In at least one embodiment, raster engine 3008 includes, without limitation, a number of fixed function hardware units configured to perform various raster operations, in at least one embodiment, and raster engine 3008 includes, without limitation, a setup engine, a coarse raster engine, a culling engine, a clipping engine, a fine raster engine, a tile coalescing engine, and any suitable combination thereof. In at least one embodiment, setup engine receives transformed vertices and generates plane equations associated with geometric primitive defined by vertices; plane equations are transmitted to coarse raster engine to generate coverage information (e.g., an x, y coverage mask for a tile) for primitive; output of coarse raster engine is transmitted to culling engine where all fragments associated with primitive that fail a z-test are culled, and transmitted to a clipping engine where all fragments lying outside a viewing frustum are clipped. In at least one embodiment, any fragments that survive clipping and culling are passed to a fine raster engine to generate attributes for pixel fragments, based on plane equations generated by setup engine. In at least one embodiment, output of raster engine 3008 comprises fragments to be processed by any suitable entity, such as by a fragment shader implemented within DPC 3006. In at least one embodiment, each DPC 3006 included in GPC 3000 comprise, without limitation, an M-Pipe Controller (“MPC”) 3010; a primitive engine 3012; one or more SMs 3014; and any suitable combination thereof. In at least one embodiment, MPC 3010 controls operation of DPC 3006, routing packets received from pipeline manager 3002 to appropriate units in DPC 3006. In at least one embodiment, packets associated with a vertex are routed to primitive engine 3012, which is configured to fetch vertex attributes associated with vertex from memory; in contrast, packets associated with a shader program may be transmitted to SM 3014. In at least one embodiment, SM 3014 comprises, without limitation, a programmable streaming processor that is configured to process tasks represented by a number of threads. In at least one embodiment, SM 3014 is multi-threaded and configured to execute a plurality of threads (e.g., 32 threads) from a particular group of threads concurrently, and implements a Single-Instruction, Multiple-Data (“SIMD”) architecture, where each thread in a group of threads (e.g., a warp) is configured to process a different set of data based on same set of instructions. In at least one embodiment, all threads in a group of threads execute same instructions. In at least one embodiment, SM 3014 implements a Single-Instruction, Multiple Thread (“SIMT”) architecture wherein each thread in a group of threads is configured to process a different set of data based on same set of instructions, but where individual threads in group of threads are allowed to diverge during execution. In at least one embodiment, a program counter, call stack, and execution state is maintained for each warp, enabling concurrency between warps and serial execution within warps when threads within warp diverge. In at least one embodiment, a program counter, call stack, and execution state is maintained for each individual thread, enabling equal concurrency between all threads, within and between warps. In at least one embodiment, execution state is maintained for each individual thread and threads executing same instructions may be converged and executed in parallel for better efficiency. At least one embodiment of SM 3014 is described in more detail herein. In at least one embodiment, MMU 3018 provides an interface between GPC 3000 and memory partition unit (e.g., partition unit 2922 of FIG.29) and MMU 3018 provides translation of virtual addresses into physical addresses, memory protection, and arbitration of memory requests. In at least one embodiment, MMU 3018 provides one or more translation lookaside buffers (“TLBs”) for performing translation of virtual addresses into physical addresses in memory. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, a deep learning application processor is used to train a machine learning model, such as a neural network, to predict or infer information provided to GPC 3000. In at least one embodiment, GPC 3000 is used to infer or predict information based on a trained machine learning model (e.g., neural network) that has been trained by another processor or system or by GPC 3000. In at least one embodiment, GPC 3000 may be used to perform one or more neural network use cases described herein. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIG.30 to perform CRC generation and/or checking. FIG.31 illustrates a memory partition unit 3100 of a parallel processing unit (“PPU”), in accordance with at least one embodiment. In at least one embodiment, a memory partition unit 3100 includes, without limitation, a Raster Operations (“ROP”) unit 3102; a level two (“L2”) cache 3104; a memory interface 3106; and any suitable combination thereof. In at least one embodiment, memory interface 3106 is coupled to memory. In at least one embodiment, memory interface 3106 may implement 32, 64, 128, 1024-bit data buses, or alike, for high-speed data transfer. In at least one embodiment, PPU incorporates U memory interfaces 3106, one memory interface 3106 per pair of partition units 3100, where each pair of partition units 3100 is connected to a corresponding memory device. For example, in at least one embodiment, a PPU may be connected to up to Y memory devices, such as high bandwidth memory stacks or graphics double-data-rate, version 5, synchronous dynamic random access memory (“GDDR5 SDRAM”). In at least one embodiment, memory interface 3106 implements a high bandwidth memory second generation (“HBM2”) memory interface and Y equals half U. In at least one embodiment, HBM2 memory stacks are located on same physical package as PPU, providing substantial power and area savings compared with conventional GDDR5 SDRAM systems. In at least one embodiment, each HBM2 stack includes, without limitation, four memory dies and Y equals 4, with each HBM2 stack including two 128-bit channels per die for a total of 8 channels and a data bus width of 1024 bits. In at least one embodiment, memory supports Single-Error Correcting Double-Error Detecting (“SECDED”) Error Correction Code (“ECC”) to protect data. In at least one embodiment, ECC provides higher reliability for compute applications that are sensitive to data corruption. In at least one embodiment, a PPU implements a multi-level memory hierarchy. In at least one embodiment, memory partition unit 3100 supports a unified memory to provide a single unified virtual address space for central processing unit (“CPU”) and PPU memory, enabling data sharing between virtual memory systems. In at least one embodiment, frequency of accesses by a PPU to memory located on other processors is traced to ensure that memory pages are moved to physical memory of PPU that is accessing pages more frequently. In at least one embodiment, high-speed GPU interconnect 2908 supports address translation services allowing PPU to directly access a CPU’s page tables and providing full access to CPU memory by PPU. In at least one embodiment, copy engines transfer data between multiple PPUs or between PPUs and CPUs. In at least one embodiment, copy engines can generate page faults for addresses that are not mapped into page tables and memory partition unit 3100 then services page faults, mapping addresses into page table, after which copy engine performs transfer. In at least one embodiment, memory is pinned (e.g., non-pageable) for multiple copy engine operations between multiple processors, substantially reducing available memory. In at least one embodiment, with hardware page faulting, addresses can be passed to copy engines without regard as to whether memory pages are resident, and copy process is transparent. Data from memory 2904 of FIG.29 or other system memory is fetched by memory partition unit 3100 and stored in L2 cache 3104, which is located on-chip and is shared between various GPCs, in accordance with at least one embodiment. Each memory partition unit 3100, in at least one embodiment, includes, without limitation, at least a portion of L2 cache associated with a corresponding memory device. In at least one embodiment, lower level caches are implemented in various units within GPCs. In at least one embodiment, each of SMs 3014 may implement a level one (“L1”) cache wherein L1 cache is private memory that is dedicated to a particular SM 3014 and data from L2 cache 3104 is fetched and stored in each of L1 caches for processing in functional units of SMs 3014. In at least one embodiment, L2 cache 3104 is coupled to memory interface 3106 and XBar 2920. ROP unit 3102 performs graphics raster operations related to pixel color, such as color compression, pixel blending, and more, in at least one embodiment. ROP unit 3102, in at least one embodiment, implements depth testing in conjunction with raster engine 3008, receiving a depth for a sample location associated with a pixel fragment from culling engine of raster engine 3008. In at least one embodiment, depth is tested against a corresponding depth in a depth buffer for a sample location associated with fragment. In at least one embodiment, if fragment passes depth test for sample location, then ROP unit 3102 updates depth buffer and transmits a result of depth test to raster engine 3008. It will be appreciated that number of partition units 3100 may be different than number of GPCs and, therefore, each ROP unit 3102 can, in at least one embodiment, be coupled to each of GPCs. In at least one embodiment, ROP unit 3102 tracks packets received from different GPCs and determines which that a result generated by ROP unit 3102 is routed to through XBar 2920. FIG.32 illustrates a streaming multi-processor (“SM”) 3200, according to at least one embodiment. In at least one embodiment, SM 3200 is SM of FIG.30. In at least one embodiment, SM 3200 includes, without limitation, an instruction cache 3202; one or more scheduler units 3204; a register file 3208; one or more processing cores (“cores”) 3210; one or more special function units (“SFUs”) 3212; one or more load/store units (“LSUs”) 3214; an interconnect network 3216; a shared memory/level one (“L1”) cache 3218; and any suitable combination thereof. In at least one embodiment, a work distribution unit dispatches tasks for execution on general processing clusters (“GPCs”) of parallel processing units (“PPUs”) and each task is allocated to a particular Data Processing Cluster (“DPC”) within a GPC and, if task is associated with a shader program, task is allocated to one of SMs 3200. In at least one embodiment, scheduler unit 3204 receives tasks from work distribution unit and manages instruction scheduling for one or more thread blocks assigned to SM 3200. In at least one embodiment, scheduler unit 3204 schedules thread blocks for execution as warps of parallel threads, wherein each thread block is allocated at least one warp. In at least one embodiment, each warp executes threads. In at least one embodiment, scheduler unit 3204 manages a plurality of different thread blocks, allocating warps to different thread blocks and then dispatching instructions from plurality of different cooperative groups to various functional units (e.g., processing cores 3210, SFUs 3212, and LSUs 3214) during each clock cycle. In at least one embodiment, the Cooperative Groups may refer to a programming model for organizing groups of communicating threads that allows developers to express granularity at which threads are communicating, enabling expression of richer, more efficient parallel decompositions. In at least one embodiment, cooperative launch APIs support synchronization amongst thread blocks for execution of parallel algorithms. In at least one embodiment, applications of conventional programming models provide a single, simple construct for synchronizing cooperating threads: a barrier across all threads of a thread block (e.g., syncthreads( ) function). However, in at least one embodiment, programmers may define groups of threads at smaller than thread block granularities and synchronize within defined groups to enable greater performance, design flexibility, and software reuse in form of collective group-wide function interfaces. In at least one embodiment, the Cooperative Groups enables programmers to define groups of threads explicitly at sub-block (e.g., as small as a single thread) and multi-block granularities, and to perform collective operations such as synchronization on threads in a cooperative group. In at least one embodiment, a programming model supports clean composition across software boundaries, so that libraries and utility functions can synchronize safely within their local context without having to make assumptions about convergence. In at least one embodiment, the Cooperative Groups primitives enable new patterns of cooperative parallelism, including, without limitation, producer-consumer parallelism, opportunistic parallelism, and global synchronization across an entire grid of thread blocks. In at least one embodiment, a dispatch unit 3206 is configured to transmit instructions to one or more of functional units and scheduler units 3204 includes, without limitation, two dispatch units 3206 that enable two different instructions from same warp to be dispatched during each clock cycle. In at least one embodiment, each scheduler unit 3204 includes a single dispatch unit 3206 or additional dispatch units 3206. In at least one embodiment, each SM 3200, includes, without limitation, a register file 3208 that provides a set of registers for functional units of SM 3200. In at least one embodiment, register file 3208 is divided between each of functional units such that each functional unit is allocated a dedicated portion of register file 3208. In at least one embodiment, register file 3208 is divided between different warps being executed by SM 3200 and register file 3208 provides a temporary storage for operands connected to data paths of functional units. In at least one embodiment, each SM 3200 comprises, without limitation, a plurality of L processing cores 3210. In at least one embodiment, SM 3200 includes, without limitation, a large number (e.g., 128 or more) of distinct processing cores 3210. In at least one embodiment, each processing core 3210, in at least one embodiment, includes, without limitation, a fully pipelined, single-precision, double-precision, and/or mixed precision processing unit that includes, without limitation, a floating point arithmetic logic unit and an integer arithmetic logic unit. In at least one embodiment, floating point arithmetic logic units implement IEEE 754-2008 standard for floating point arithmetic. In at least one embodiment, processing cores 3210 include, without limitation, 64 single-precision (32-bit) floating point cores, 64 integer cores, 32 double-precision (64-bit) floating point cores, and 8 tensor cores. Tensor cores are configured to perform matrix operations in accordance with at least one embodiment. In at least one embodiment, one or more tensor cores are included in processing cores 3210. In at least one embodiment, tensor cores are configured to perform deep learning matrix arithmetic, such as convolution operations for neural network training and inferencing. In at least one embodiment, each tensor core operates on a 4x4 matrix and performs a matrix multiply and accumulate operation D = A x B + C, where A, B, C, and D are 4x4 matrices. In at least one embodiment, matrix multiply inputs A and B are 16-bit floating point matrices and accumulation matrices C and D are16-bit floating point or 32-bit floating point matrices. In at least one embodiment, tensor cores operate on a 16-bit floating point input data with a 32-bit floating point accumulation. In at least one embodiment, 16-bit floating point multiply uses 64 operations and results in a full precision product that is then accumulated using a 32-bit floating point addition with other intermediate products for a 4x4x4 matrix multiply. Tensor cores are used to perform much larger two-dimensional or higher dimensional matrix operations, built up from these smaller elements, in at least one embodiment. In at least one embodiment, an API, such as CUDA 9 C++ API, exposes specialized matrix load, matrix multiply and accumulate, and matrix store operations to efficiently use tensor cores from a CUDA-C++ program. In at least one embodiment, at CUDA level, warp-level interface assumes 16x16 size matrices spanning all 32 threads of warp. In at least one embodiment, each SM 3200 comprises, without limitation, M SFUs 3212 that perform special functions (e.g., attribute evaluation, reciprocal square root, and like). In at least one embodiment, SFUs 3212 include, without limitation, a tree traversal unit configured to traverse a hierarchical tree data structure. In at least one embodiment, SFUs 3212 include, without limitation, a texture unit configured to perform texture map filtering operations. In at least one embodiment, texture units are configured to load texture maps (e.g., a 2D array of texels) from memory and sample texture maps to produce sampled texture values for use in shader programs executed by SM 3200. In at least one embodiment, texture maps are stored in shared memory/L1 cache 3218. In at least one embodiment, texture units implement texture operations such as filtering operations using mip-maps (e.g., texture maps of varying levels of detail), in accordance with at least one embodiment. In at least one embodiment, each SM 3200 includes, without limitation, two texture units. Each SM 3200 comprises, without limitation, N LSUs 3214 that implement load and store operations between shared memory/L1 cache 3218 and register file 3208, in at least one embodiment. In at least one embodiment, each SM 3200 includes, without limitation, an interconnect network 3216 that connects each of functional units to register file 3208 and LSU 3214 to register file 3208 and shared memory/ L1 cache 3218 in at least one embodiment. In at least one embodiment, interconnect network 3216 is a crossbar that can be configured to connect any of functional units to any of registers in register file 3208 and connect LSUs 3214 to register file 3208 and memory locations in shared memory/L1 cache 3218. In at least one embodiment, shared memory/L1 cache 3218 is an array of on-chip memory that allows for data storage and communication between SM 3200 and primitive engine and between threads in SM 3200, in at least one embodiment. In at least one embodiment, shared memory/L1 cache 3218 comprises, without limitation, 128KB of storage capacity and is in path from SM 3200 to partition unit. In at least one embodiment, shared memory/L1 cache 3218, in at least one embodiment, is used to cache reads and writes. In at least one embodiment, one or more of shared memory/L1 cache 3218, L2 cache, and memory are backing stores. Combining data cache and shared memory functionality into a single memory block provides improved performance for both types of memory accesses, in at least one embodiment. In at least one embodiment, capacity is used or is usable as a cache by programs that do not use shared memory, such as if shared memory is configured to use half of capacity, texture and load/store operations can use remaining capacity. Integration within shared memory/L1 cache 3218 enables shared memory/L1 cache 3218 to function as a high- throughput conduit for streaming data while simultaneously providing high-bandwidth and low-latency access to frequently reused data, in accordance with at least one embodiment. In at least one embodiment, when configured for general purpose parallel computation, a simpler configuration can be used compared with graphics processing. In at least one embodiment, fixed function graphics processing units are bypassed, creating a much simpler programming model. In at least one embodiment, in a general purpose parallel computation configuration, work distribution unit assigns and distributes blocks of threads directly to DPCs, in at least one embodiment. In at least one embodiment, threads in a block execute a same program, using a unique thread ID in calculation to ensure each thread generates unique results, using SM 3200 to execute said program and perform calculations, shared memory/L1 cache 3218 to communicate between threads, and LSU 3214 to read and write global memory through shared memory/L1 cache 3218 and memory partition unit. In at least one embodiment, when configured for general purpose parallel computation, SM 3200 writes commands that scheduler unit 3204 can use to launch new work on DPCs. In at least one embodiment, PPU is included in or coupled to a desktop computer, a laptop computer, a tablet computer, servers, supercomputers, a smart-phone (e.g., a wireless, hand-held device), personal digital assistant (“PDA”), a digital camera, a vehicle, a head mounted display, a hand-held electronic device, and more. In at least one embodiment, PPU is embodied on a single semiconductor substrate. In at least one embodiment, PPU is included in a system-on-a-chip (“SoC”) along with one or more other devices such as additional PPUs, memory, a reduced instruction set computer (“RISC”) CPU, a memory management unit (“MMU”), a digital-to-analog converter (“DAC”), and alike. In at least one embodiment, PPU may be included on a graphics card that includes one or more memory devices. In at least one embodiment, a graphics card may be configured to interface with a PCIe slot on a motherboard of a desktop computer. In at least one embodiment, PPU may be an integrated graphics processing unit (“iGPU”) included in a chipset of a motherboard. Inference and/or training logic 715 are used to perform inferencing and/or training operations associated with one or more embodiments. Details regarding inference and/or training logic 715 are provided herein in conjunction with FIGS.7A and/or 7B. In at least one embodiment, a deep learning application processor is used to train a machine learning model, such as a neural network, to predict or infer information provided to SM 3200. In at least one embodiment, SM 3200 is used to infer or predict information based on a trained machine learning model (e.g., neural network) that has been trained by another processor or system or by SM 3200. In at least one embodiment, SM 3200 may be used to perform one or more neural network use cases described herein. In at least one embodiment, a GPU-based CRC processing unit might be used in a system of FIG.32 to perform CRC generation and/or checking. In at least one embodiment, a single semiconductor platform may refer to a sole unitary semiconductor-based integrated circuit or chip. In at least one embodiment, multi- chip modules may be used with increased connectivity which simulate on-chip operation, and make substantial improvements over utilizing a conventional central processing unit (“CPU”) and bus implementation. In at least one embodiment, various modules may also be situated separately or in various combinations of semiconductor platforms per desires of user. In at least one embodiment, computer programs in form of machine-readable executable code or computer control logic algorithms are stored in main memory 1204 and/or a secondary storage. Computer programs, if executed by one or more processors, enable system 1200 to perform various functions in accordance with at least one embodiment. In at least one embodiment, memory 1204, storage, and/or any other storage are possible examples of computer-readable media. In at least one embodiment, secondary storage may refer to any suitable storage device or system such as a hard disk drive and/or a removable storage drive, representing a floppy disk drive, a magnetic tape drive, a compact disk drive, a digital versatile disk (“DVD”) drive, a recording device, a universal serial bus (“USB”) flash memory, etc. In at least one embodiment, architecture and/or functionality of various previous figures are implemented in context of CPU 1202; parallel processing system 1212; an integrated circuit capable of at least a portion of capabilities of both CPU 1202; parallel processing system 1212; a chipset (e.g., a group of integrated circuits designed to work and sold as a unit for performing related functions, etc.); and any suitable combination of integrated circuit(s). In at least one embodiment, architecture and/or functionality of various previous figures are implemented in context of a general computer system, a circuit board system, a game console system dedicated for entertainment purposes, an application-specific system, and more. In at least one embodiment, computer system 1200 may take form of a desktop computer, a laptop computer, a tablet computer, servers, supercomputers, a smart-phone (e.g., a wireless, hand-held device), personal digital assistant (“PDA”), a digital camera, a vehicle, a head mounted display, a hand-held electronic device, a mobile phone device, a television, a workstation, game consoles, an embedded system, and/or any other type of logic. In at least one embodiment, parallel processing system 1212 includes, without limitation, a plurality of parallel processing units (“PPUs”) 1214 and associated memories 1216. In at least one embodiment, PPUs 1214 are connected to a host processor or other peripheral devices via an interconnect 1218 and a switch 1220 or a multiplexer. In at least one embodiment, parallel processing system 1212 distributes computational tasks across PPUs 1214 which can be parallelizable — for example, as part of distribution of computational tasks across multiple graphics processing unit (“GPU”) thread blocks. In at least one embodiment, memory is shared and accessible (e.g., for read and/or write access) across some or all of PPUs 1214, although such shared memory may incur performance penalties relative to use of local memory and registers resident to a PPU 1214. In at least one embodiment, operation of PPUs 1214 is synchronized through use of a command such as __syncthreads(), wherein all threads in a block (e.g., executed across multiple PPUs 1214) to reach a certain point of execution of code before proceeding. Other variations are within spirit of present disclosure. Thus, while disclosed techniques are susceptible to various modifications and alternative constructions, certain illustrated embodiments thereof are shown in drawings and have been described above in detail. It should be understood, however, that there is no intention to limit disclosure to a specific form or forms disclosed, but on contrary, intention is to cover all modifications, alternative constructions, and equivalents falling within spirit and scope of disclosure, as defined in appended claims. At least one embodiment of the disclosure can be described in view of the following clauses: 1. A method, comprising: obtaining an input data sequence; obtaining a cyclic redundancy check sequence; and allocating the input data sequence to threads of a plurality of threads of a graphics processing unit; allocating the cyclic redundancy check sequence to threads of the plurality of threads of the graphics processing unit; performing a cyclic redundancy check operation over the input data sequence and the cyclic redundancy check sequence using the threads of the plurality of threads of the graphics processing unit; and outputting a cyclic redundancy check result of the cyclic redundancy check operation. 2. The method of clause 1, wherein the cyclic redundancy check sequence is a first function of a generator polynomial, the input data sequence corresponds to a data polynomial, and the cyclic redundancy check result comprises a remainder of a polynomial division of a second function of the data polynomial times the generator polynomial. 3. The method of clause 2, wherein allocating the input data sequence to the plurality of threads comprises allocating the data polynomial among threads of the plurality of threads by parsing the data polynomial into a plurality of input data segments sized to fit a thread local memory data width. 4. The method of clause 3, wherein allocating the cyclic redundancy check sequence to the plurality of threads comprises allocating at least one of the generator polynomial or a polynomial factor among threads of the plurality of threads by parsing at least one of the generator polynomial or the polynomial factor into a plurality of generator segments sized to the thread local memory data width. 5. The method of clause 4, further comprising: storing the plurality of input data segments in local memory of the threads; and storing the plurality of generator segments in a global memory accessible to the plurality of threads of the graphics processing unit. 6. The method of clause 4 or 5, further comprising: computing a precomputed generator segment independent of the input data sequence as a third function of a thread position and the generator polynomial; storing the precomputed generator segment in a global memory accessible to the plurality of threads of the graphics processing unit. 7. The method of any of clauses 4-6, further comprising: determining a thread position; determining an associated generator segment associated with the thread position; computing values of a thread output for a thread having the thread position in the plurality of threads; and providing access to the values to the thread having the thread position, usable as a lookup table to look up a thread output for a given input data segment. 8. A cyclic redundancy checker, comprising: a first plurality of thread hardware units of a graphics processing unit, wherein a first thread hardware unit comprises: 1) a first execution core; 2) local memory for storage of an input data segment, wherein the input data segment is a portion of an input data sequence for which a cyclic redundancy check value is to be obtained; and 3) an interface to access a global memory of the graphics processing unit and accessible to the first plurality of thread hardware units, for storing a plurality of generator segments in the global memory, wherein the generator segments are based on a cyclic redundancy check sequence; a second plurality of thread hardware units, wherein a second thread hardware unit comprises: 1) a second execution core; and 2) an instruction cache having stored therein first instructions for performing a modulo operation with a thread output of the first thread hardware unit modulo a generator polynomial corresponding to the cyclic redundancy check sequence and second instructions for performing an exclusive OR operation with thread outputs of the first plurality of thread hardware units; and an output for outputting the cyclic redundancy check value. 9. The cyclic redundancy checker of clause 8, further comprising: a comparator for comparing the cyclic redundancy check value with a received cyclic redundancy check value received in association with the input data segment; and a first storage for storing a precomputed generator segment computed as a first function of a thread position and the generator polynomial, wherein the first storage is stored in a graphics processing unit global memory. 10. The cyclic redundancy checker of clause 8 or 9, wherein the second plurality of thread hardware units comprise a third plurality of thread hardware units for executing a parallel tree of exclusive OR operations. 11. The cyclic redundancy checker of any of clauses 8-10, wherein the cyclic redundancy check sequence is a first function of the generator polynomial, the input data sequence corresponds to a data polynomial, and the cyclic redundancy check value comprises a remainder of a polynomial division of a second function of the data polynomial times the generator polynomial. 12. The cyclic redundancy checker of clause 11, further comprising a thread manager for allocating the data polynomial among threads of the first plurality of thread hardware units by parsing the data polynomial into a plurality of input data segments sized to fit a thread local memory data width. 13. The cyclic redundancy checker of clause 12, wherein the interface allocates at least one of the generator polynomial or a polynomial factor among threads of the first plurality of thread hardware units by parsing at least one of the generator polynomial or the polynomial factor into the plurality of generator segments sized to fit the thread local memory data width. 14. The cyclic redundancy checker of clause 12 or 13, further comprising: a second storage in the global memory for storage of a precomputed generator segment independent of the input data sequence as a third function of a thread position and the generator polynomial. 15. The cyclic redundancy checker of any of clauses 12-14, further comprising: a second storage in the global memory for a lookup table, wherein the lookup table comprises a first set of precomputed entries for a first thread having a first thread position, and wherein the first set of precomputed entries comprises values of polynomial multiplication of possible values of input data segments and a first generator segment associated with the first thread position. 16. A software-defined radio for communications in a mobile device communications system, comprising: a graphics processing unit comprising a plurality of thread hardware units comprising: a) a first thread hardware unit comprising a first execution core, a first instruction cache, a first local memory, and a first load/store unit coupled to a shared memory shared among threads of the plurality of thread hardware units and coupled to a global memory of the graphics processing unit; and b) a second thread hardware unit comprising a second execution core, a second instruction cache, a second local memory, and a second load/store unit coupled to the shared memory shared and coupled to the global memory, wherein the first instruction cache comprises a first set of instructions for: 1) obtaining a first input data segment, wherein the first input data segment is a first portion of an input data sequence received by the software-defined radio; 2) obtaining a first cyclic redundancy check segment, wherein the first cyclic redundancy check segment is a first portion of a cyclic redundancy check sequence; and 3) performing a first multiplication operation on the first input data segment and the first cyclic redundancy check segment to form a first thread output; and wherein the second instruction cache comprises a second set of instructions for: 1) obtaining a second input data segment, wherein the second input data segment is a second portion of the input data sequence received by the software- defined radio; 2) obtaining a second cyclic redundancy check segment, wherein the second cyclic redundancy check segment is a second portion of the cyclic redundancy check sequence; and 3) performing a second multiplication operation on the second input data segment and the second cyclic redundancy check segment to form a second thread output; and c) a third thread hardware unit for performing a reduction operation on the first thread output and the second thread output to perform performing a cyclic redundancy check operation over the input data sequence and the cyclic redundancy check sequence, to form a cyclic redundancy check result representing a cyclic redundancy check of the input data sequence. 17. The software-defined radio of clause 16, wherein the cyclic redundancy check sequence is a first function of a generator polynomial, the input data sequence corresponds to a data polynomial, and the cyclic redundancy check result comprises a remainder of a polynomial division of a second function of the data polynomial times the generator polynomial. 18. The software-defined radio of clause 17, wherein the graphics processing unit is configured to allocate the input data sequence to the first thread hardware unit and the second thread hardware unit by allocating the data polynomial among the first thread hardware unit and the second thread hardware unit by parsing the data polynomial into a plurality of input data segments sized to fit a thread local memory data width. 19. The software-defined radio of clause 18, wherein the graphics processing unit is configured to allocate the cyclic redundancy check sequence to the first thread hardware unit and the second thread hardware unit comprises allocating at least one of the generator polynomial or a polynomial factor among the first thread hardware unit and the second thread hardware unit by parsing at least one of the generator polynomial or the polynomial factor into a plurality of generator segments sized to fit the thread local memory data width. 20. The software-defined radio of any of clauses 17-19, further comprising: a second storage in the global memory for storage of a precomputed generator segment independent of the input data sequence as a third function of a thread position and the generator polynomial. 21. The software-defined radio of any of clauses 17-20, further comprising: a second storage in the global memory for a lookup table, wherein the lookup table comprises a first set of precomputed entries for the first thread hardware unit having a first thread position, and wherein the first set of precomputed entries comprises values of polynomial multiplication of possible values of input data segments and a first generator segment associated with the first thread position. 22. A method, comprising: obtaining an input data sequence, representable as a binary polynomial; obtaining a generator polynomial for a cyclic redundancy check (CRC) process; parsing the binary polynomial into a plurality of input data segments; allocating a first input data segment of the plurality of input data segments to a first thread of a graphics processing unit (GPU) according to a first thread position of the first thread; allocating a second input data segment of the plurality of input data segments to a second thread of the GPU according to a second thread position of the second thread; parsing the generator polynomial into a plurality of generator segments; allocating a first generator segment of the plurality of generator segments to the first thread, wherein the first generator segment is a first monomial modulo the generator polynomial, wherein a first degree of the first monomial corresponds to the first thread position; allocating a second generator segment of the plurality of generator segments to the second thread, wherein the second generator segment is a second monomial modulo the generator polynomial, wherein a second degree of the second monomial corresponds to the second thread position; using the first thread, performing a first polynomial multiplication of the first input data segment and the first generator segment modulo the generator polynomial to form a first thread output; using the second thread, performing a second polynomial multiplication of the second input data segment and the second generator segment modulo the generator polynomial to form a second thread output, wherein the second thread performs the second polynomial multiplication in parallel with the first thread performing the first polynomial multiplication; using at least a third thread of the GPU, performing an exclusive OR operation on the first thread output and the second thread output to form a third thread output; and performing zero or more exclusive OR operations on the third thread output and on threads allocated additional input data segments other than the first input data segment and the second input data segment to form a computed CRC value comprising a polynomial multiplication of the binary polynomial by a CRC monomial with a CRC monomial degree corresponding to a degree of the generator polynomial modulo the generator polynomial. 23. The method of clause 22, wherein the generator polynomial is one or more of Pa^x^ൌx24^x23^x18^x17^x14^x11^x10^x7^x6^x5^x4^x3^x^1 and Pb^x^ൌx24^x23^x6^x5^x^1. 24. The method of clause 22 or 23, further comprising: obtaining a received CRC value received in association with the input data sequence; and comparing the received CRC value with the computed CRC value. 25. The method of clause 24, further comprising: determining if the received CRC value and the computed CRC value differ; and flagging a difference between the received CRC value and the computed CRC value. 26. The method of any of clauses 22-25, further comprising: providing the computed CRC value to associated with the input data sequence. 27. The method of any of clauses 22-26 , wherein the computed CRC value is computed for data on an uplink for a mobile device to cellular infrastructure servicing multiple mobile devices. Use of the terms “a” and “an” and “the” and similar referents in context of describing disclosed embodiments (especially in context of following claims) are to be construed to cover both singular and plural, unless otherwise indicated herein or clearly contradicted by context. Terms “comprising,” “having,” “including,” and “containing” are to be construed as open-ended terms (meaning “including, but not limited to,”) unless otherwise noted. Term “connected,” when unmodified and referring to physical connections, is to be construed as partly or wholly contained within, attached to, or joined together, even if there is something intervening. Recitation of ranges of values herein are merely intended to serve as a shorthand method of referring individually to each separate value falling within range, unless otherwise indicated herein and each separate value is incorporated into specification as if it were individually recited herein. Term “set” (e.g., “a set of items”) or “subset” unless otherwise noted or contradicted by context, is to be construed as a nonempty collection comprising one or more members. Further, unless otherwise noted or contradicted by context, term “subset” of a corresponding set does not necessarily denote a proper subset of corresponding set, but a subset and a corresponding set may be equal. Conjunctive language, such as phrases of form “at least one of A, B, and C,” or “at least one of A, B and C,” unless specifically stated otherwise or otherwise clearly contradicted by context, is otherwise understood with context as used in general to present that an item, term, etc., may be either A or B or C, or any nonempty subset of set of A and B and C. For instance, in illustrative example of a set having three members, conjunctive phrases “at least one of A, B, and C” and “at least one of A, B and C” refer to any of following sets: {A}, {B}, {C}, {A, B}, {A, C}, {B, C}, {A, B, C}. Thus, such conjunctive language is not generally intended to imply that certain embodiments require at least one of A, at least one of B and at least one of C each to be present. In addition, unless otherwise noted or contradicted by context, term “plurality” indicates a state of being plural (e.g., “a plurality of items” indicates multiple items). Number of items in a plurality is at least two, but can be more when so indicated either explicitly or by context. Further, unless stated otherwise or otherwise clear from context, phrase “based on” means “based at least in part on” and not “based solely on.” Operations of processes described herein can be performed in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. In at least one embodiment, a process such as those processes described herein (or variations and/or combinations thereof) is performed under control of one or more computer systems configured with executable instructions and is implemented as code (e.g., executable instructions, one or more computer programs or one or more applications) executing collectively on one or more processors, by hardware or combinations thereof. In at least one embodiment, code is stored on a computer-readable storage medium, for example, in form of a computer program comprising a plurality of instructions executable by one or more processors. In at least one embodiment, a computer-readable storage medium is a non- transitory computer-readable storage medium that excludes transitory signals (e.g., a propagating transient electric or electromagnetic transmission) but includes non-transitory data storage circuitry (e.g., buffers, cache, and queues) within transceivers of transitory signals. In at least one embodiment, code (e.g., executable code or source code) is stored on a set of one or more non-transitory computer-readable storage media having stored thereon executable instructions (or other memory to store executable instructions) that, when executed (e.g., as a result of being executed) by one or more processors of a computer system, cause computer system to perform operations described herein. A set of non- transitory computer-readable storage media, in at least one embodiment, comprises multiple non-transitory computer-readable storage media and one or more of individual non-transitory storage media of multiple non-transitory computer-readable storage media lack all of said code while multiple non-transitory computer-readable storage media collectively store all of said code. In at least one embodiment, executable instructions are executed such that different instructions are executed by different processors — for example, a non-transitory computer-readable storage medium store instructions and a main central processing unit (“CPU”) executes some of said instructions while a graphics processing unit (“GPU”) executes other instructions. In at least one embodiment, different components of a computer system have separate processors and different processors execute different subsets of instructions. Accordingly, in at least one embodiment, computer systems are configured to implement one or more services that singly or collectively perform operations of processes described herein and such computer systems are configured with applicable hardware and/or software that enable performance of operations. Further, a computer system that implements at least one embodiment of present disclosure is a single device and, in another embodiment, is a distributed computer system comprising multiple devices that operate differently such that distributed computer system performs operations described herein and such that a single device does not perform all operations. Use of any and all examples, or exemplary language (e.g., “such as”) provided herein, is intended merely to better illuminate embodiments of disclosure and does not pose a limitation on scope of disclosure unless otherwise claimed. No language in specification should be construed as indicating any non-claimed element as essential to practice of disclosure. All references, including publications, patent applications, and patents, cited herein are hereby incorporated by reference to same extent as if each reference were individually and specifically indicated to be incorporated by reference and were set forth in its entirety herein. In description and claims, terms “coupled” and “connected,” along with their derivatives, may be used. It should be understood that these terms may be not intended as synonyms for each other. Rather, in particular examples, “connected” or “coupled” may be used to indicate that two or more elements are in direct or indirect physical or electrical contact with each other. “Coupled” may also mean that two or more elements are not in direct contact with each other, but yet still co-operate or interact with each other. Unless specifically stated otherwise, it may be appreciated that throughout specification terms such as “processing,” “computing,” “calculating,” “determining,” or alike, refer to action and/or processes of a computer or computing system, or similar electronic computing device, that manipulate and/or transform data represented as physical, such as electronic, quantities within computing system’s registers and/or memories into other data similarly represented as physical quantities within computing system’s memories, registers or other such information storage, transmission or display devices. In a similar manner, term “processor” may refer to any device or portion of a device that processes electronic data from registers and/or memory and transform that electronic data into other electronic data that may be stored in registers and/or memory. As non-limiting examples, “processor” may be a CPU or a GPU. A “computing platform” may comprise one or more processors. As used herein, “software” processes may include, for example, software and/or hardware entities that perform work over time, such as tasks, threads, and intelligent agents. Also, each process may refer to multiple processes, for carrying out instructions in sequence or in parallel, continuously or intermittently. Terms “system” and “method” are used herein interchangeably insofar as system may embody one or more methods and methods may be considered a system. In present document, references may be made to obtaining, acquiring, receiving, or inputting analog or digital data into a subsystem, computer system, or computer-implemented machine. Process of obtaining, acquiring, receiving, or inputting analog and digital data can be accomplished in a variety of ways such as by receiving data as a parameter of a function call or a call to an application programming interface. In some implementations, process of obtaining, acquiring, receiving, or inputting analog or digital data can be accomplished by transferring data via a serial or parallel interface. In another implementation, process of obtaining, acquiring, receiving, or inputting analog or digital data can be accomplished by transferring data via a computer network from providing entity to an acquiring entity. References may also be made to providing, outputting, transmitting, sending, or presenting analog or digital data. In various examples, process of providing, outputting, transmitting, sending, or presenting analog or digital data can be accomplished by transferring data as an input or output parameter of a function call, a parameter of an application programming interface or interprocess communication mechanism. Although discussion above sets forth example implementations of described techniques, other architectures may be used to implement described functionality, and are intended to be within scope of this disclosure. Furthermore, although specific distributions of responsibilities are defined above for purposes of discussion, various functions and responsibilities might be distributed and divided in different ways, depending on circumstances. Furthermore, although subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that subject matter claimed in appended claims is not necessarily limited to specific features or acts described. Rather, specific features and acts are disclosed as exemplary forms of implementing claims.