Patent Grant
11669421
The present invention relates to resiliency in processing units, and more particularly to a fault injection architecture for resilient graphics processing unit (GPU) computing.
Memory circuits including flip-flops, latches, and random access memory cells can exhibit a transient or “soft” error and provide an incorrect output value. For example, an alpha particle may strike a physical storage node of a flip-flop and cause the flip-flop to change state. If the flip-flop is part of a processing unit, the alpha particle strike on the flip-flop may or may not cause the processing unit to produce incorrect results. In some cases, the state of a particular memory circuit will not change the results, while in other cases erroneous state in the memory circuit can generate a problematic error. Whether an error is actually generated by the processing unit depends on which memory circuit was affected and at what point in program execution. Modern GPUs typically include many millions of memory circuits, each of which may experience a soft error. Characterizing the resilience of a GPU to soft errors conventionally involves subjecting an operating GPU die to ionizing radiation. However, such techniques offer little control over which memory circuits are affected or when a specific memory circuit is affected relative to program execution. Consequently, conventional techniques do not provide accurate assessment of resilience of a particular GPU executing a given application. Thus, there is a need for addressing these issues and/or other issues associated with the prior art.
A method, processing unit, and system are disclosed for fault injection for assessing resilience in a multi-threaded processing unit. The method comprises executing a multi-threaded program, receiving a command to inject a state error within a specified subsystem of the processing unit, waiting for at least one halt condition to be satisfied, halting execution of the multi-threaded program within the subsystem, and injecting the state error. The state error is injected within the subsystem at a specified data storage circuit or at a specified random access memory (RAM) bit, before execution of the multi-threaded program is resumed. In an embodiment, the command is transmitted from a host processor to a programmable management unit within the processing unit through a host interface. In certain embodiments, the specified data storage circuit comprises one of a flip-flop or a latch.
Embodiments of the present disclosure provide precise state error injection into a processing unit, such as a GPU, executing an application. The application may execute in real-time and the process of injecting a state error may be generally transparent to the application. This capability of precise and transparent state error injection allows application developers to emulate any soft error in a GPU and confidently assess potential consequences of a resulting error in the application. Such assessment can be important for engineering reliable systems used in mission-critical applications, such as self-driving vehicle applications and others where a catastrophic system failure can impact human life and safety.
In an embodiment, circuitry within the GPU is organized into scan partitions, which may mirror scan chains used for production scan testing. Data storage circuits, such as flip-flops, latches, sequential circuits, or any other circuits that store state, are configured to form scan chains, which are coupled to a scan controller. Random access memory (RAM) circuits are coupled to a RAM access control circuit configured to provide read-modify-write access to the RAM circuits. A command to inject a state error in a GPU subsystem causes functional clock(s) used by the subsystem to be halted and the subsystem switched into a scan mode. All storage circuit state from the subsystem is scanned through an in-silicon fault injection (ISFI) circuit, which is able to inject a precise error (e.g., invert a state bit) at a specified location. Error injection within a RAM circuit may be accomplished by directing a RAM access control circuit to perform a read-modify-write operation that modifies a specified bit. After injecting a state error, the subsystem is restored to a functional mode. Except for the passage of additional time needed to perform the state error injection, the process is otherwise transparent to an application executing on the GPU subsystem and being subjected to a state error.
At step 102, the processing unit executes a multi-threaded program. The multi-threaded program may include, without limitation, a group of related threads, or multiple groups each comprising related threads. At step 104, the processing unit receives a command to inject a state error within a specified subsystem of the processing unit. At step 106, the processing unit waits for at least one halt condition to be satisfied.
In an embodiment, the at least one halt condition includes at least one of: an indication that asynchronous buffers configured to interface with the subsystem are inactive, an indication that a specified number of clock cycles have been counted, or an indication that a specified breakpoint instruction has been executed. For example, a halt condition may include waiting for pending operations for the asynchronous buffers to conclude, allowing the asynchronous buffers to become inactive. In another example, a halt condition may include the specified number of clock cycles has been counted and the asynchronous buffers are inactive. In yet another example, a break point instruction has been executed (or an instruction count reached) and the asynchronous buffers are inactive. Other halt conditions may also be implemented without departing the scope and spirit of various embodiments.
At step 108, the processing unit halts execution of the multi-threaded program within the subsystem. In various embodiments, the subsystem may include an arbitrarily large or small subset of circuitry within the processing unit. In an embodiment, the subsystem comprises one or more general processing clusters (GPCs) 350. At step 110, the processing unit injects the state error, wherein the state error is injected within the subsystem at a specified data storage circuit (e.g., flip-flop or latch), or at a specified random access memory (RAM) bit. The data storage circuit may be specified as a numbered location within a specified scan chain. The RAM bit may be specified as a bit position within an addressed word of a specified RAM instance. At step 112, the processing unit resumes execution of the multi-threaded program. In an embodiment, the command to inject the state error is transmitted from a host processor to a programmable management unit within the processing unit through a host interface.
In an embodiment, halting comprises synchronously disabling at least one functional clock signal for the subsystem, including the functional clock signal. Furthermore, resuming comprises synchronously enabling the at least one functional clock signal for the subsystem, including the functional clock signal. In various embodiments, a functional clock signal (e.g., functional clock signal 141 of
In general, a synchronously derived run/halt signal may be used to cause a clock control circuit to either allow or not allow the master clock signal to propagate to the clock endpoints. However, any technically feasible technique or techniques may be implemented to synchronously disable and synchronously enable the functional clock signal without departing the scope and spirit of various embodiments.
More illustrative information will now be set forth regarding various optional architectures and features with which the foregoing framework may be implemented, per the desires of the user. It should be strongly noted that the following information is set forth for illustrative purposes and should not be construed as limiting in any manner. Any of the following features may be optionally incorporated with or without the exclusion of other features described.
Resilience of the multi-threaded code can be assessed with respect to the state error by monitoring subsequent execution state and/or execution outcomes of the multi-threaded code. In a practical usage model, multiple execution runs would be performed and one or more state errors would be injected per execution run to assess code and processor resilience. In certain scenarios, code changes may be made to engineer more robust execution outcomes.
In an embodiment, host 121 is coupled to a PCIe interface 131 within the processing unit 130. More generally, any host interface may be implemented in place of the PCIe interface 131. As shown, a programmable management unit (PMU) 132 is coupled to the PCIe interface 131, and an in-silicon fault injection (ISFI) circuit 133. The PMU 132 is configured to receive commands from the fault injection system 124 through the PCIe interface 131. For example, the PMU 132 may receive a command from the fault injection system 124 to inject a state error at a particular storage circuit or RAM bit within the processing unit 130. The PMU 132 may then direct the ISFI circuit 133 to perform a series of steps to inject the state error according to the command. The PMU 132 may be configured to execute programming instructions, such as microcode, and may be programmed to control the operation of various hardware sub-circuits within processing unit 130.
In an embodiment, the ISFI 133 is configured to inject a state error in a GPC 140. In certain embodiments, the GPC 140 may comprise an instance of general processing clusters (GPCs) 350 of
A clock generator 134 may be configured to generate a functional clock signal 141 used by clocked circuitry (e.g., storage circuits, RAM circuits) within GPC 140 during normal operation. The clock generator 134 may also generate a scan clock signal 143 used by clocked circuitry within GPC 140 during scan operations for accessing internal state. In an embodiment, the clock generator 134 is configured to synchronously halt and start the functional clock signal 141 and the scan clock signal 143. In an embodiment, the PMU 132 is configured to control the clock generator 134 with respect to the functional clock signal 141 and the scan clock signal 143. In another embodiment, the ISFI 133 is configured to control the clock generator 134 with respect to the functional clock signal 141 and the scan clock signal 143.
The GPC 140 includes a plurality of storage circuits 144. The plurality of storage circuits 144 may be configured to form a scan chain (scan mode) as shown in
Processing unit 130 may include multiple clock domains that may each operate at a different frequency and/or different phase with respect to functional clock signal 141. Furthermore, different circuit subsystems within processing unit 130 may operate using one or more of the multiple clock domains. For example, processing unit 130 may include multiple instances of GPC 140 (not shown), with each instance of GPC 140 configured to operate in a different clock domain. In another example, PCIe interface 131 may operate within a different clock domain than GPC 140.
In an embodiment, a crossbar circuit (XBAR) 137 is configured to transmit data between GPC 140 and the different circuit subsystems. In an embodiment, crossbar circuit 137 comprises XBar 370 of
When the GPC 140 switches from operating in the functional mode to operating in the scan mode, the functional clock signal 141 is synchronously disabled. Subsequently, the scan clock signal 143 is synchronously enabled. Similarly, when the GPC 140 switches from operating in the scan mode to the functional mode, the scan clock signal 143 is synchronously disabled and the functional clock 141 is synchronously enabled. To synchronously disable a clock signal, an edge is detected in the clock signal and the clock signal is then gated to maintain state. For example, a falling edge may be detected and the clock signal is then gated low (forced to a low logic level). In an embodiment, a multiplexer circuit at a clock endpoint may synchronously select between the functional clock signal 141 and the scan clock signal 143. In the case of synchronously selecting, the multiplexer circuit is switched from the functional clock signal 141 after the functional clock signal 141 is disabled and to the scan clock signal 143 before the scan clock signal 143 is enabled. In alternative embodiments, different clocking techniques may be used to provide both a functional clock for functional operation and a scan clock for scan operation without departing the scope and spirit of the present disclosure.
In an embodiment, waiting for the at least one halt condition to be satisfied at step 106 of method 100 includes comprises waiting for FIFOs 139 to become inactive, with no asynchronous boundary crossings pending. In such an embodiment, the asynchronous buffers comprise FIFOs 139 and/or FIFOs 146, and the subsystem comprises CPG 140. In an embodiment, halting execution at step 108 of method 100 includes synchronously disabling functional clock signal 141. Crossbar circuit 137 may be configured to receive a halt command, which stalls outbound data from FIFOs 139. Furthermore, crossbar circuit 137 may also generate a ready signal to indicate FIFOs 139 are inactive.
In the functional mode, a clock select signal 145(C) causes multiplexor 158 to select the functional clock signal 141 as an operational clock signal for the flip-flop circuits 154. In the scan mode, the clock select signal 145(C) causes multiplexor 158 to select the scan clock signal 143 as the operational clock signal for the flip-flop circuits 154.
In the functional mode, a data select signal 145(D) causes multiplexors 156 to select combinational logic signals 155 generated for functional mode operation by the combinational logic 152 to be transmitted to corresponding data (D) inputs of the flip-flop circuits 154. Outputs (Q) 157 form the flip-flop circuits 154 may be transmitted to the combinational logic 152 and used for computing the combinational logic signals 155. The combinational logic 152 may also receive other input signals and generate certain output signals according to specific design requirements.
In scan mode, the data select signal 145(D) causes multiplexors 156 to configure the flip-flop circuits 154 into a scan chain, with a first flip-flop circuit 154(0) of the scan chain receiving scan input data from a scan debug input signal 147, and the last flip-flop circuit 154(J-1) in the scan chain transmitting output data 157(J-1) as a scan debug out signal 149. In an embodiment, the scan debug input signal 147 is received from the scan controller 135 of
In the functional mode, the RAM circuits 172 may drive RAM read data 175 through combinational paths to generate bits of resulting data. The storage circuits may sample and store the resulting data as part of a next-state calculation performed in response to a clock signal transition (e.g., a rising clock edge). Storage circuits that sample and store the resulting data for a given RAM circuit 172 through a combinational logic path are defined herein to be within a combinational influence of the RAM circuit 172. The combinational logic path may include a direct connection from the RAM circuit 172 to a storage circuit, or any number of intervening combinational logic circuits.
In a scan mode scenario where a state error is to be injected into a specific storage cell (bit) within a given RAM circuit 172, only the state of the storage cell should be altered. To avoid incidentally injecting additional state errors into the storage circuits, the state of all storage circuits within the combinational influence of the RAM circuit 172 may be scanned out and saved prior to injecting the state error in the storage cell. The state of the storage circuits may subsequently be scanned in and restored after the state error has been injected into the RAM circuit 172. A RAM access control circuit 176 may be configured to perform operations related to saving and restoring state for the storage circuits. The RAM access control circuit 176 may also be configured to facilitate or directly perform RAM read-modify-write operations for inverting a selected bit of data within a selected RAM circuit 172. In an embodiment, all storage circuits within a combination influence of a given RAM circuit 172 are organized into a corresponding scan chain 174.
As shown, a scan partition client 178 is configured to receive scan partition inputs 177 and generate scan partition outputs 179. In an embodiment, scan partition inputs 177 include inbound scan data and scan commands, and scan partition outputs 179 also include outbound scan data and scan commands (e.g., transmitted through partition scan client 178). Data residing in storage circuits within the combinational influence of a given RAM circuit 172 may be scanned out and scanned back in through the partition scan client 178. Furthermore, partition scan client 178 may be coupled to one or more peer partition scan clients (not shown) to form a chain and/or hierarchy of scan chain circuits.
In an embodiment, scan data and/or scan commands may comprise information that identifies a specific bit in a specific word in a specific RAM circuit 172 to be inverted for state error injection. In such an embodiment, a RAM access control circuit 176 is configured to perform a read-modify-write operation on the specific word in the specific RAM circuit 172 to invert the specific bit. In certain embodiments, the scan data and/or scan commands may comprise instructions to read and write data words stored in the RAM circuit 172, with write data received from scan partition inputs 177 and read data transmitted from scan partition outputs 179. In an embodiment, partition scan client 178 comprises an IEEE Std. 1500 wrapper, as defined in the art.
Internal state data from a subsystem scan chain 181 may be serially scanned through the scan controller 135 and the ISFI 133, with each bit of internal state data shifted along a path an appropriate number of times to return the bit to its original storage circuit. The internal state data is sequentially scanned through a bit flip circuit 188, with inbound data arriving from a scan input signal 184 and outbound data transmitted through a scan output signal 185. The bit flip circuit 188 may be configured to either copy or invert a given bit of the internal state data (e.g., an X-OR function). Only an identified bit of internal state data is inverted. The bit may be identified, without limitation, by position in a scan chain 162, position in a scan partition 160, or position in a subsystem scan chain 181(0). When the identified bit of internal state data is presented to the bit flip circuit 188, a state error injection signal 187 may be asserted active by the PMU 132. Alternatively, state error injection signal 187 may instead indicate which bit position within the scan chain should be inverted, and circuitry within the ISFI 133 counts bit positions until a match is found.
Internal state for a RAM circuit 172 may be modified (inverted) to inject a state error using a command transmitted to a corresponding scan partition 170, causing a read-modify-write to be internally performed on the RAM circuit 172. In an embodiment, the command identifies which bit should be inverted for a given addressed word of a specified instance of a RAM circuit 172. Command data, including a state error injection command, may be transmitted to the ISFI 133 through a command signal 186.
In an alternative embodiment, the addressed word is scanned along a scan path through the scan controller 135 and the bit flip circuit 188, and scanned back along the scan path to be written back to the RAM circuit 172. State data residing in storage circuits within the combinational influence of the RAM circuit 172 may also be scanned along the scan path and stored for later restoration to the storage circuits.
In an embodiment, clock generator 134 may be controlled by ISFI 133 to enable and disable functional clock signal 141 and scan clock signal 143 of
In an embodiment, the ISFI 133 is configured to receive a halt command, such as from command signal 186, generated by the PMU 132. In response to the halt command, the ISFI 133 transmits a halt request signal 192 to the crossbar circuit 137. Any technically feasible technique may be implemented to cause relevant FIFOs within the crossbar circuit 137 (e.g., FIFOs 139) to become inactive. Once the relevant FIFOs are inactive and no pending transactions are at an asynchronous boundary crossing, the crossbar circuit 137 may transmit a halt ready signal 193, indicating to the ISFI 133 that no asynchronous boundary crossing is pending and a halt condition has been satisfied.
At step 202, the processing unit configures data storage circuits (e.g., storage circuits 144) within a specified subsystem (e.g., GPC 130) of the processing unit to form a scan chain having a scan input signal (e.g., scan debug input signal 147) at the beginning of the scan chain and a scan output signal (e.g., scan debug output signal 149) at the end of the scan chain. During normal operation, each data storage circuit of the data storage circuits includes an initial data value. Each initial value may represent a functional mode value residing at the storage circuit at the time processing was halted in the specified subsystem.
At step 204, the processing unit configures the data storage circuits to receive (operate using) a scan clock signal (e.g., scan clock signal 143). At step 206, the processing unit synchronously enables the scan clock signal. At step 208, the processing unit shifts (scans), synchronously with the scan clock signal, data stored in the data storage circuits along the scan chain through one complete traverse of the scan chain. In an embodiment, the scan output signal is configured to loop back into the scan input signal (e.g., through the scan controller 135). In an embodiment, an initial data value for the specified data storage circuit is inverted at the scan input signal during a corresponding clock count of the scan clock signal.
At step 210, the processing unit synchronously disables the scan clock signal. At step 212, the processing unit configures the data storage circuits to receive the functional clock signal. At step 214, the processing unit configures the data storage circuits to operate in the functional mode. Configuring the data storage circuits to operate in the functional mode may include, without limitation, switching a selection multiplexor circuit (e.g., multiplexor circuits 156) to select combinational logic signals 155 generated for functional mode operation.
At step 222, the processing unit configures the following sub-circuits to receive a scan clock signal (e.g., scan clock signal 143 of
At step 226, the processing unit captures state bits from the data storage circuits. At step 228, the processing unit causes the RAM controller circuit to perform a read-modify-write operation to invert the specified RAM bit. At step 230, the processing unit restores the state bits into the data storage circuits. In an embodiment, the state bits are restored by scanning the state bits back into corresponding data storage circuits. At step 232, the processing unit synchronously disables the scan clock signal.
In an embodiment, to capture the state bits from the data storage circuits, the processing unit configures the data storage circuits to form a scan chain and shift the state bits from the data storage circuits into the temporary memory circuit. In an embodiment, to restore the state bits from the temporary memory circuit to the data storage circuits, the processing unit is configured to shift the state bits from the temporary memory circuit into the data storage circuits.
Methods and apparatuses are disclosed for targeted fault injection to provide assessment of resilience in a GPU. A fault injection causes a specific circuit level state error within an otherwise unaltered multi-threaded GPU program. The GPU program can be run normally until a halt condition is satisfied, at which point a state error is injected into the GPU circuitry, and the GPU is subsequently allowed to continue execution of the GPU program. In an embodiment, production scan testing infrastructure within the GPU is augmented to facilitate state error injection. The disclosed techniques may be employed to assess a plurality of different, specific state error conditions at any point or points of program execution. For example, large regression tests may be advantageously performed using the disclosed techniques, and especially vulnerable circuit elements may be identified and/or included in the regression tests. Assessments of resilience may be used to engineer more robust applications for a given GPU. Furthermore, assessments of resilience may also be used to identify vulnerable circuits in one device generation and to engineer improved resilience in a subsequent device generation, for example through improved architecture and/or hardware design.
One or more PPUs 300 may be configured to accelerate thousands of High Performance Computing (HPC), data center, and machine learning applications. The PPU 300 may be configured to accelerate numerous deep learning systems and applications including autonomous vehicle platforms, deep learning, high-accuracy speech, image, and 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, and personalized user recommendations, and the like.
As shown in
The NVLink 310 interconnect enables systems to scale and include one or more PPUs 300 combined with one or more CPUs, supports cache coherence between the PPUs 300 and CPUs, and CPU mastering. Data and/or commands may be transmitted by the NVLink 310 through the hub 330 to/from other units of the PPU 300 such as one or more copy engines, a video encoder, a video decoder, a power management unit, etc. (not explicitly shown). The NVLink 310 is described in more detail in conjunction with
The I/O unit 305 is configured to transmit and receive communications (i.e., commands, data, etc.) from a host processor (not shown) over the interconnect 302. The I/O unit 305 may communicate with the host processor directly via the interconnect 302 or through one or more intermediate devices such as a memory bridge. In an embodiment, the I/O unit 305 may communicate with one or more other processors, such as one or more the PPUs 300 via the interconnect 302. In an embodiment, the I/O unit 305 implements a Peripheral Component Interconnect Express (PCIe) interface for communications over a PCIe bus and the interconnect 302 is a PCIe bus. In alternative embodiments, the I/O unit 305 may implement other types of well-known interfaces for communicating with external devices.
The I/O unit 305 decodes packets received via the interconnect 302. In an embodiment, the packets represent commands configured to cause the PPU 300 to perform various operations. The I/O unit 305 transmits the decoded commands to various other units of the PPU 300 as the commands may specify. For example, some commands may be transmitted to the front end unit 315. Other commands may be transmitted to the hub 330 or other units of the PPU 300 such as one or more copy engines, a video encoder, a video decoder, a power management unit, etc. (not explicitly shown). In other words, the I/O unit 305 is configured to route communications between and among the various logical units of the PPU 300.
In an embodiment, a program executed by the host processor encodes a command stream in a buffer that provides workloads to the PPU 300 for processing. A workload may comprise several instructions and data to be processed by those instructions. The buffer is a region in a memory that is accessible (i.e., read/write) by both the host processor and the PPU 300. For example, the I/O unit 305 may be configured to access the buffer in a system memory connected to the interconnect 302 via memory requests transmitted over the interconnect 302. In an embodiment, the host processor writes the command stream to the buffer and then transmits a pointer to the start of the command stream to the PPU 300. The front end unit 315 receives pointers to one or more command streams. The front end unit 315 manages the one or more streams, reading commands from the streams and forwarding commands to the various units of the PPU 300.
The front end unit 315 is coupled to a scheduler unit 320 that configures the various GPCs 350 to process tasks defined by the one or more streams. The scheduler unit 320 is configured to track state information related to the various tasks managed by the scheduler unit 320. The state may indicate which GPC 350 a task is assigned to, whether the task is active or inactive, a priority level associated with the task, and so forth. The scheduler unit 320 manages the execution of a plurality of tasks on the one or more GPCs 350.
The scheduler unit 320 is coupled to a work distribution unit 325 that is configured to dispatch tasks for execution on the GPCs 350. The work distribution unit 325 may track a number of scheduled tasks received from the scheduler unit 320. In an embodiment, the work distribution unit 325 manages a pending task pool and an active task pool for each of the GPCs 350. The pending task pool may comprise a number of slots (e.g., 32 slots) that contain tasks assigned to be processed by a particular GPC 350. The active task pool may comprise a number of slots (e.g., 4 slots) for tasks that are actively being processed by the GPCs 350. As a GPC 350 finishes the execution of a task, that task is evicted from the active task pool for the GPC 350 and one of the other tasks from the pending task pool is selected and scheduled for execution on the GPC 350. If an active task has been idle on the GPC 350, such as while waiting for a data dependency to be resolved, then the active task may be evicted from the GPC 350 and returned to the pending task pool while another task in the pending task pool is selected and scheduled for execution on the GPC 350.
The work distribution unit 325 communicates with the one or more GPCs 350 via XBar 370. The XBar 370 is an interconnect network that couples many of the units of the PPU 300 to other units of the PPU 300. For example, the XBar 370 may be configured to couple the work distribution unit 325 to a particular GPC 350. Although not shown explicitly, one or more other units of the PPU 300 may also be connected to the XBar 370 via the hub 330.
The tasks are managed by the scheduler unit 320 and dispatched to a GPC 350 by the work distribution unit 325. The GPC 350 is configured to process the task and generate results. The results may be consumed by other tasks within the GPC 350, routed to a different GPC 350 via the XBar 370, or stored in the memory 304. The results can be written to the memory 304 via the partition units 380, which implement a memory interface for reading and writing data to/from the memory 304. The results can be transmitted to another PPU 304 or CPU via the NVLink 310. In an embodiment, the PPU 300 includes a number U of partition units 380 that is equal to the number of separate and distinct memory devices 304 coupled to the PPU 300. A partition unit 380 will be described in more detail below in conjunction with
In an embodiment, a host processor executes a driver kernel that implements an application programming interface (API) that enables one or more applications executing on the host processor to schedule operations for execution on the PPU 300. In an embodiment, multiple compute applications are simultaneously executed by the PPU 300 and the PPU 300 provides isolation, quality of service (QoS), and independent address spaces for the multiple compute applications. An application may generate instructions (i.e., API calls) that cause the driver kernel to generate one or more tasks for execution by the PPU 300. The driver kernel outputs tasks to one or more streams being processed by the PPU 300. Each task may comprise one or more groups of related threads, referred to herein as a warp. In an embodiment, a warp comprises 32 related threads that may be executed in parallel. Cooperating threads may refer to a plurality of threads including instructions to perform the task and that may exchange data through shared memory. Threads and cooperating threads are described in more detail in conjunction with
In an embodiment, the operation of the GPC 350 is controlled by the pipeline manager 410. The pipeline manager 410 manages the configuration of the one or more DPCs 420 for processing tasks allocated to the GPC 350. In an embodiment, the pipeline manager 410 may configure at least one of the one or more DPCs 420 to implement at least a portion of a graphics rendering pipeline. For example, a DPC 420 may be configured to execute a vertex shader program on the programmable streaming multiprocessor (SM) 440. The pipeline manager 410 may also be configured to route packets received from the work distribution unit 325 to the appropriate logical units within the GPC 350. For example, some packets may be routed to fixed function hardware units in the PROP 415 and/or raster engine 425 while other packets may be routed to the DPCs 420 for processing by the primitive engine 435 or the SM 440. In an embodiment, the pipeline manager 410 may configure at least one of the one or more DPCs 420 to implement a neural network model and/or a computing pipeline.
The PROP unit 415 is configured to route data generated by the raster engine 425 and the DPCs 420 to a Raster Operations (ROP) unit, described in more detail in conjunction with
The raster engine 425 includes a number of fixed function hardware units configured to perform various raster operations. In an embodiment, the raster engine 425 includes a setup engine, a coarse raster engine, a culling engine, a clipping engine, a fine raster engine, and a tile coalescing engine. The setup engine receives transformed vertices and generates plane equations associated with the geometric primitive defined by the vertices. The plane equations are transmitted to the coarse raster engine to generate coverage information (e.g., an x,y coverage mask for a tile) for the primitive. The output of the coarse raster engine is transmitted to the culling engine where fragments associated with the primitive that fail a z-test are culled, and transmitted to a clipping engine where fragments lying outside a viewing frustum are clipped. Those fragments that survive clipping and culling may be passed to the fine raster engine to generate attributes for the pixel fragments based on the plane equations generated by the setup engine. The output of the raster engine 425 comprises fragments to be processed, for example, by a fragment shader implemented within a DPC 420.
Each DPC 420 included in the GPC 350 includes an M-Pipe Controller (MPC) 430, a primitive engine 435, and one or more SMs 440. The MPC 430 controls the operation of the DPC 420, routing packets received from the pipeline manager 410 to the appropriate units in the DPC 420. For example, packets associated with a vertex may be routed to the primitive engine 435, which is configured to fetch vertex attributes associated with the vertex from the memory 304. In contrast, packets associated with a shader program may be transmitted to the SM 440.
The SM 440 comprises a programmable streaming processor that is configured to process tasks represented by a number of threads. Each SM 440 is multi-threaded and configured to execute a plurality of threads (e.g., 32 threads) from a particular group of threads concurrently. In an embodiment, the SM 440 implements a SIMD (Single-Instruction, Multiple-Data) architecture where each thread in a group of threads (i.e., a warp) is configured to process a different set of data based on the same set of instructions. All threads in the group of threads execute the same instructions. In another embodiment, the SM 440 implements a SIMT (Single-Instruction, Multiple Thread) architecture where each thread in a group of threads is configured to process a different set of data based on the same set of instructions, but where individual threads in the group of threads are allowed to diverge during execution. In an 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 the warp diverge. In another 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. When execution state is maintained for each individual thread, threads executing the same instructions may be converged and executed in parallel for maximum efficiency. The SM 440 will be described in more detail below in conjunction with
The MMU 490 provides an interface between the GPC 350 and the partition unit 380. The MMU 490 may provide translation of virtual addresses into physical addresses, memory protection, and arbitration of memory requests. In an embodiment, the MMU 490 provides one or more translation lookaside buffers (TLBs) for performing translation of virtual addresses into physical addresses in the memory 304.
In an embodiment, the memory interface 470 implements an HBM2 memory interface and Y equals half U. In an embodiment, the HBM2 memory stacks are located on the same physical package as the PPU 300, providing substantial power and area savings compared with conventional GDDR5 SDRAM systems. In an embodiment, each HBM2 stack includes four memory dies and Y equals 4, with HBM2 stack including two 128-bit channels per die for a total of 8 channels and a data bus width of 1024 bits.
In an embodiment, the memory 304 supports Single-Error Correcting Double-Error Detecting (SECDED) Error Correction Code (ECC) to protect data. ECC provides higher reliability for compute applications that are sensitive to data corruption. Reliability is especially important in large-scale cluster computing environments where PPUs 300 process very large datasets and/or run applications for extended periods.
In an embodiment, the PPU 300 implements a multi-level memory hierarchy. In an embodiment, the memory partition unit 380 supports a unified memory to provide a single unified virtual address space for CPU and PPU 300 memory, enabling data sharing between virtual memory systems. In an embodiment the frequency of accesses by a PPU 300 to memory located on other processors is traced to ensure that memory pages are moved to the physical memory of the PPU 300 that is accessing the pages more frequently. In an embodiment, the NVLink 310 supports address translation services allowing the PPU 300 to directly access a CPU's page tables and providing full access to CPU memory by the PPU 300.
In an embodiment, copy engines transfer data between multiple PPUs 300 or between PPUs 300 and CPUs. The copy engines can generate page faults for addresses that are not mapped into the page tables. The memory partition unit 380 can then service the page faults, mapping the addresses into the page table, after which the copy engine can perform the transfer. In a conventional system, memory is pinned (i.e., non-pageable) for multiple copy engine operations between multiple processors, substantially reducing the available memory. With hardware page faulting, addresses can be passed to the copy engines without worrying if the memory pages are resident, and the copy process is transparent.
Data from the memory 304 or other system memory may be fetched by the memory partition unit 380 and stored in the L2 cache 460, which is located on-chip and is shared between the various GPCs 350. As shown, each memory partition unit 380 includes a portion of the L2 cache 460 associated with a corresponding memory device 304. Lower level caches may then be implemented in various units within the GPCs 350. For example, each of the SMs 440 may implement a level one (L1) cache. The L1 cache is private memory that is dedicated to a particular SM 440. Data from the L2 cache 460 may be fetched and stored in each of the L1 caches for processing in the functional units of the SMs 440. The L2 cache 460 is coupled to the memory interface 470 and the XBar 370.
The ROP unit 450 performs graphics raster operations related to pixel color, such as color compression, pixel blending, and the like. The ROP unit 450 also implements depth testing in conjunction with the raster engine 425, receiving a depth for a sample location associated with a pixel fragment from the culling engine of the raster engine 425. The depth is tested against a corresponding depth in a depth buffer for a sample location associated with the fragment. If the fragment passes the depth test for the sample location, then the ROP unit 450 updates the depth buffer and transmits a result of the depth test to the raster engine 425. It will be appreciated that the number of partition units 380 may be different than the number of GPCs 350 and, therefore, each ROP unit 450 may be coupled to each of the GPCs 350. The ROP unit 450 tracks packets received from the different GPCs 350 and determines which GPC 350 that a result generated by the ROP unit 450 is routed to through the Xbar 370. Although the ROP unit 450 is included within the memory partition unit 380 in
As described above, the work distribution unit 325 dispatches tasks for execution on the GPCs 350 of the PPU 300. The tasks are allocated to a particular DPC 420 within a GPC 350 and, if the task is associated with a shader program, the task may be allocated to an SM 440. The scheduler unit 510 receives the tasks from the work distribution unit 325 and manages instruction scheduling for one or more thread blocks assigned to the SM 440. The scheduler unit 510 schedules thread blocks for execution as warps of parallel threads, where each thread block is allocated at least one warp. In an embodiment, each warp executes 32 threads. The scheduler unit 510 may manage a plurality of different thread blocks, allocating the warps to the different thread blocks and then dispatching instructions from the plurality of different cooperative groups to the various functional units (i.e., cores 550, SFUs 552, and LSUs 554) during each clock cycle.
Cooperative Groups is a programming model for organizing groups of communicating threads that allows developers to express the granularity at which threads are communicating, enabling the expression of richer, more efficient parallel decompositions. Cooperative launch APIs support synchronization amongst thread blocks for the execution of parallel algorithms. Conventional programming models provide a single, simple construct for synchronizing cooperating threads: a barrier across all threads of a thread block (i.e., the syncthreads( ) function). However, programmers would often like to define groups of threads at smaller than thread block granularities and synchronize within the defined groups to enable greater performance, design flexibility, and software reuse in the form of collective group-wide function interfaces.
Cooperative Groups enables programmers to define groups of threads explicitly at sub-block (i.e., as small as a single thread) and multi-block granularities, and to perform collective operations such as synchronization on the threads in a cooperative group. The 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. Cooperative Groups primitives enable new patterns of cooperative parallelism, including producer-consumer parallelism, opportunistic parallelism, and global synchronization across an entire grid of thread blocks.
A dispatch unit 515 is configured to transmit instructions to one or more of the functional units. In the embodiment, the scheduler unit 510 includes two dispatch units 515 that enable two different instructions from the same warp to be dispatched during each clock cycle. In alternative embodiments, each scheduler unit 510 may include a single dispatch unit 515 or additional dispatch units 515.
Each SM 440 includes a register file 520 that provides a set of registers for the functional units of the SM 440. In an embodiment, the register file 520 is divided between each of the functional units such that each functional unit is allocated a dedicated portion of the register file 520. In another embodiment, the register file 520 is divided between the different warps being executed by the SM 440. The register file 520 provides temporary storage for operands connected to the data paths of the functional units.
Each SM 440 comprises L processing cores 550. In an embodiment, the SM 440 includes a large number (e.g., 128, etc.) of distinct processing cores 550. Each core 550 may include a fully-pipelined, single-precision, double-precision, and/or mixed precision processing unit that includes a floating point arithmetic logic unit and an integer arithmetic logic unit. In an embodiment, the floating point arithmetic logic units implement the IEEE 754-2008 standard for floating point arithmetic. In an embodiment, the cores 550 include 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 configured to perform matrix operations, and, in an embodiment, one or more tensor cores are included in the cores 550. In particular, the tensor cores are configured to perform deep learning matrix arithmetic, such as convolution operations for neural network training and inferencing. In an embodiment, each tensor core operates on a 4×4 matrix and performs a matrix multiply and accumulate operation D=A×B+C, where A, B, C, and D are 4×4 matrices.
In an embodiment, the matrix multiply inputs A and B are 16-bit floating point matrices, while the accumulation matrices C and D may be 16-bit floating point or 32-bit floating point matrices. Tensor Cores operate on 16-bit floating point input data with 32-bit floating point accumulation. The 16-bit floating point multiply requires 64 operations and results in a full precision product that is then accumulated using 32-bit floating point addition with the other intermediate products for a 4×4×4 matrix multiply. In practice, Tensor Cores are used to perform much larger two-dimensional or higher dimensional matrix operations, built up from these smaller elements. 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. At the CUDA level, the warp-level interface assumes 16×16 size matrices spanning all 32 threads of the warp.
Each SM 440 also comprises M SFUs 552 that perform special functions (e.g., attribute evaluation, reciprocal square root, and the like). In an embodiment, the SFUs 552 may include a tree traversal unit configured to traverse a hierarchical tree data structure. In an embodiment, the SFUs 552 may include texture unit configured to perform texture map filtering operations. In an embodiment, the texture units are configured to load texture maps (e.g., a 2D array of texels) from the memory 304 and sample the texture maps to produce sampled texture values for use in shader programs executed by the SM 440. In an embodiment, the texture maps are stored in the shared memory/L1 cache 470. The texture units implement texture operations such as filtering operations using mip-maps (i.e., texture maps of varying levels of detail). In an embodiment, each SM 340 includes two texture units. In an embodiment, at least one of SFUs 552 is configured to include at least one instance of texture map unit 200.
Each SM 440 also comprises N LSUs 554 that implement load and store operations between the shared memory/L1 cache 570 and the register file 520. Each SM 440 includes an interconnect network 580 that connects each of the functional units to the register file 520 and the LSU 554 to the register file 520, shared memory/L1 cache 570. In an embodiment, the interconnect network 580 is a crossbar that can be configured to connect any of the functional units to any of the registers in the register file 520 and connect the LSUs 554 to the register file and memory locations in shared memory/L1 cache 570.
The shared memory/L1 cache 570 is an array of on-chip memory that allows for data storage and communication between the SM 440 and the primitive engine 435 and between threads in the SM 440. In an embodiment, the shared memory/L1 cache 570 comprises 128 KB of storage capacity and is in the path from the SM 440 to the partition unit 380. The shared memory/L1 cache 570 can be used to cache reads and writes. One or more of the shared memory/L1 cache 570, L2 cache 460, and memory 304 are backing stores.
Combining data cache and shared memory functionality into a single memory block provides the best overall performance for both types of memory accesses. The capacity is usable as a cache by programs that do not use shared memory. For example, if shared memory is configured to use half of the capacity, texture and load/store operations can use the remaining capacity. Integration within the shared memory/L1 cache 570 enables the shared memory/L1 cache 570 to function as a high-throughput conduit for streaming data while simultaneously providing high-bandwidth and low-latency access to frequently reused data.
When configured for general purpose parallel computation, a simpler configuration can be used compared with graphics processing. Specifically, the fixed function graphics processing units shown in
The PPU 300 may be included in 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 the like. In an embodiment, the PPU 300 is embodied on a single semiconductor substrate. In another embodiment, the PPU 300 is included in a system-on-a-chip (SoC) along with one or more other devices such as additional PPUs 300, the memory 204, a reduced instruction set computer (RISC) CPU, a memory management unit (MMU), a digital-to-analog converter (DAC), and the like.
In an embodiment, the PPU 300 may be included on a graphics card that includes one or more memory devices 304. The graphics card may be configured to interface with a PCIe slot on a motherboard of a desktop computer. In yet another embodiment, the PPU 300 may be an integrated graphics processing unit (iGPU) or parallel processor included in the chipset of the motherboard.
Systems with multiple GPUs and CPUs are used in a variety of industries as developers expose and leverage more parallelism in applications such as artificial intelligence computing. High-performance GPU-accelerated systems with tens to many thousands of compute nodes are deployed in data centers, research facilities, and supercomputers to solve ever larger problems. As the number of processing devices within the high-performance systems increases, the communication and data transfer mechanisms need to scale to support the increased
In another embodiment (not shown), the NVLink 310 provides one or more high-speed communication links between each of the PPUs 300 and the CPU 530 and the switch 510 interfaces between the interconnect 302 and each of the PPUs 300. The PPUs 300, memories 304, and interconnect 302 may be situated on a single semiconductor platform to form a parallel processing module 525. In yet another embodiment (not shown), the interconnect 302 provides one or more communication links between each of the PPUs 300 and the CPU 530 and the switch 510 interfaces between each of the PPUs 300 using the NVLink 310 to provide one or more high-speed communication links between the PPUs 300. In another embodiment (not shown), the NVLink 310 provides one or more high-speed communication links between the PPUs 300 and the CPU 530 through the switch 510. In yet another embodiment (not shown), the interconnect 302 provides one or more communication links between each of the PPUs 300 directly. One or more of the NVLink 310 high-speed communication links may be implemented as a physical NVLink interconnect or either an on-chip or on-die interconnect using the same protocol as the NVLink 310.
In the context of the present description, a single semiconductor platform may refer to a sole unitary semiconductor-based integrated circuit fabricated on a die or chip. It should be noted that the term single semiconductor platform may also refer to multi-chip modules with increased connectivity which simulate on-chip operation and make substantial improvements over utilizing a conventional bus implementation. Of course, the various circuits or devices may also be situated separately or in various combinations of semiconductor platforms per the desires of the user. Alternately, the parallel processing module 525 may be implemented as a circuit board substrate and each of the PPUs 300 and/or memories 304 may be packaged devices. In an embodiment, the CPU 530, switch 510, and the parallel processing module 525 are situated on a single semiconductor platform.
In an embodiment, the signaling rate of each NVLink 310 is 20 to 25 Gigabits/second and each PPU 300 includes six NVLink 310 interfaces (as shown in
In an embodiment, the NVLink 310 allows direct load/store/atomic access from the CPU 530 to each PPU's 300 memory 304. In an embodiment, the NVLink 310 supports coherency operations, allowing data read from the memories 304 to be stored in the cache hierarchy of the CPU 530, reducing cache access latency for the CPU 530. In an embodiment, the NVLink 310 includes support for Address Translation Services (ATS), allowing the PPU 300 to directly access page tables within the CPU 530. One or more of the NVLinks 310 may also be configured to operate in a low-power mode.
As shown, a system 565 is provided including at least one central processing unit 530 that is connected to a communication bus 575. The communication bus 575 may be implemented using any suitable protocol, such as PCI (Peripheral Component Interconnect), PCI-Express, AGP (Accelerated Graphics Port), HyperTransport, or any other bus or point-to-point communication protocol(s). The system 565 also includes a main memory 540. Control logic (software) and data are stored in the main memory 540 which may take the form of random access memory (RAM).
The system 565 also includes input devices 560, the parallel processing system 525, and display devices 545, i.e. a conventional CRT (cathode ray tube), LCD (liquid crystal display), LED (light emitting diode), plasma display or the like. User input may be received from the input devices 560, e.g., keyboard, mouse, touchpad, microphone, and the like. Each of the foregoing modules and/or devices may even be situated on a single semiconductor platform to form the system 565. Alternately, the various modules may also be situated separately or in various combinations of semiconductor platforms per the desires of the user.
Further, the system 565 may be coupled to a network (e.g., a telecommunications network, local area network (LAN), wireless network, wide area network (WAN) such as the Internet, peer-to-peer network, cable network, or the like) through a network interface 535 for communication purposes.
The system 565 may also include a secondary storage (not shown). The secondary storage 610 includes, for example, a hard disk drive and/or a removable storage drive, representing a floppy disk drive, a magnetic tape drive, a compact disk drive, digital versatile disk (DVD) drive, recording device, universal serial bus (USB) flash memory. The removable storage drive reads from and/or writes to a removable storage unit in a well-known manner.
Computer programs, or computer control logic algorithms, may be stored in the main memory 540 and/or the secondary storage. Such computer programs, when executed, enable the system 565 to perform various functions. The memory 540, the storage, and/or any other storage are possible examples of computer-readable media.
The architecture and/or functionality of the various previous figures may be implemented in the context of a general computer system, a circuit board system, a game console system dedicated for entertainment purposes, an application-specific system, and/or any other desired system. For example, the system 565 may take the 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, workstation, game consoles, embedded system, and/or any other type of logic.
In an embodiment, the PPU 300 comprises a graphics processing unit (GPU). The PPU 300 is configured to receive commands that specify shader programs for processing graphics data. Graphics data may be defined as a set of primitives such as points, lines, triangles, quads, triangle strips, and the like. Typically, a primitive includes data that specifies a number of vertices for the primitive (e.g., in a model-space coordinate system) as well as attributes associated with each vertex of the primitive. The PPU 300 can be configured to process the graphics primitives to generate a frame buffer (i.e., pixel data for each of the pixels of the display).
An application writes model data for a scene (i.e., a collection of vertices and attributes) to a memory such as a system memory or memory 304. The model data defines each of the objects that may be visible on a display. The application then makes an API call to the driver kernel that requests the model data to be rendered and displayed. The driver kernel reads the model data and writes commands to the one or more streams to perform operations to process the model data. The commands may reference different shader programs to be implemented on the SMs 440 of the PPU 300 including one or more of a vertex shader, hull shader, domain shader, geometry shader, and a pixel shader. For example, one or more of the SMs 440 may be configured to execute a vertex shader program that processes a number of vertices defined by the model data. In an embodiment, the different SMs 440 may be configured to execute different shader programs concurrently. For example, a first subset of SMs 440 may be configured to execute a vertex shader program while a second subset of SMs 440 may be configured to execute a pixel shader program. The first subset of SMs 440 processes vertex data to produce processed vertex data and writes the processed vertex data to the L2 cache 460 and/or the memory 304. After the processed vertex data is rasterized (i.e., transformed from three-dimensional data into two-dimensional data in screen space) to produce fragment data, the second subset of SMs 440 executes a pixel shader to produce processed fragment data, which is then blended with other processed fragment data and written to the frame buffer in memory 304. The vertex shader program and pixel shader program may execute concurrently, processing different data from the same scene in a pipelined fashion until all of the model data for the scene has been rendered to the frame buffer. Then, the contents of the frame buffer are transmitted to a display controller for display on a display device.
As shown in
The data assembly stage 610 receives the input data 601 that specifies vertex data for high-order surfaces, primitives, or the like. The data assembly stage 610 collects the vertex data in a temporary storage or queue, such as by receiving a command from the host processor that includes a pointer to a buffer in memory and reading the vertex data from the buffer. The vertex data is then transmitted to the vertex shading stage 620 for processing.
The vertex shading stage 620 processes vertex data by performing a set of operations (i.e., a vertex shader or a program) once for each of the vertices. Vertices may be, e.g., specified as a 4-coordinate vector (i.e., <x, y, z, w>) associated with one or more vertex attributes (e.g., color, texture coordinates, surface normal, etc.). The vertex shading stage 620 may manipulate individual vertex attributes such as position, color, texture coordinates, and the like. In other words, the vertex shading stage 620 performs operations on the vertex coordinates or other vertex attributes associated with a vertex. Such operations commonly including lighting operations (i.e., modifying color attributes for a vertex) and transformation operations (i.e., modifying the coordinate space for a vertex). For example, vertices may be specified using coordinates in an object-coordinate space, which are transformed by multiplying the coordinates by a matrix that translates the coordinates from the object-coordinate space into a world space or a normalized-device-coordinate (NCD) space. The vertex shading stage 620 generates transformed vertex data that is transmitted to the primitive assembly stage 630.
The primitive assembly stage 630 collects vertices output by the vertex shading stage 620 and groups the vertices into geometric primitives for processing by the geometry shading stage 640. For example, the primitive assembly stage 630 may be configured to group every three consecutive vertices as a geometric primitive (i.e., a triangle) for transmission to the geometry shading stage 640. In some embodiments, specific vertices may be reused for consecutive geometric primitives (e.g., two consecutive triangles in a triangle strip may share two vertices). The primitive assembly stage 630 transmits geometric primitives (i.e., a collection of associated vertices) to the geometry shading stage 640.
The geometry shading stage 640 processes geometric primitives by performing a set of operations (i.e., a geometry shader or program) on the geometric primitives. Tessellation operations may generate one or more geometric primitives from each geometric primitive. In other words, the geometry shading stage 640 may subdivide each geometric primitive into a finer mesh of two or more geometric primitives for processing by the rest of the graphics processing pipeline 600. The geometry shading stage 640 transmits geometric primitives to the viewport SCC stage 650.
In an embodiment, the graphics processing pipeline 600 may operate within a streaming multiprocessor and the vertex shading stage 620, the primitive assembly stage 630, the geometry shading stage 640, the fragment shading stage 670, and/or hardware/software associated therewith, may sequentially perform processing operations. Once the sequential processing operations are complete, in an embodiment, the viewport SCC stage 650 may utilize the data. In an embodiment, primitive data processed by one or more of the stages in the graphics processing pipeline 600 may be written to a cache (e.g. L1 cache, a vertex cache, etc.). In this case, in an embodiment, the viewport SCC stage 650 may access the data in the cache. In an embodiment, the viewport SCC stage 650 and the rasterization stage 660 are implemented as fixed function circuitry.
The viewport SCC stage 650 performs viewport scaling, culling, and clipping of the geometric primitives. Each surface being rendered to is associated with an abstract camera position. The camera position represents a location of a viewer looking at the scene and defines a viewing frustum that encloses the objects of the scene. The viewing frustum may include a viewing plane, a rear plane, and four clipping planes. Any geometric primitive entirely outside of the viewing frustum may be culled (i.e., discarded) because the geometric primitive will not contribute to the final rendered scene. Any geometric primitive that is partially inside the viewing frustum and partially outside the viewing frustum may be clipped (i.e., transformed into a new geometric primitive that is enclosed within the viewing frustum. Furthermore, geometric primitives may each be scaled based on a depth of the viewing frustum. All potentially visible geometric primitives are then transmitted to the rasterization stage 660.
The rasterization stage 660 converts the 3D geometric primitives into 2D fragments (e.g. capable of being utilized for display, etc.). The rasterization stage 660 may be configured to utilize the vertices of the geometric primitives to setup a set of plane equations from which various attributes can be interpolated. The rasterization stage 660 may also compute a coverage mask for a plurality of pixels that indicates whether one or more sample locations for the pixel intercept the geometric primitive. In an embodiment, z-testing may also be performed to determine if the geometric primitive is occluded by other geometric primitives that have already been rasterized. The rasterization stage 660 generates fragment data (i.e., interpolated vertex attributes associated with a particular sample location for each covered pixel) that are transmitted to the fragment shading stage 670.
The fragment shading stage 670 processes fragment data by performing a set of operations (i.e., a fragment shader or a program) on each of the fragments. The fragment shading stage 670 may generate pixel data (i.e., color values) for the fragment such as by performing lighting operations or sampling texture maps using interpolated texture coordinates for the fragment. The fragment shading stage 670 generates pixel data that is transmitted to the raster operations stage 680.
The raster operations stage 680 may perform various operations on the pixel data such as performing alpha tests, stencil tests, and blending the pixel data with other pixel data corresponding to other fragments associated with the pixel. When the raster operations stage 680 has finished processing the pixel data (i.e., the output data 602), the pixel data may be written to a render target such as a frame buffer, a color buffer, or the like.
It will be appreciated that one or more additional stages may be included in the graphics processing pipeline 600 in addition to or in lieu of one or more of the stages described above. Various implementations of the abstract graphics processing pipeline may implement different stages. Furthermore, one or more of the stages described above may be excluded from the graphics processing pipeline in some embodiments (such as the geometry shading stage 640). Other types of graphics processing pipelines are contemplated as being within the scope of the present disclosure. Furthermore, any of the stages of the graphics processing pipeline 600 may be implemented by one or more dedicated hardware units within a graphics processor such as PPU 300. Other stages of the graphics processing pipeline 600 may be implemented by programmable hardware units such as the SM 440 of the PPU 300.
The graphics processing pipeline 600 may be implemented via an application executed by a host processor, such as a CPU. In an embodiment, a device driver may implement an application programming interface (API) that defines various functions that can be utilized by an application in order to generate graphical data for display. The device driver is a software program that includes a plurality of instructions that control the operation of the PPU 300. The API provides an abstraction for a programmer that lets a programmer utilize specialized graphics hardware, such as the PPU 300, to generate the graphical data without requiring the programmer to utilize the specific instruction set for the PPU 300. The application may include an API call that is routed to the device driver for the PPU 300. The device driver interprets the API call and performs various operations to respond to the API call. In some instances, the device driver may perform operations by executing instructions on the CPU. In other instances, the device driver may perform operations, at least in part, by launching operations on the PPU 300 utilizing an input/output interface between the CPU and the PPU 300. In an embodiment, the device driver is configured to implement the graphics processing pipeline 600 utilizing the hardware of the PPU 300.
Various programs may be executed within the PPU 300 in order to implement the various stages of the graphics processing pipeline 600. For example, the device driver may launch a kernel on the PPU 300 to perform the vertex shading stage 620 on one SM 440 (or multiple SMs 440). The device driver (or the initial kernel executed by the PPU 400) may also launch other kernels on the PPU 400 to perform other stages of the graphics processing pipeline 600, such as the geometry shading stage 640 and the fragment shading stage 670. In addition, some of the stages of the graphics processing pipeline 600 may be implemented on fixed unit hardware such as a rasterizer or a data assembler implemented within the PPU 400. It will be appreciated that results from one kernel may be processed by one or more intervening fixed function hardware units before being processed by a subsequent kernel on an SM 440.
While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. Thus, the breadth and scope of the present application should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following and later-submitted claims and their equivalents.
This application is a continuation of U.S. Non-Provisional application Ser. No. 17/143,968 titled “Fault Injection Architecture For Resilient GPU Computing,” filed Jan. 7, 2021, which is a continuation of U.S. Pat. No. 10,922,203 titled “Fault Injection Architecture For Resilient GPU Computing,” filed Sep. 21, 2018, the entire contents of which is incorporated herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 3784801 | Caputo | Jan 1974 | A |
| 3848262 | Belcastro | Nov 1974 | A |
| 3988714 | Bardotti | Oct 1976 | A |
| 4181940 | Underwood | Jan 1980 | A |
| 4503535 | Budde | Mar 1985 | A |
| 4866712 | Chao | Sep 1989 | A |
| 4964126 | Musicus | Oct 1990 | A |
| 4996687 | Hess | Feb 1991 | A |
| 4999837 | Reynolds | Mar 1991 | A |
| 5008885 | Huang | Apr 1991 | A |
| 5046068 | Kubo | Sep 1991 | A |
| 5153881 | Bruckert | Oct 1992 | A |
| 5193181 | Barlow | Mar 1993 | A |
| 5269016 | Butler | Dec 1993 | A |
| 5325517 | Baker | Jun 1994 | A |
| 5428624 | Blair | Jun 1995 | A |
| 5450573 | Gronemeyer | Sep 1995 | A |
| 5872910 | Kuslak | Feb 1999 | A |
| 5943490 | Sample | Aug 1999 | A |
| 5960191 | Sample | Sep 1999 | A |
| 6147663 | Smith | Nov 2000 | A |
| 6205567 | Maruyama | Mar 2001 | B1 |
| 6282587 | Priem | Aug 2001 | B1 |
| 6442722 | Nadeau-Dostie | Aug 2002 | B1 |
| 6484276 | Singh | Nov 2002 | B1 |
| 6536008 | Nadeau-Dostie | Mar 2003 | B1 |
| 6560720 | Chirashnya | May 2003 | B1 |
| 6647516 | Rust | Nov 2003 | B1 |
| 6728668 | Kitamorn | Apr 2004 | B1 |
| 6751756 | Hartnett | Jun 2004 | B1 |
| 6886116 | MacLellan | Apr 2005 | B1 |
| 7020803 | Wolin | Mar 2006 | B2 |
| 7284159 | Chakraborty | Oct 2007 | B2 |
| 7320114 | Jain | Jan 2008 | B1 |
| 7404107 | Burk | Jul 2008 | B2 |
| 7444551 | Johnson | Oct 2008 | B1 |
| 7467289 | Garlick | Dec 2008 | B1 |
| 7472051 | Mariani | Dec 2008 | B2 |
| 7493434 | Abramovici | Feb 2009 | B1 |
| 7496788 | Alfieri | Feb 2009 | B1 |
| 7512773 | Shebanow | Mar 2009 | B1 |
| 7536605 | Keaffaber et al. | May 2009 | B2 |
| 7555692 | Iacobovici | Jun 2009 | B1 |
| 7600155 | Nickolls | Oct 2009 | B1 |
| 7627787 | Johnson et al. | Dec 2009 | B1 |
| 7669095 | Clark et al. | Feb 2010 | B2 |
| 7711990 | Nickolls | May 2010 | B1 |
| 7739556 | Duluk, Jr. | Jun 2010 | B1 |
| 7765186 | Hu | Jul 2010 | B1 |
| 7779238 | Kosche | Aug 2010 | B2 |
| 7802147 | Johnson et al. | Sep 2010 | B1 |
| 7827445 | Foster, Sr. et al. | Nov 2010 | B2 |
| 7983893 | Durand et al. | Jul 2011 | B2 |
| 8046639 | Nordin | Oct 2011 | B1 |
| 8095829 | Coon | Jan 2012 | B1 |
| 8127181 | Shebanow | Feb 2012 | B1 |
| 8176355 | Crowell | May 2012 | B2 |
| 8181100 | Purdham | May 2012 | B1 |
| 8301980 | Gruner et al. | Oct 2012 | B2 |
| 8321495 | Bailey | Nov 2012 | B2 |
| 8365015 | Yu | Jan 2013 | B1 |
| 8386834 | Goel | Feb 2013 | B1 |
| 8473273 | Durand et al. | Jun 2013 | B2 |
| 8516303 | Gomyo | Aug 2013 | B2 |
| 8572573 | Baliga et al. | Oct 2013 | B2 |
| 8640114 | Kosche | Jan 2014 | B2 |
| 8645766 | Masser et al. | Feb 2014 | B2 |
| 8645797 | Yigzaw | Feb 2014 | B2 |
| 8650447 | Wortman et al. | Feb 2014 | B1 |
| 8689206 | Dow et al. | Apr 2014 | B2 |
| 8690325 | Straus | Apr 2014 | B1 |
| 8752027 | Noureddine et al. | Jun 2014 | B2 |
| 8762951 | Kosche | Jun 2014 | B1 |
| 8813055 | Kosche | Aug 2014 | B2 |
| 8863094 | Song | Oct 2014 | B2 |
| 8886994 | Czajkowski | Nov 2014 | B2 |
| 8954797 | Busaba | Feb 2015 | B2 |
| 8954806 | Dan | Feb 2015 | B2 |
| 8954807 | Ma | Feb 2015 | B2 |
| 8984372 | Gandhi | Mar 2015 | B2 |
| 8997039 | Andrade | Mar 2015 | B2 |
| 9053216 | Coleman | Jun 2015 | B1 |
| 9063906 | Busaba et al. | Jun 2015 | B2 |
| 9092312 | Meaney et al. | Jul 2015 | B2 |
| 9208043 | Tseng et al. | Dec 2015 | B1 |
| 9208064 | Fry{hacek over (c)} et al. | Dec 2015 | B2 |
| 9264021 | Jarrar | Feb 2016 | B1 |
| 9275429 | Alla | Mar 2016 | B2 |
| 9368169 | Malladi | Jun 2016 | B2 |
| 9389977 | Jang | Jul 2016 | B2 |
| 9407715 | Parmar | Aug 2016 | B2 |
| 9424150 | Jerzak | Aug 2016 | B2 |
| 9448895 | North | Sep 2016 | B2 |
| 9459997 | Curley et al. | Oct 2016 | B2 |
| 9529653 | Bose | Dec 2016 | B2 |
| 9588845 | Henry | Mar 2017 | B2 |
| 9607714 | Malladi | Mar 2017 | B2 |
| 9639474 | Duluk, Jr. et al. | May 2017 | B2 |
| 9678816 | Rugina | Jun 2017 | B2 |
| 9690736 | Ma | Jun 2017 | B2 |
| 9823745 | Fateh | Nov 2017 | B1 |
| 9823964 | Reed et al. | Nov 2017 | B2 |
| 9824772 | Malladi | Nov 2017 | B2 |
| 9830224 | Giroux | Nov 2017 | B2 |
| 9891917 | Hastie et al. | Feb 2018 | B2 |
| 9928128 | Barrick | Mar 2018 | B2 |
| 10049006 | Reed | Aug 2018 | B2 |
| 10062429 | Borole | Aug 2018 | B1 |
| 10162005 | Alzheimer | Dec 2018 | B1 |
| 10168879 | Duan | Jan 2019 | B1 |
| 10216521 | Shirvani et al. | Feb 2019 | B2 |
| 10235254 | Fukuda | Mar 2019 | B2 |
| 10248488 | Ould-Ahmed-Vall | Apr 2019 | B2 |
| 10248521 | Catherwood et al. | Apr 2019 | B2 |
| 10267677 | Sarkar | Apr 2019 | B1 |
| 10324816 | Barak | Jun 2019 | B2 |
| 10409730 | Buschardt | Sep 2019 | B2 |
| 10430356 | Rashid et al. | Oct 2019 | B2 |
| 10437637 | Koneru | Oct 2019 | B1 |
| 10452797 | Smith | Oct 2019 | B2 |
| 10473934 | Samec et al. | Nov 2019 | B2 |
| 10489520 | Cho et al. | Nov 2019 | B2 |
| 10691572 | Bramley et al. | Jun 2020 | B2 |
| 10747926 | Xiang | Aug 2020 | B2 |
| 10922203 | Alben | Feb 2021 | B1 |
| 10997043 | Kato et al. | May 2021 | B2 |
| 11099974 | Sastry | Aug 2021 | B2 |
| 11301350 | Byrne | Apr 2022 | B1 |
| 11495315 | Zou | Nov 2022 | B1 |
| 20010044912 | Francis | Nov 2001 | A1 |
| 20020039325 | Aizawa | Apr 2002 | A1 |
| 20020144175 | Long | Oct 2002 | A1 |
| 20020152420 | Chaudhry | Oct 2002 | A1 |
| 20030061535 | Bickel | Mar 2003 | A1 |
| 20040103328 | Ichien | May 2004 | A1 |
| 20040153756 | Tsukahara | Aug 2004 | A1 |
| 20040230861 | Bailey | Nov 2004 | A1 |
| 20040255185 | Fujiyama | Dec 2004 | A1 |
| 20050027970 | Arnold | Feb 2005 | A1 |
| 20050134800 | Kim | Jun 2005 | A1 |
| 20050149781 | Lempel | Jul 2005 | A1 |
| 20050188281 | Nguyen | Aug 2005 | A1 |
| 20050261557 | Baker | Nov 2005 | A1 |
| 20060023633 | Caruk | Feb 2006 | A1 |
| 20060041814 | Rajski | Feb 2006 | A1 |
| 20060179207 | Eisen | Aug 2006 | A1 |
| 20060224906 | Habib | Oct 2006 | A1 |
| 20060271825 | Keaffaber | Nov 2006 | A1 |
| 20070022318 | Copenhaver | Jan 2007 | A1 |
| 20070168722 | de Almeida | Jul 2007 | A1 |
| 20070174679 | Chelstrom et al. | Jul 2007 | A1 |
| 20080107361 | Asukai | May 2008 | A1 |
| 20080115005 | Kamada | May 2008 | A1 |
| 20080126766 | Chheda | May 2008 | A1 |
| 20080126828 | Girouard | May 2008 | A1 |
| 20080126830 | Balazich | May 2008 | A1 |
| 20080129839 | Asukai et al. | Jun 2008 | A1 |
| 20080163255 | Munoz | Jul 2008 | A1 |
| 20080193011 | Hayashi et al. | Aug 2008 | A1 |
| 20080270859 | Mikami | Oct 2008 | A1 |
| 20090096807 | Silverstein | Apr 2009 | A1 |
| 20090112204 | Aronow | Apr 2009 | A1 |
| 20090150732 | Jung | Jun 2009 | A1 |
| 20090164846 | Foster, Sr. | Jun 2009 | A1 |
| 20090177459 | Durand | Jul 2009 | A1 |
| 20090187741 | Greenhalgh | Jul 2009 | A1 |
| 20090240996 | Sasaya | Sep 2009 | A1 |
| 20090249175 | Chandra et al. | Oct 2009 | A1 |
| 20090259899 | Ludewig | Oct 2009 | A1 |
| 20100005366 | Dell | Jan 2010 | A1 |
| 20100049268 | Martins | Feb 2010 | A1 |
| 20100065349 | Ichikawa | Mar 2010 | A1 |
| 20100088542 | Greb | Apr 2010 | A1 |
| 20100185838 | Chen | Jul 2010 | A1 |
| 20100185909 | Li | Jul 2010 | A1 |
| 20100245536 | Huitema | Sep 2010 | A1 |
| 20100251017 | Yamada et al. | Sep 2010 | A1 |
| 20100265820 | Feng | Oct 2010 | A1 |
| 20110029191 | Macri | Feb 2011 | A1 |
| 20110047411 | Gille | Feb 2011 | A1 |
| 20110055646 | Mukherjee | Mar 2011 | A1 |
| 20110055777 | Tremaine et al. | Mar 2011 | A1 |
| 20110167310 | Tung | Jul 2011 | A1 |
| 20120057785 | Morovic | Mar 2012 | A1 |
| 20120117419 | Hillman | May 2012 | A1 |
| 20120239993 | Chung | Sep 2012 | A1 |
| 20120254698 | Ozer | Oct 2012 | A1 |
| 20130007549 | Chan | Jan 2013 | A1 |
| 20130090745 | Frazer | Apr 2013 | A1 |
| 20130151930 | Yigzaw | Jun 2013 | A1 |
| 20130212445 | Doerr | Aug 2013 | A1 |
| 20130219238 | Tekumalla | Aug 2013 | A1 |
| 20130275810 | Yigzaw et al. | Oct 2013 | A1 |
| 20130304996 | Venkataraman | Nov 2013 | A1 |
| 20130318323 | Weissmann | Nov 2013 | A1 |
| 20130318535 | Sun | Nov 2013 | A1 |
| 20140019818 | Jindal | Jan 2014 | A1 |
| 20140025991 | Anandavally | Jan 2014 | A1 |
| 20140035650 | Zerbe | Feb 2014 | A1 |
| 20140063037 | Danielsson | Mar 2014 | A1 |
| 20140075244 | Takahashi | Mar 2014 | A1 |
| 20140089734 | Busaba et al. | Mar 2014 | A1 |
| 20140097877 | Baeckler | Apr 2014 | A1 |
| 20140181421 | O'Connor | Jun 2014 | A1 |
| 20140189427 | Jayaprakash Bharadwaj | Jul 2014 | A1 |
| 20140239987 | Mayer et al. | Aug 2014 | A1 |
| 20140258684 | Hastie et al. | Sep 2014 | A1 |
| 20140281424 | Bobba | Sep 2014 | A1 |
| 20140344623 | Han | Nov 2014 | A1 |
| 20140351797 | Kalayci | Nov 2014 | A1 |
| 20140372823 | Dimri | Dec 2014 | A1 |
| 20140380085 | Rash | Dec 2014 | A1 |
| 20150021923 | Huang et al. | Jan 2015 | A1 |
| 20150046677 | Moloney | Feb 2015 | A1 |
| 20150067426 | Nardini | Mar 2015 | A1 |
| 20150074473 | Unesaki | Mar 2015 | A1 |
| 20150082001 | Duncan | Mar 2015 | A1 |
| 20150082101 | Lee | Mar 2015 | A1 |
| 20150089294 | Bell | Mar 2015 | A1 |
| 20150095699 | Shirano | Apr 2015 | A1 |
| 20150095721 | Beskrovny | Apr 2015 | A1 |
| 20150120009 | Killian | Apr 2015 | A1 |
| 20150137862 | Bahl | May 2015 | A1 |
| 20150206272 | Perelygin | Jul 2015 | A1 |
| 20150212923 | Sugiyama | Jul 2015 | A1 |
| 20150234693 | Palframan et al. | Aug 2015 | A1 |
| 20150261593 | Bergmann | Sep 2015 | A1 |
| 20150270697 | Satheesh | Sep 2015 | A1 |
| 20150286544 | Kadri | Oct 2015 | A1 |
| 20150318058 | Curley et al. | Nov 2015 | A1 |
| 20150326155 | Mohammed | Nov 2015 | A1 |
| 20150350580 | Sato | Dec 2015 | A1 |
| 20150363252 | Singh | Dec 2015 | A1 |
| 20150378859 | Jang | Dec 2015 | A1 |
| 20160003907 | Rasjki | Jan 2016 | A1 |
| 20160085605 | Shimbo | Mar 2016 | A1 |
| 20160098330 | Mu | Apr 2016 | A1 |
| 20160110274 | Ito | Apr 2016 | A1 |
| 20160179667 | Kumar | Jun 2016 | A1 |
| 20160224449 | Noyes | Aug 2016 | A1 |
| 20160240008 | Haddick | Aug 2016 | A1 |
| 20160246665 | Stolfo | Aug 2016 | A1 |
| 20160270656 | Samec | Sep 2016 | A1 |
| 20160292059 | Catherwood et al. | Oct 2016 | A1 |
| 20160334467 | Cho | Nov 2016 | A1 |
| 20160334868 | Pacheco | Nov 2016 | A1 |
| 20160360167 | Mitchell | Dec 2016 | A1 |
| 20170004647 | Grossman | Jan 2017 | A1 |
| 20170025091 | Haddick | Jan 2017 | A1 |
| 20170083422 | Cheng et al. | Mar 2017 | A1 |
| 20170090940 | Gschwind | Mar 2017 | A1 |
| 20170103157 | Hutton | Apr 2017 | A1 |
| 20170115338 | Chadalavda et al. | Apr 2017 | A1 |
| 20170153791 | Kolli | Jun 2017 | A1 |
| 20170154480 | Takahashi | Jun 2017 | A1 |
| 20170220774 | Orbach | Aug 2017 | A1 |
| 20170242745 | Sherlock | Aug 2017 | A1 |
| 20170269807 | Nugent | Sep 2017 | A1 |
| 20170269871 | Khan | Sep 2017 | A1 |
| 20170293356 | Khaderi | Oct 2017 | A1 |
| 20170308425 | Hicks | Oct 2017 | A1 |
| 20170329623 | Dong | Nov 2017 | A1 |
| 20170337664 | Grahn | Nov 2017 | A1 |
| 20170338647 | Xiang | Nov 2017 | A1 |
| 20170344438 | Bilgiday | Nov 2017 | A1 |
| 20180059183 | Maeda | Mar 2018 | A1 |
| 20180129573 | Iturbe | May 2018 | A1 |
| 20180174664 | Byeon | Jun 2018 | A1 |
| 20180174665 | Kraipak | Jun 2018 | A1 |
| 20180182161 | Chaudhari et al. | Jun 2018 | A1 |
| 20180197313 | Chakravorty | Jul 2018 | A1 |
| 20180203713 | Elfering | Jul 2018 | A1 |
| 20180217204 | Huang | Aug 2018 | A1 |
| 20180252768 | Rajski | Sep 2018 | A1 |
| 20180286105 | Surti | Oct 2018 | A1 |
| 20180293122 | Craske | Oct 2018 | A1 |
| 20180293780 | Maiyuran | Oct 2018 | A1 |
| 20180299921 | Rajwani | Oct 2018 | A1 |
| 20180300931 | Vembu | Oct 2018 | A1 |
| 20180302064 | Borole | Oct 2018 | A1 |
| 20180304151 | Hicks | Oct 2018 | A1 |
| 20180307485 | Appu | Oct 2018 | A1 |
| 20180307633 | Koker | Oct 2018 | A1 |
| 20180308204 | Parikh et al. | Oct 2018 | A1 |
| 20180308212 | Veernapu | Oct 2018 | A1 |
| 20180314431 | Rashid | Nov 2018 | A1 |
| 20180315398 | Kaul | Nov 2018 | A1 |
| 20180321938 | Boswell | Nov 2018 | A1 |
| 20180331676 | Arp | Nov 2018 | A1 |
| 20180348298 | Bhagwat | Dec 2018 | A1 |
| 20180349600 | Elenes | Dec 2018 | A1 |
| 20180357001 | Scheer | Dec 2018 | A1 |
| 20180365017 | Shirvani | Dec 2018 | A1 |
| 20190010227 | Sun | Jan 2019 | A1 |
| 20190012222 | Sherlock | Jan 2019 | A1 |
| 20190033366 | Huang | Jan 2019 | A1 |
| 20190049914 | Munafo | Feb 2019 | A1 |
| 20190052280 | Perez | Feb 2019 | A1 |
| 20190065338 | Bramley | Feb 2019 | A1 |
| 20190079826 | Gianisis | Mar 2019 | A1 |
| 20190102242 | Sullivan | Apr 2019 | A1 |
| 20190102271 | Matsukawa | Apr 2019 | A1 |
| 20190113572 | Bose | Apr 2019 | A1 |
| 20190121689 | Jeyapaul | Apr 2019 | A1 |
| 20190149485 | Shino | May 2019 | A1 |
| 20190163255 | Dewey | May 2019 | A1 |
| 20190187207 | Pillay | Jun 2019 | A1 |
| 20190188391 | Margalit | Jun 2019 | A1 |
| 20190205233 | Jung | Jul 2019 | A1 |
| 20190220222 | Ware | Jul 2019 | A1 |
| 20190220745 | Huang | Jul 2019 | A1 |
| 20190220776 | Huang | Jul 2019 | A1 |
| 20190227121 | Azam | Jul 2019 | A1 |
| 20190228831 | Bedarida | Jul 2019 | A1 |
| 20190235940 | Kegel | Aug 2019 | A1 |
| 20190235941 | Bath | Aug 2019 | A1 |
| 20190237151 | Cho | Aug 2019 | A1 |
| 20190250210 | Sun | Aug 2019 | A1 |
| 20190286214 | Pabalkar | Sep 2019 | A1 |
| 20190286511 | Rol | Sep 2019 | A1 |
| 20190294467 | Yamada | Sep 2019 | A1 |
| 20190303260 | Ozer | Oct 2019 | A1 |
| 20190303300 | Boyd | Oct 2019 | A1 |
| 20190339328 | Xiang | Nov 2019 | A1 |
| 20190348139 | Waldrop | Nov 2019 | A1 |
| 20190361786 | Arai | Nov 2019 | A1 |
| 20200008862 | Le | Jan 2020 | A1 |
| 20200064823 | Somercik | Feb 2020 | A1 |
| 20200073786 | Schat | Mar 2020 | A1 |
| 20200081785 | Chen | Mar 2020 | A1 |
| 20200084437 | Feekes | Mar 2020 | A1 |
| 20200088862 | Lundberg | Mar 2020 | A1 |
| 20200096569 | Mishaeli | Mar 2020 | A1 |
| 20200097209 | Zhou | Mar 2020 | A1 |
| 20200132759 | Shen | Apr 2020 | A1 |
| 20200142795 | Kato | May 2020 | A1 |
| 20200159635 | Song | May 2020 | A1 |
| 20200167223 | Cho | May 2020 | A1 |
| 20200175157 | Wilding | Jun 2020 | A1 |
| 20200183819 | Fiege | Jun 2020 | A1 |
| 20200200820 | Strasser | Jun 2020 | A1 |
| 20200217259 | Ogawa | Jul 2020 | A1 |
| 20200218808 | Hershman | Jul 2020 | A1 |
| 20200233030 | Flores | Jul 2020 | A1 |
| 20200241985 | Zhang | Jul 2020 | A1 |
| 20200290533 | Dürkop | Sep 2020 | A1 |
| 20200319987 | Yang | Oct 2020 | A1 |
| 20210033669 | Cheng | Feb 2021 | A1 |
| 20210156918 | Mrugalski | May 2021 | A1 |
| 20210157699 | Alben | May 2021 | A1 |
| 20210357299 | Wilson, Jr. | Nov 2021 | A1 |
| 20220043062 | Cheng | Feb 2022 | A1 |
| 20220100599 | Abuelela | Mar 2022 | A1 |
| 20220100645 | Paterson-Jones | Mar 2022 | A1 |
| 20220138066 | Gaur | May 2022 | A1 |
| Number | Date | Country |
|---|---|---|
| 0388526 | Jan 1996 | EP |
| 2015107611 | Jul 2015 | WO |
| Entry |
|---|
| Fang et al., “A Systematic Methodology for Evaluating the Error Resilience of GPGPU Applications,” Preprint, IEEE Transactions on Parallel and Distributed Systems, vol. 27, No. 12, Mar. 7, 2016, pp. 3397-3411. |
| Previlon et al., “Evaluating the Impact of Execution Parameters on Program Vulnerability in GPU Applications,” Preprint, Design, Automation & Test in Europe Conference and Exhibition, Apr. 23, 2018, pp. 809-814. |
| Tselonis et al., “GUFI: a Framework for GPUs Reliability Assessment,” Preprint, 2016 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), Jun. 2, 2016, pp. 90-100. |
| Li et al., “Software-based Dynamic Reliability Management for GPU Applications,” Preprint, 2016 IEEE International Reliability Physics Symposium (IRPS), Sep. 26, 2016, 7 pp. |
| Tselonis et al., “The Functional and Performance Tolerance of GPUs to Permanent Faults in Registers,” Preprint, 2013 IEEE 19th International On-Line Testing Symposium (IOLTS), Jul. 8-10, 2013, pp. 236-239. |
| Fang et al., “GPU-Qin: A Methodology for Evaluating the Error Resilience of GPGPU Applications,” Preprint, 2014 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), Jun. 26, 2014, 10 pp. |
| Yim et al., “Hauberk: Lightweight Silent Data Corruption Error Detector for GPGPU,” Preprint, Parallel & Distributed Processing Symposium (IPDPS), 2011 IEEE International, Sep. 8, 2011, pp. 287-300. |
| Fang, “Error Resilience Evaluation on GPGPU Applications,” Master of Software Systems, The University of British Columbia (Vancouver). A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Applied Science in the Faculty of Graduate and Postdoctoral Studies (Electrical and Computer Engineering), Aug. 2014, 72 pp. |
| Number | Date | Country | |
|---|---|---|---|
| 20220156169 A1 | May 2022 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 17143968 | Jan 2021 | US |
| Child | 17591481 | US | |
| Parent | 16138747 | Sep 2018 | US |
| Child | 17143968 | US |
