Patent Application
20240273666
This disclosure relates generally to computer graphics processors and more particularly to techniques for distributing processing work to graphics sub-units.
Given their growing compute capabilities, graphics processing units (GPUs) are now being used extensively for large-scale workloads. Workloads may include vertex shader, fragment shader, and compute tasks, for example. APIs such as Metal and OpenCL give software developers an interface to access the compute power of the GPU for their applications. In recent times, software developers have been moving substantial portions of their applications to using the GPU. As process technologies shrink and GPUs become more powerful, they may contain large numbers of shader cores. Software or firmware may provide units of work to be performed, referred to as “kicks.” Data controller circuitry (e.g., a compute data controller, vertex data controller, and pixel data controller) may distribute work from these kicks to multiple replicated shader cores, e.g., over a communications fabric. As the number of shaders scales, work distribution and scheduling techniques may substantially affect performance and power consumption.
Section I of this disclosure covers various techniques relating to logical kickslots and distribution of work from logical kickslots to distributed hardware.
Generally, Section I describes techniques relating to virtualization for sets of graphics work referred to as “kicks.” Software may provide kicks to a graphics processing unit (GPU), which may utilize virtual/logical kickslot techniques to distribute a kick across all or a subset of multiple GPU sub-units for distributed processing (these sub-units may be referred to as “mGPUs”).
Section II describes various embodiments with various alternatives or additions to the techniques of Section I. As one example, fine-grained virtual kickslot scheduling may assign a given kick to an arbitrary number of mGPUs. As another example, start-when-ready embodiments may allow portions of a kick to begin as soon as one or more mGPUs are available (e.g., before the total number of mGPUs to be used by the kick are available).
Further, while Section I sets out top slot techniques for allowing software to program kicks, disclosed streaming kickslot manager (S-KSM) techniques allow software to program various queues of kicks in memory. The kickslot manager may then pull kicks from the queues into top slots using queue select logic (which may be configured to pull only work that it is likely to be able to run in the near future). These techniques may reduce software overhead from scheduling GPU work, pack more work into the GPU faster, and provide hardware with a wider pool of work from which to select kicks. Further, the GPU may utilize multiple completion queues with different priorities, which may allow software to perform completion processing quickly for higher-priority work. This may advantageously improve GPU performance on certain processing workloads, particularly workloads with large numbers of relatively short kicks.
Further, disclosed embodiments arbitrate to select kicks from queues, e.g., based on various parameters such as: queue priorities, queue dependencies, the primary controller associated with kicks (e.g., compute, vertex, or pixel controllers), queue deadlines, available resources, etc. This may also allow software to be further decoupled from the hardware implementation (e.g., top slot details), relative to the embodiments described in Section I.
Disclosed S-KSM techniques may enable various additional functionality, e.g., allowing the GPU to enqueue work for itself, allowing playback of pre-encoded streams of work (e.g., from longer-term storage such as a hard drive), etc.
Section II also discusses interrupt suppression techniques for completed work (e.g., allowing software to control what happens when a GPU completes a kick), kick queue remapping (e.g., pausing selection from a first queue and redirecting to another queue on which the first queue depends), and event flags (e.g., that specify various conditions that should be met before a given kick starts). These techniques may allow software to stream work into the GPU in a flexible manner while providing GPU hardware with information that is useful for efficient scheduling. More generally, event flags may allow fine-grained streaming (e.g., of image portions) across various components of a device, e.g., in system-on-a-chip implementations.
Disclosed techniques also provide efficient and scalable processing of geometry kicks. Geometry kicks may be pre-parsed, segmented into multiple portions based on the pre-parsing, separately processed, and then stitched for completion. For example, slot-based techniques may be utilized to distribute pre-processing work, kick execution, stitching work, or some combination thereof.
Finally, section II also discusses techniques for pipelining portions of kicks even in the presence of inter-kick dependencies. Disclosed techniques may improve performance by covering all or a portion of spin-up, spin-down, or both for certain kicks.
Referring to
Referring now to
Vertex pipe 185, in the illustrated embodiment, may include various fixed-function hardware configured to process vertex data. Vertex pipe 185 may be configured to communicate with programmable shader 160 in order to coordinate vertex processing. In the illustrated embodiment, vertex pipe 185 is configured to send processed data to fragment pipe 175 or programmable shader 160 for further processing.
Fragment pipe 175, in the illustrated embodiment, may include various fixed-function hardware configured to process pixel data. Fragment pipe 175 may be configured to communicate with programmable shader 160 in order to coordinate fragment processing. Fragment pipe 175 may be configured to perform rasterization on polygons from vertex pipe 185 or programmable shader 160 to generate fragment data. Vertex pipe 185 and fragment pipe 175 may be coupled to memory interface 180 (coupling not shown) in order to access graphics data.
Programmable shader 160, in the illustrated embodiment, is configured to receive vertex data from vertex pipe 185 and fragment data from fragment pipe 175 and TPU 165. Programmable shader 160 may be configured to perform vertex processing tasks on vertex data which may include various transformations and adjustments of vertex data. Programmable shader 160, in the illustrated embodiment, is also configured to perform fragment processing tasks on pixel data such as texturing and shading, for example. Programmable shader 160 may include multiple sets of multiple execution pipelines for processing data in parallel.
In some embodiments, programmable shader includes pipelines configured to execute one or more different SIMD groups in parallel. Each pipeline may include various stages configured to perform operations in a given clock cycle, such as fetch, decode, issue, execute, etc. The concept of a processor “pipeline” is well understood, and refers to the concept of splitting the “work” a processor performs on instructions into multiple stages. In some embodiments, instruction decode, dispatch, execution (i.e., performance), and retirement may be examples of different pipeline stages. Many different pipeline architectures are possible with varying orderings of elements/portions. Various pipeline stages perform such steps on an instruction during one or more processor clock cycles, then pass the instruction or operations associated with the instruction on to other stages for further processing.
The term “SIMD group” is intended to be interpreted according to its well-understood meaning, which includes a set of threads for which processing hardware processes the same instruction in parallel using different input data for the different threads. SIMD groups may also be referred to as SIMT (single-instruction, multiple-thread groups), single instruction parallel thread (SIPT), or lane-stacked threads. Various types of computer processors may include sets of pipelines configured to execute SIMD instructions. For example, graphics processors often include programmable shader cores that are configured to execute instructions for a set of related threads in a SIMD fashion. Other examples of names that may be used for a SIMD group include: a wavefront, a clique, or a warp. A SIMD group may be a part of a larger thread group, which may be broken up into a number of SIMD groups based on the parallel processing capabilities of a computer. In some embodiments, each thread is assigned to a hardware pipeline (which may be referred to as a “lane”) that fetches operands for that thread and performs the specified operations in parallel with other pipelines for the set of threads. Note that processors may have a large number of pipelines such that multiple separate SIMD groups may also execute in parallel. In some embodiments, each thread has private operand storage, e.g., in a register file. Thus, a read of a particular register from the register file may provide the version of the register for each thread in a SIMD group.
As used herein, the term “thread” includes its well-understood meaning in the art and refers to sequence of program instructions that can be scheduled for execution independently of other threads. Multiple threads may be included in a SIMD group to execute in lock-step. Multiple threads may be included in a task or process (which may correspond to a computer program). Threads of a given task may or may not share resources such as registers and memory. Thus, context switches may or may not be performed when switching between threads of the same task.
In some embodiments, multiple programmable shaders 160 are included in a GPU. In these embodiments, global control circuitry may assign work to the different sub-portions of the GPU which may in turn assign work to shader cores to be processed by shader pipelines.
TPU 165, in the illustrated embodiment, is configured to schedule fragment processing tasks from programmable shader 160. In some embodiments, TPU 165 is configured to pre-fetch texture data and assign initial colors to fragments for further processing by programmable shader 160 (e.g., via memory interface 180). TPU 165 may be configured to provide fragment components in normalized integer formats or floating-point formats, for example. In some embodiments, TPU 165 is configured to provide fragments in groups of four (a “fragment quad”) in a 2×2 format to be processed by a group of four execution pipelines in programmable shader 160.
Image write buffer 170, in some embodiments, is configured to store processed tiles of an image and may perform operations to a rendered image before it is transferred for display or to memory for storage. In some embodiments, graphics unit 150 is configured to perform tile-based deferred rendering (TBDR). In tile-based rendering, different portions of the screen space (e.g., squares or rectangles of pixels) may be processed separately. Memory interface 180 may facilitate communications with one or more of various memory hierarchies in various embodiments.
As discussed above, graphics processors typically include specialized circuitry configured to perform certain graphics processing operations requested by a computing system. This may include fixed-function vertex processing circuitry, pixel processing circuitry, or texture sampling circuitry, for example. Graphics processors may also execute non-graphics compute tasks that may use GPU shader cores but may not use fixed-function graphics hardware. As one example, machine learning workloads (which may include inference, training, or both) are often assigned to GPUs because of their parallel processing capabilities. Thus, compute kernels executed by the GPU may include program instructions that specify machine learning tasks such as implementing neural network layers or other aspects of machine learning models to be executed by GPU shaders. In some scenarios, non-graphics workloads may also utilize specialized graphics circuitry, e.g., for a different purpose than originally intended.
Further, various circuitry and techniques discussed herein with reference to graphics processors may be implemented in other types of processors in other embodiments. Other types of processors may include general-purpose processors such as CPUs or machine learning or artificial intelligence accelerators with specialized parallel processing capabilities. These other types of processors may not be configured to execute graphics instructions or perform graphics operations. For example, other types of processors may not include fixed-function hardware that is included in typical GPUs. Machine learning accelerators may include specialized hardware for certain operations such as implementing neural network layers or other aspects of machine learning models. Speaking generally, there may be design tradeoffs between the memory requirements, computation capabilities, power consumption, and programmability of machine learning accelerators. Therefore, different implementations may focus on different performance goals. Developers may select from among multiple potential hardware targets for a given machine learning application, e.g., from among generic processors, GPUs, and different specialized machine learning accelerators.
Primary control circuitry 210 may be a compute data master, vertex data master, or pixel data master, for example. Therefore, in some embodiments, a graphics processor includes multiple instances of primary control circuitry 210 which send different types of work to the same set of sub-units. Primary control circuitry 210 may receive kicks via an interface from software, firmware, or both. As used herein, the term “software” broadly refers to executable program instructions and encompasses firmware, operating systems, and third-party applications, for example. Therefore, it should be understood that various references to software herein may apply alternatively or additionally to firmware. Primary control circuitry 210, in the illustrated embodiment, includes logical slot to distributed hardware slot mapping control circuitry 215. Control circuitry 215 may distribute work from logical slots (which may be referred to as “kickslots”) to distributed hardware slots on all or a portion of the graphics processor (e.g., according to different distribution modes discussed below with reference to
Various circuitry is described herein as controlling logical slots. The term “logical” means that assignment of work to the logical slot does not imply which hardware will actually execute the graphics instructions of the assigned work. The control circuitry may include hardware that maintains information for a logical slot and assigns work from the logical slot to hardware slots for actual execution. Thus, upon initial assignment to a logical slot, the hardware slots that will execute the set of work are not known. As discussed in detail below, logical slots may provide various advantages in terms of performance and power consumption when scheduling graphics work, particularly in a graphics processor with multiple shader cores.
Multiple “kicks” may be executed to render a frame of graphics data. In some embodiments, a kick is a unit of work from a single context that may include multiple threads to be executed (and may potentially include other types of graphics work that is not performed by a shader). A kick may not provide any assurances regarding memory synchronization among threads (other than specified by the threads themselves), concurrency among threads, or launch order among threads. In some embodiments, a kick may be identified as dependent on the results of another kick, which may allow memory synchronization without requiring hardware memory coherency support. Typically, graphics firmware or hardware programs configuration registers for each kick before sending the work to pipeline(s) for processing. Often, once a kick has started, it does not access a memory hierarchy past a certain level until the kick is finished (at which point results may be written to another level in the hierarchy). Information for a given kick may include state information, location of shader program(s) to execute, buffer information, location of texture data, available address spaces, etc. that are needed to complete the corresponding graphics operations. Graphics firmware or hardware may schedule kicks and detect an interrupt when a kick is complete, for example. In some embodiments, portions of a graphics unit are configured to work on a single kick at a time. As discussed in detail herein, tracking slots (also referred to as “top slots”) and logical kickslots may be used to control kicks before assigning kicks to shader hardware. A kick may include a set of one or more rendering commands, which may include a command to draw procedural geometry, a command to set a shadow sampling method, a command to draw meshes, a command to retrieve a texture, a command to perform generation computation, etc. A kick may be executed at one of various stages during the rendering of a frame. Examples of rendering stages include, without limitation: camera rendering, light rendering, projection, texturing, fragment shading, etc. Kicks may be scheduled for compute work, vertex work, or pixel work, for example.
Sub-units 220, in some embodiments, are scaling units that may be replicated to increase the processing capabilities of a GPU. Each GPU sub-unit 220 may be capable of independently processing instructions of a graphics program. Sub-units 220, in the illustrated embodiment, include circuitry that implements respective distributed hardware slots 230. These hardware slots may also be referred to herein as “dSlots.” Each sub-unit may include multiple hardware slots 230. Sub-units may also be referred to herein as “mGPUs.” In some embodiments, primary control circuitry 210 assigns work from a logical slot to at most one distributed hardware slot in each sub-unit 220. In some embodiments, each sub-unit includes fragment generator circuitry, shader core circuitry configured to execute shader programs, memory system circuitry (which may include one or more caches and a memory management unit), geometry processing circuitry, and distributed workload distribution circuitry (which may coordinate with primary control circuitry 210 to distribute work to shader pipelines).
Each distributed hardware slot may include various circuitry configured to process an assigned kick or portion thereof, including configuration registers, a work queue, circuitry configured to iterate through work in the queue (e.g., batches of compute work items), circuitry to sequence context loads/stores, and work distribution tracking circuitry. Each sub-unit 220 may include multiple shaders that accept work from distributed slots in the sub-unit and use pipelines to execute the work. For example, each shader may include a queue for each distributed hardware slot and may select work from among the queues based on work priority.
In some embodiments, a given sub-unit 220 includes multiple programmable shaders 160 of
As discussed in detail below, logical slot to distributed hardware slot mapping control circuitry 215 may distribute kicks across sub-units 220 based on various parameters, software control inputs, etc.
In the illustrated embodiment, mGPUs 320A-320N are grouped and primary control circuitry 210 communicates with multiple such groups. mGPUs are an example of sub-units 220. Each group of mGPUs 305, in the illustrated embodiment, shares a cache 360. This may be a level 2 cache, e.g., in embodiments in which each mGPU 320 maintains a level 1 cache. This shared cache may be used to store instructions, data, or both. As discussed in detail below, scheduling work with data affinity properties to the same group 305 may be beneficial for cache efficiency. In some embodiments, each group of mGPUs 305 is implemented on the same die or semiconductor substrate, e.g., in multi-die implementations.
Each mGPU 320, in the illustrated embodiment, includes distributed control circuitry which may receive work from primary control circuitry 210, assign work within the mGPU, and report work completion back to primary control circuitry 210 (e.g., via a communications fabric). Signals assigning work may not include the actual instruction to perform or data to be operated on, but may identify the location of program instructions to be executed.
Kickslot manager 350, in the illustrated embodiment, is configured to receive kicks from the software/firmware interface and communicate kicks to primary control circuitry 210 for assignment to logical slots. Example communications between kickslot manager 350 and control circuitry are discussed in detail below with reference to
As discussed above, in all three example modes, a logical slot is allowed to occupy at most one hardware slot of a given mGPU. Hardware slots to which work from a logical slot is distributed are shown using diagonal shading in
Mode A, in the illustrated example, is a single-mGPU distribution mode. In this mode, control circuitry 215 assigns work from the logical slot to a single hardware slot on a single mGPU.
Mode B, in the illustrated example, is a single-group distribution mode. In this mode, control circuitry 215 assigns work from the logical slot to a slot on each mGPU in a group of mGPUs (group 0 in this example).
Mode C, in the illustrated example, is a larger multi-group distribution mode. In this mode, control circuitry 215 assigns work from the logical slot to a slot in each mGPU of multiple groups of mGPUs (e.g., every group on the graphics processor, in some embodiments).
Control circuitry 215 may determine the distribution mode for a logical slot (or a portion a kick assigned to a logical slot, e.g., for a kernel) based on various considerations discussed in detail below. Generally, control circuitry 215 may select a distribution mode based on the amount of work that primary control circuitry is managing at a particular time, based on a size of the set of work, or both. Further, software override functionality may allow software or firmware to adjust distribution of work in a kick. Still further, priority, dynamic remapping, and reclaim techniques may affect logical to hardware slot mappings.
Control circuitry 215 may report hardware slot allocations and deallocations to kickslot manager 350, which may allow software or firmware to query information about the current logical slot mappings (e.g., the distribution mode, specific mappings, etc.).
Note that the group/mGPU/hardware slot levels of organization are included for purposes of explanation but are not intended to limit the scope of the present disclosure. In some embodiments, the “group” level of organization may be omitted, which may result in only two distribution modes: single-mGPU or multiple-mGPU. In some embodiments, additional levels of organization may be implemented, which may be associated with additional distribution modes (e.g., a group of groups, which may result in a single-group-of-groups mode and a multiple-group-of-groups mode, in addition to single-mGPU mode and single-group mode).
In the illustrated example, circuitry 215 uses a single-mGPU distribution mode for logical slots 510A, 510D, 510G, and 510I. For example, logical slot 510A receives a single distributed slot DS0 in mGPU 0 of group 0.
Circuitry 215 uses a single-group distribution mode for logical slots 510B, 510E, and 510H. For example, logical slot 510B receives distributed slot DS0 on each mGPU of group 1.
Circuitry 215 uses a multiple-group distribution mode for logical slots 510C and 510F. For example, logical slot 510C receives a distributed slot on each illustrated mGPU.
Note that all hardware slots may not be assigned at all times, but generally, filling available slots may improve performance. When a kick assigned to a logical slot has completed, another kick may be assigned to that logical slot and the logical slot may be remapped to physical slots.
Kickslot manager 350, in the illustrated embodiment, assigns kicks to logical slots and sends kick information to the corresponding control stream processor 630. The control stream processor 630 may inform kickslot manager 350 when the kick has completed processing.
Control stream processors 630, in the illustrated embodiment, manage sequencing of their kickslot, fetch and execute the control stream for a kick, and track kick completion. Control stream processors 630 may operate at kernel granularity (kernels may be fetched from the control stream for a kick). Control stream processors 630 may communicate with dSlot resource allocator 620 to obtain dSlot resources for their logical slot. Control stream processors 630 are configured to determine the distribution mode for kernels and send kernels with their distribution mode and distributed slot assignments to kernel processors 640.
dSlot resource allocator (DRA) 620, in some embodiments, includes circuitry configured to receive requests from multiple logical slots and process the requests to assign dSlots to kernels. In some embodiments, dSlot resource allocator 620 selects a distribution mode and assigns dSlots for portions of a kick (e.g., at kernel granularity), although other granularities are contemplated. In some embodiments, dSlot resource allocator 620 first assigns logical slots based on kick priority and then assigns based on kick age, as discussed in further detail below. For example, DRA 620 may reserve some distributed slots for kernels from kicks with a priority level greater than a threshold.
Kernel processors 640, in the illustrated embodiment, are included in a primary compute data master. Kernel processors 640 are configured to create batches of workgroups from kernels and send batches with their distribution mode and distributed slot assignment to mGPU assign circuitry 650. Kernel processors 640 may select batches for distribution based on affinity, load balancing, or both, as discussed in detail below. Kernel processors 640 may receive an indication of assigned dSlots and a target mask which indicates which mGPUs are allowed to be targeted by the kernel.
As used herein, the term “compute kernel” in the graphics context is intended to be interpreted according to its well-understood meaning, which includes a routine compiled for acceleration hardware such as a graphics processor. Kernels may be specified by a separate program language such as OpenCL C, may be written as compute shaders in a shading language such as OpenGL, or embedded in application code in a high level language, for example. Compute kernels typically include a number of workgroups which in turn include a number of work items (also referred to as threads). Note that various techniques discussed herein with reference to compute kernels may be applied to other types of work such as vertex or pixel processing tasks.
mGPU assign circuitry 650, in the illustrated embodiment, receives batches and sends batches to target mGPUs. Circuitry 650 may receive a batch along with a mask of allowable mGPU targets, which may be a function of the distribution mode. Using that mask, circuitry 650 may select an mGPU target based on load balancing.
Kickslot arbiter 660, in the illustrated embodiment, selects from among available batches to send to destination mGPUs. For example, kickslot arbiter 660 may select one or more logical kickslots to send a batch each cycle. The selected batches (and returning information associated with execution status) may be transmitted via a communications fabric. The fabric may be dedicated to control signaling, e.g., as discussed in U.S. patent application Ser. No. 17/158,943, filed Jan. 26, 2021 and titled “Shared Control Bus for Graphics Processors.”
Various additional functionality performed by the circuitry of
In some embodiments, per-kernel mapping during execution a compute kick may provide dynamic allocation that would be difficult at kick granularity (it may be difficult to determine how many distributed slots a kick should occupy before executing the kick). As briefly discussed above. the control stream processors 630 and dSlot resource allocator 620 may facilitate these techniques.
The dslot_status, in the illustrated example, is maintained for each dSlot and indicates whether the dSlot is invalid, running, emptied, flushing, or retained. The invalid state indicates that the dSlot is not owned by any logical slot. The running state indicates that the dSlot is owned by a logical slot and is currently executing. The emptied state indicates that the dSlot is owned by a logical slot and is finished executing. The flushing state indicates that the dSlot is owned by a logical slot as is in the process of a cache flush (e.g., a flush-invalidate with the memory hierarchy). The retained state indicates that the dSlot is owned by a logical slot and is being retained after completion of a kernel (e.g., after an end-of-kernel cache flush invalidate), e.g., to preserve performance data. Note that these states are included for purposes of explanation but other states may be implemented, states may be omitted, or both, in other embodiments.
The dslot_owner state, in the illustrated example, is maintained for each dSlot and indicates the logical slot that owns the dSlot. This field is not relevant for the invalid state because no logical slot owns an invalid dSlot.
The per_kernel_residency state, in the illustrated example, is maintained for each kernel and each mGPU and indicates whether the kernel was assigned to the mGPU. Note that various information maintained per-kernel for compute work may similarly be maintained for kicks or portions of kicks for other types of work that does not utilize kernels.
At 810, in the illustrated embodiment, the control circuitry waits until kernel dependencies have cleared and the logical slot assigned to the kick has an idle kernel processor. This allows the preceding kernel to finish iterating before beginning the next kernel for the kick.
At 820, in the illustrated embodiment, the CSP determines a distribution mode and sends a request with the distribution mode to the DRA 620.
At 830, the DRA 620 responds with a distributed slot allocation. Example DRA arbitration algorithms are discussed in detail below.
At 840, in the illustrated example, the primary control circuitry performs several activities. First, it sends a distributed slot start message to all mGPUs on which a dSlot was allocated for the kernel. Next, it sends a register write command to a register copy unit that includes a dSlot mask to indicate which dSlots are affected. The register copy unit writes distributed slot-scoped control registers for the kernel. (The register copy unit may already have written logical-slot-scoped control registers for the kick.) Finally, the primary control circuitry sends work to the indicated mGPUs. Note that the work may be fenced until all register writes by the register copy unit are complete.
The primary control circuitry may also track completion status for every kernel that it distributes. For example, it may detect when the dSlots on which a kernel was executing have all transitioned from running to emptied.
In some embodiments, software may provide various indications to override the default distribution mode for a kernel. This may allow software to parallelize important work rather than risk it being assigned to a single mGPU, for example. Further, this may allow software to assign a kernel to a specific group of mGPUs.
The force group field allows software to select a group on which to execute a kick. This may be specified in conjunction with single mGPU or single group distribution modes, for example. The policy field allows software to specify a scheduling policy for single mGPU or single group distribution. In the illustrated example, software can specify a “select first option” policy (which may be the default) or a round robin policy. The select first option policy may select the first available element (e.g., mGPU or group) according to their index, which may avoid fragmentation and leave more contiguous dSlots free for other slices. The round robin policy may randomize usage of resources which may avoid the location of selected resources causing substantial performance variation but may spread small slices over multiple groups. In other embodiments, various policies may be specified. Detailed examples of arbitration that considers software override fields are discussed below.
In some embodiments, DRA 620 leaves dSlots in the emptied state as long as possible, e.g., to allow a subsequent kernel from the same logical slot to use the dSlot(s). This may reduce cache-flush invalidates and writing of execution configuration registers for newly allocated dSlots. In some embodiments, dSlots in the emptied state that are owned by another logical slot must go through a reclaim process (discussed below with reference to
Generally, as described in detail below, DRA 620 uses the following priority scheme to select a dSlot for a kernel. Highest priority are emptied dSlots already owned by the logical slot. These dSlots have their control registers written and are free for immediate execution. Middle priority are invalid dSlots, which are newly allocated and may need control register writes, but are free for immediate execution. Lowest priority are running dSlots that are already owned by the distributed slot. These dSlots have their control registers written but may require waiting behind another kernel.
At 1012, in the illustrated embodiment, DRA 620 picks an mGPU where the logical slot of the kernel already owns a dSlot in the emptied state. Note that in the case of a tie for elements 1012, 1016, and 1018, DRA 620 uses the determined policy (e.g., default, software-specified, or a single type of policy in some embodiments) to select hardware resources. For example, if there are multiple mGPUs that satisfy element 1012, DRA 620 may apply the policy to select an mGPU. If one or more mGPUs satisfy these criteria, one of them is selected and arbitration ends for that logical slot until the kernel is finished. Otherwise, flow proceeds.
At 1014, in the illustrated embodiment, DRA 620 picks an mGPU with at least one INVALID dSlot where the logical slot does not already own a dSlot. If one or more mGPUs satisfy these criteria, one of them is selected and arbitration ends for that logical slot until the kernel is finished. Otherwise, flow proceeds.
At 1016, in the illustrated embodiment, DRA 620 picks an mGPU with the most invalid slots. If one or more mGPUs satisfy these criteria, one of them is selected and arbitration ends for that logical slot until the kernel is finished. Otherwise, flow proceeds.
At 1018, in the illustrated embodiment, DRA 620 picks an mGPU where the logical slot already owns a hardware slot in the running state. If one or more mGPUs satisfy these criteria, one of them is selected and arbitration ends for that logical slot until the kernel is finished. Otherwise, flow proceeds.
At 1020, in the illustrated embodiment, DRA 620 attempts a reclaim procedure.
Examples of such a procedure are discussed in further detail below with reference to
At 1022, in the illustrated embodiment, DRA 620 restarts the allocation machine and re-arbitrates. For various distribution modes, re-arbitration may occur until a sufficient number of hardware slots are available to satisfy the distribution mode.
At 1032, in the illustrated embodiment, DRA 620 picks a group where all mGPUs in the group have a dSlot owned by the logical slot of the kernel that is in an emptied or invalid state. In the case of a tie, DRA 620 picks the group with the least invalid dSlots. If one or more groups satisfy these criteria, one of them is selected and arbitration ends for that logical slot until the kernel is finished. Otherwise, flow proceeds.
At 1034, in the illustrated embodiment, DRA 620 picks a group where all mGPUs in the group have a dSlot owned by the logical slot that is in a running, invalid, or empty state. In the case of a tie, DRA 620 picks the group with the least mGPUs with a slot in the running state. DRA 620 may apply the policy if there is still a tie. If one or more groups satisfy these criteria, one of them is selected and arbitration ends for that logical slot until the kernel is finished. Otherwise, flow proceeds.
At 1038 and 1040, dRA 620 attempts reclaim and then restarts the allocation machine and re-arbitrates, similarly to elements 1020 and 1022 discussed above.
At 1052, in the illustrated embodiment, DRA 620 performs the operations of elements 1054-1058 for each target mGPU in the set of allowable mGPUs. At 1054, the DRA picks a dSlot that is already owned by the logical slot of the kernel that is in the emptied or running state. If one or more dSlots satisfy these criteria, one of them is selected and arbitration ends for that logical slot until the kernel is finished. Otherwise, flow proceeds.
At 1056, in the illustrated embodiment, the DRA 620 picks an invalid dSlot. If one or more dSlots satisfy these criteria, one of them is selected and arbitration ends for that logical slot until the kernel is finished. Otherwise, flow proceeds. At 1058, in the illustrated embodiment, DRA 620 attempts reclaim.
If the operations of element 1052 are not successful in allocating a dSlot in each mGPU for the kernel, flow proceeds to 1060 and DRA 620 restarts the allocation machine and re-arbitrates.
Note that while various techniques discussed above consider software override fields, in other embodiments software overrides may not be implemented or may be disabled in certain modes of operation. In that case, the DRA may operate as discussed above, but omitting software override considerations.
In some embodiments, control circuitry is configured to allow a logical slot to reclaim a hardware slot that is assigned to another logical slot. In some embodiments, only higher-priority logical slots are allowed to reclaim hardware slots from other logical slots. Example techniques for enforcing logical slot priority are discussed below, but generally the priority may be indicated by software. In some embodiments, only hardware slots in the emptied state are eligible to be reclaimed by another logical slot.
Generally, control circuitry may attempt to keep a hardware slot in the emptied state as long as possible. This may avoid overhead of executing a cache flush-invalidate and writing configuration registers when switching the hardware slot to a new logical slot (because keeping the hardware slot in the emptied state may allow the same logical slot to send another kernel from the same kick to use the hardware slot, which avoids this overhead). Because of this, however, it may improve performance to allow other important logical slots to take such hardware slots.
In the illustrated example, the hold signal has one of three values, although other sets of values are contemplated in other embodiments. The low value indicates that the logical slot has reached a control stream terminate signal for the kick and that there are no kernels left in a kernel queue to process. In this case the logical slot will not require another hardware slot for the kick. The medium value indicates that the logical slot has not reached the control stream terminate, but that there are currently no kernels ready to request hardware slots for execution. The high value indicates that the logical slot has a kernel requesting hardware slots for execution.
In some embodiments, DRA 620 is configured to reclaim slots only if sufficient hardware slots can be reclaimed to satisfy the request. Otherwise, a reclaim attempt may fail. Once reclaim is successful, DRA 620 restarts its state machine and re-arbitrates the logical slot. DRA 620 may initiate a cache flush invalidate with the memory hierarchy for any reclaimed slots. This may transfer those slots to the flushing state, but those slots may become available for arbitration once they are finished flushing and transfer to the invalid state.
At 1120, in the illustrated embodiment, DRA 620 finds all dSlots that are emptied and are owned by a logical slot that (a) is not context storing and (b) does not have any flushing dSlots. It may generate a data structure that indicates the set of dSlots in this allowed_set. If the dSlots in the allowed_set with a low hold value combined with the dSlots in the flushing_set and are sufficient to service the request, DRA 620 reclaims those dSlots and begins the cache flush invalidate for those dSlots. If not, flow proceeds.
At 1130, in the illustrated embodiment, DRA 620 first determines if the request is for a low or high priority logical slot and operates accordingly. Note that other granularities of priority may be supported in other embodiments. For a low-priority requestor, the DRA 620 generates a do_set of slots which are slots in allowed_set with a medium hold value that are owned by a low-priority logical slot. DRA 620 finds dSlots in both the flushing_set and do_set. If these dSlots are sufficient to service the request, DRA 620 reclaims those dSlots and begins the cache flush invalidate for those dSlots. If not, flow proceeds.
For a high-priority requestor, the DRA 620 generates a do_set of slots which are slots in allowed_set with a medium hold value that are owned by a high-priority logical slot. DRA 620 finds dSlots in both the flushing_set and do_set. If these dSlots are sufficient to service the request, DRA 620 reclaims those dSlots and begins the cache flush invalidate for those dSlots. If not, flow proceeds.
At 1140, in the illustrated embodiment, DRA 620 adds slots to the do_set that are in the allowed_set, have a high hold value, and belong to a logical slot with a lower priority and lower age. DRA 620 finds dSlots in both the flushing_set and updated do_set. If these dSlots are sufficient to service the request, DRA 620 reclaims those dSlots and begins the cache flush invalidate for those dSlots. If not, it may cancel reclaim and restart arbitration.
In various embodiments, disclosed techniques may advantageously provide a balance between keeping hardware slots emptied for the current logical slot (to avoid overhead) while still allowing those hardware slots to be reclaimed by other logical slots in certain scenarios.
In some embodiments, control circuitry is configured to retain hardware slots for a logical slot until instructed to release the slots (e.g., by software). This may allow software to query various kick information such as performance registers, memory, or other data affected by kick execution. In some embodiments, each kick includes a retain_slots field (e.g., a bit) that indicates whether the hardware slots that become mapped for the logical slots should wait to be deallocated.
In some embodiments, if a kick with slots retained is assigned to a logical slot, other slots cannot reclaim resources from that logical slot, regardless of priority.
At 1220, in the illustrated example, the kick completes its work and the device performs end of kernel flush processing. The hardware slots remain mapped.
At 1230, the primary control circuitry 210 sends a kick_done signal to the KSM 350. It also transitions the dSlots to the retained state.
At 1240, software or firmware may query performance registers, memory, etc. affected by the kick. At 1250, KSM 350 sends a release_slots signal (e.g., based on a software instruction indicating that querying is complete).
At 1260, the primary control circuitry 210 completes the process of deallocating the hardware slots, which transition to the invalid state and are now available to another logical slot. At 1270, primary control circuitry 210 sends a deallocate message to KSM 350, informing it that deallocation is complete.
In some embodiments, to avoid hang conditions, kicks with slots maintained always use the multi-group distribution mode and cannot be blocked from completing. Therefore, when arbitrating between logical slots with retain and logical slots without retain, logical slots with retain may always have priority. Further, KSM 350 may only schedule up to a threshold number of logical slots with retain set, e.g., corresponding to the number of dSlots per mGPU. In some embodiments, all logical slots with retain set are promoted to high priority.
As briefly discussed above, different logical slots may have different priority levels, e.g., as specified by software. In some embodiments, on a given mGPU, a subset of hardware slots are reserved for logical slots that meets a threshold priority (e.g., higher priority slots in a system with two priority levels).
In some embodiments, high-priority logical slots attempt to use the reserved hardware slots of an mGPU first before attempting to use other slots. In other embodiments, high-priority logical slots may attempt to use all hardware slots of an mGPU equally, e.g., using round-robin techniques.
In some embodiments, low-priority logical slots are not allowed to reclaim hardware slots from high-priority logical slots unless there is no chance that a high-priority logical slot will use them.
In various embodiments, disclosed priority techniques may advantageously allow software to influence the distribution of important work to reduce impediments from less important work.
As discussed above, a cache flush invalidate (CFI) may be performed each time a hardware slot is to be assigned to a new logical slot. Further, primary control circuitry 210 must execute any CFIs included in the control stream for compute kicks. Because hardware slots may be dynamically mapped at kernel level, however, the set of hardware slots to flush for a control stream CFI may not be deterministic. The discussion below provides techniques for handling this phenomenon. In particular, an “unconditional” CFI is introduced that flushes all relevant mGPUs (e.g., all mGPUs in the graphics processor in some implementations).
End of kernel flush control register 1430 may maintain a set of bits indicating which mGPUs to flush at the end of a kernel. Deallocate flush control register 1440 may maintain a set of bits indicating which mGPUs to flush upon dSlot deallocation in the middle of a kick (note that this may be a subset of bits specified by the end of kernel flush).
DRA 620 may implement the following procedure when a dSlot is deallocated. First, if the dSlot is not the last mGPU in the group with a dSlot allocated for the logical slot, DRA 620 uses the deallocate flush control register 1440, which may potentially flush-invalidate a smaller number of caches (e.g., one or more L1 caches and not an L2 cache shared by the group). If the dSlot is in the last mGPU of the group, DRA 620 uses the end of kernel flush control register 1430 to determine which cache(s) to flush.
In various embodiments, the disclosed techniques may advantageously avoid non-deterministic flushing behavior, improve cache efficiency, or both.
In embodiments in which multiple GPU sub-units share a cache (e.g., mGPUs 320A-320N of a group 305), control circuitry may schedule portions of a kernel that access the same memory region(s) to sub-units that share a cache. This may improve cache efficiency, particularly between kernels of the same kick.
In some embodiments, primary control circuitry 210 defines a set of affinity regions, which may correspond to sets of hardware that share resources such as a cache. In some embodiments, there is a fixed relationship between affinity regions and target groups of mGPUs (although the relationship may vary depending on the dimensionality of the kernel). Primary control circuitry 210 may include control registers that store a number of affinity maps. Each affinity map may specify relationships between kernel portions and affinity regions. In this manner, each kernel may refer to an affinity map that reflects its memory accesses (e.g., as determined and by software, which may configure affinity maps and specify an affinity map for each kernel). Therefore, software may program potential affinity patterns using configuration registers, which may also be shared between multiple data masters. Within a kick, different kernels may be distributed according to different affinity maps.
In some embodiments, rather than mapping portions of a set of graphics work directly to target groups, affinity maps may use an indirect mapping that maps portions of the set of graphics work to affinity regions and then maps affinity regions to sets of hardware (e.g., to groups of mGPUs).
Control circuitry may distribute the set of graphics work based on the indicated affinity map. Multiple portions of the set of graphics work 1510 that target the same group may be assigned to the same group/affinity region (and thus may share a cache shared by mGPUs of the group, which may improve caching efficiency).
Note that although disclosed embodiments specify affinity at the granularity of groups of mGPUs, affinity may be specified and implemented at any of various appropriate granularities, e.g., with shared caches at various levels in a memory hierarchy. The disclosed embodiments are included for purposes of illustration but are not intended to limit the scope of the present disclosure.
Each kernel may be organized into workgroups in multiple dimensions (typically three dimensions). These workgroups may in turn include multiple threads (also referred to as work items). Primary kernel walker 1610, in the illustrated embodiment, is configured to iterate through the kernel to provide affinity sub-kernels, which include portions of the kernel that target the group of mGPUs, according to the specified affinity map. Primary kernel walker 1610 may indicate the sub-kernel assigned to a given group walker 1620 using the coordinates of the initial workgroup of the sub-kernel. Note that the various kernel data sent between elements of
For kernels with different dimensionalities, the primary kernel walker 1610 may divide the kernel into N affinity regions. For example, in embodiments with N affinity regions per affinity map, the primary kernel walker 1610 may use all N regions for a single-dimensional kernel. For a two-dimensional kernel, primary kernel walker 1610 may divide the kernel into a √{square root over (N)} by √{square root over (N)} grid of affinity regions. For a three-dimensional kernel, primary kernel walker 1610 may divide the kernel into rectangular affinity regions (as one example, a √{square root over (N)} by √{square root over (N)} grid of affinity regions that spans the entire z dimension).
Group walkers 1620, in the illustrated embodiment, are configured to independently walk respective affinity sub-kernels and generate batches, where each batch includes one or more workgroups. A batch may be the granularity at which compute work is dispatched to an mGPU. Note that a given affinity sub-kernel may be divided into multiple thread-restricted walk order sub-kernels, as discussed in detail below with reference to
Group walker arbiter 1630, in the illustrated embodiment, is configured to arbitrate among available batches and mGPU assign circuitry 650 is configured to assign selected batches to mGPUs.
Assign circuitry 650 may use the mGPU mask and load balancing to assign mGPUs, subject to any software overrides. Kickslot arbiter 660 arbitrates among ready batches and sends them to target mGPUs via communications fabric 1660. Communications fabric 1660 may be a workload distribution shared bus (WDSB) configured to send control signaling that indicates properties of assigned work and tracking signaling to indicate work completion, e.g., as discussed in the '943 patent application referenced above.
In some embodiments, the device may turn affinity-based scheduling off, e.g., based on software control or using control circuitry under certain conditions. In this situation, primary kernel walker 1610 may assign the entire kernel to a single group walker 1620.
Each instance of distributed control circuitry 340 in mGPUs may include an input queue and a batch execution queue to store received batches before assigning workgroups to shader pipelines for execution.
In the illustrated example, portion AO includes multiple thread restricted sub-kernel portions A-N. Within each affinity sub-kernel, a group walker 1620A may use restricted iteration as set out in the '913 application. As shown, thread restricted sub-kernel portion A is divided into a number of batches, which may be distributed via communication fabric 1660 (where each square in a batch represents a workgroup). In disclosed embodiments, all batches from portion AO may be assigned to the same group of mGPUs (and note that other portions of kernel 1710 may also target this group of mGPUs). In various embodiments, the disclosed affinity techniques may advantageously improve cache efficiency.
In some embodiments, affinity-based scheduling may temporarily reduce performance in certain situations, e.g., for non-homogeneous kernels. For example, some groups of mGPUs may still be working on a complex portion of a kernel when other groups have finished less-complex portions. Therefore, in some embodiments, the graphics processor implements work stealing techniques to override affinity-based scheduling, e.g., at the end of a kernel. In these embodiments, groups of mGPUs that are idle for a kernel may take work from groups that are still working on the kernel, which may advantageously reduce overall execution time for the kernel.
In some embodiments, control circuitry selects one or more donator groups of mGPUs (e.g., the group(s) with the most work remaining) and selects other groups of mGPUs in certain states (e.g., that have completed all of their work for a kernel or at least a threshold amount of their work) as work recipient groups. The work recipient groups may receive batches from an affinity sub-kernel assigned to the donator group, thereby overriding affinity techniques in certain situations.
Work sharing control circuitry 1820, in the illustrated embodiment, is configured to select work donator group(s) and recipient group(s) based on the information maintained by circuitry 1810. Information identifying these groups is maintained in circuitry 1830 and 1840, in the illustrated embodiment. In some embodiments, a group is eligible to take work only if it was associated with an affinity region in a kernel's affinity map. In some embodiments, a group becomes eligible to take work for a kernel once it has dispatched all of its assigned work (assigned via the affinity map) for the kernel.
In some embodiments, the work donator group is the group that is furthest behind (has the greatest number of portions remaining to dispatch). When groups become eligible to receive work, they may lock on to the donator group. As shown, primary kernel walker 1610 may send state information (e.g., coordinate base information for an affinity sub-kernel) for synchronization of such recipient groups.
The group kernel walker for the donator (1620A, in this example) produces batches of workgroups to send to the mGPUs in its corresponding group or to the mGPUs of any of the work recipient groups. The set of eligible mGPUs may be specified by the mGPU mask from group walker 1620A, for example, such that mGPU assign circuitry 650 can select from among the set of eligible mGPUs based on load balancing.
In some embodiments, once the donator group is finished dispatching for its current portion (e.g., affinity sub-kernel) the recipients become unlocked and a new donator may be selected, and the process may continue until the entire kernel is dispatched.
In some embodiments, kickslot manager 350 implements multiple “top slots,” to which software is able to assign kicks. These top slots are also referred to herein as “tracking slots.” Kickslot manager 350 may then handle software-specified dependencies between the kicks, map kicks from tracking slots to logical slots in primary control circuitry 210, track kick execution status, and provide status information to software. In some embodiments, dedicated kickslot manager circuitry may advantageously reduce kick-to-kick transition time relative to software-controlled implementations.
Register copy engine 1910, in some embodiments, is configured to retrieve register data (e.g., for kick configuration registers) from memory via memory interface 1930 and program configuration registers via interface 1940 for a kick. In some embodiments, register copy engine 1910 is configured to pre-fetch configuration register data into an internal buffer (not explicitly shown in
In some embodiments, register copy engine 1910 is configured to prefetch data for kicks in priority order and may not wait for initially-requested register data to be retrieved before requesting additional data (which may absorb memory latency associated with reading the register data). In some embodiments, register copy engine 1910 supports masked broadcast register programming, e.g., based on mGPU masks such that the proper distributed slots are programmed. In some embodiments, using register copy engine 1910 to program control registers may offload work from a primary firmware processor.
In some embodiments, kickslot manager 350 is configured to schedule a kick and send work assignment information to primary control circuitry 210 prior to programming of all configuration registers for a kick. Generally, initial kick scheduling may be pipelined. This may include setup phase register programming, primary control circuitry identifying distributed slots, the register copy engine 1910 programming control registers in parallel with the primary control circuitry queueing work, and the queued work beginning once the final control register has been written. This may allow downstream circuitry to receive and queue work assignments and quickly begin processing once configuration registers are written, further reducing kick-to-kick transition time in some embodiments. In particular, this may save latency associated with multiple control bus traversals relative to waiting to queue work until all control registers are programmed.
Dependency tracking and status circuitry 1920 may store information received from software and provide status information to software via the software interface, as discussed in detail below. In some embodiments, tracking slots are shared by multiple types of primary control circuitry (e.g., compute, pixel, and vertex control circuitry). In other embodiments, certain tracking slots may be reserved for certain types of primary control circuitry.
Each tracking slot may be assigned a unique ID. Thus, the kickslot manager 350 may support a maximum number of tracking slots. In various embodiments, the number of supported tracking slots may be selected such that it is fairly rare that enough small non-dependent kicks can be scheduled in parallel to use all available tracking slots. In some embodiments, the number of supported tracking slots is greater than the number of supported logical slots.
The status field, in some embodiments, indicates the slot's current state and whether the slot is valid. This field may also indicate the logical slot and any distributed slots assigned to the tracking slot, if applicable. In some embodiments, the status field supports the following status values: empty, programming done, register fetch started, waiting for parents, waiting for resources, waiting for distributed slots, running, halt requested, deallocating, de-queued by kickslot manager, de-queued by primary control circuitry, context stored, and complete. In other embodiments, the status field may support other states, a subset of the described states, etc. Example states are discussed in detail below with reference to the state machine of
The data identification field, in some embodiments, indicates the location of control register data for the kick. This may be specified as an initial register address and a number of configuration registers, for example. It may also include a register context identifier. In some embodiments, the data identification field also indicates other resources used by the kick, such as samplers or memory apertures. Some of these resources may be hard resources, such that the kick cannot proceed until they are available, while other resources may be soft resources and a kick may proceed without them or with only a portion of requested resources, in certain situations. As one example, memory apertures may be considered soft resources and kicks may be allowed to proceed even if their soft resources are not available (potentially with a notification sent to the requesting software).
The dependency field, in some embodiments, indicates any dependencies for the slot on kicks in other slots. As one example, circuitry 1920 may implement an N×N matrix (where N is the number of tracking slots) where each slot includes an entry for each other slot that indicates whether the slot depends on the other slot. Entries may be cleared as kicks from other slots complete. In other embodiments, dependencies may be encoded using other techniques. Kickslot manager 350 may assign tracking slots to logical slots according to the indicated dependencies (e.g., by waiting to assign a kick to a logical slot until all tracking slots on which it depends have completed). Moving dependency tracking from software/firmware control to dedicated hardware may allow for more efficient use of logical slots and may reduce kick-to-kick transitions.
The run data field, in some embodiments, provides information regarding the run status of kicks. For example, this field may provide timestamps for assignment of a kick to a logical slot, when a kick begins running on distributed slots, and when a kick is finished. Various other performance or debug information may be indicated as well. In some embodiments, various tracking slot information is retained for slots with the retain field set and their mapped hardware resources are also not released (potentially allowing access to status registers at the logical slot level, distributed slot level, or both).
The configuration field, in some embodiments, indicates the type of primary control circuitry controlling the slot (e.g., compute, pixel, or vertex), the priority of the slot, a retain slots indication, a force end of kick interrupt indication, or any combination thereof. This configuration field may be programmable by software to indicating configuration of the slot and provide certain software override information, for example. An end of kernel interrupt may be set globally or may be set to trigger per kick (or to trigger after a threshold number of kicks). This may advantageously reduce firmware time spent handling interrupts (by omitting interrupts in certain situations) while still retaining interrupt functionality when needed.
In various embodiments, the disclosed tracking circuitry may allow software to handle a number of kicks in parallel (e.g., with the ability to start, stop, query, and modify execution of these kicks).
This organization of prefetched register data may advantageously allow overwrites of prior registers, e.g., for kick-to-kick buffer re-use while still allowing saving new registers at the beginning or end of a block of registers of a given type. In various embodiments, registers of two or more different types may be grouped together by type to facilitate such techniques. In some embodiments, the register prefetch buffer is an SRAM. In other embodiments, the register prefetch buffer is a cache and may evict entries when additional space is needed (e.g., according to a least-recently-used algorithm or another appropriate eviction algorithm).
As shown, if a halt is requested in any of states 2110-2118, the state transitions to “de-queued from KSM” 2126. Once the slot is reset, the state transitions back to empty state 2110. Note that state 2116 may require substantially less deallocation operations than other halt states discussed in detail below, e.g., because resources have not yet been allocated to the slot.
Once resources are allocated, the state transitions to “wait for dSlot state” 2120 and the KSM waits for a control response at 2124 (e.g., from primary control circuitry). Once dSlot(s) are allocated, the state transitions to running state 2122. If a halt is requested in these states (shown at 2128), the KSM waits for a control response at 2130. If the kick is done after a halt request or from running state 2122, the slot is deallocated at 2132 and the kick is complete at 2138.
If a halt is requested in states 2120 or 2122 and the control response 2130 indicates that a logical slot is stored, the state transitions to deallocating state 2134 and waits for context to be stored at 2140 before resetting the slot. If the control response at 2130 indicates a de-queue, the state transitions to deallocating 2136 and then “de-queued from primary control circuitry” 2142 before resetting the slot (this may be a more graceful de-queue that does not require a context store of the logical slot, relative to states 2134 and 2140). Speaking generally, disclosed techniques may advantageously allow primary control circuitry to pause scheduling of work at multiple levels and allow firmware to interact with hardware in a safe manner.
Once the slot is reset from states 2138, 2140, or 2142, the kickslot manager determines whether the retain field is set and transitions back to empty state 2110 if not. If the retain field is set, KSM waits for any assigned logical slots to be deallocated at 2148 (e.g., based on software control). Speaking generally, tracking slots may be automatically recycled unless they are explicitly retained.
As discussed above, dependency tracking and status circuitry 1920 may provide current state for each slot to software.
In some embodiments, kickslot manager 350 is scalable across multiple GPU sizes, e.g., by allowing variation in the number of tracking slot supported. Disclosed dynamical hierarchical scheduling of tracking slots (by firmware or software) then logical slots (by primary control circuitry) then distributed slots may advantageously provide efficient distribution with scheduling intelligence distributed across the hierarchical levels.
In some embodiments, kickslot manager 350 is configured to perform one or more power control operations based on tracking slots. For example, control circuitry may reduce the power state of one or more circuits (e.g., by clock gating, power gating, etc.). In some embodiments with a large number of tracking slots, control circuitry may reduce the power state of other circuitry even when that other circuitry has work queued in a tracking slot. For example, control circuitry may reduce the power state of the pixel data master even when it has a kick in a tracking slot.
In some embodiments, the first action for a scheduled tracking slot is an increase in the power state of any associated circuitry, if it is in a lower power state than desired. For example, control circuitry may start pixel kicks by writing a power-on register for the pixel data master. Speaking generally, the device may power gate various types of logic (e.g., caches, filtering logic, ray tracing circuitry, etc.) and power those logic blocks on when a tracking slot will use that logic. In some embodiments, kickslot manager 350 maintains one or more flags for each tracking slot that that indicate whether the kick assigned to the tracking slot uses one or more types of circuitry. Kickslot manager 350 may cause those types of circuitry to meet a required power state in response to scheduling of those tracking slots.
At 2210, in the illustrated embodiment, control circuitry assigns first and second sets of graphics work to first and second logical slots. In some embodiments, circuitry implements a plurality of logical slots and a set of graphics processor sub-units each implement multiple distributed hardware slots. In some embodiments, the graphics processor sub-units are organized into multiple groups of multiple sub-units, where sub-units in the same group share a cache. In some embodiments, the sub-units of a given group are implemented on the same physical die. In some embodiments, the sub-units include respective fragment generator circuitry, shader core circuitry, memory system circuitry that includes a data cache and a memory management unit, geometry processing circuitry, and distributed workload distribution circuitry. In some embodiments, distributed hardware slots include respective: configuration registers, batch queue circuitry, and batch iteration circuitry. In various embodiments, shader circuitry in a sub-unit is configured to receive and perform work from its plurality of distributed hardware slots.
Reciting that “a set of graphics processor sub-units each implement multiple distributed hardware slots” means that the set of graphics processor sub-units includes at least two sub-units, each of which implements multiple distributed hardware slots. In some embodiments, a device may have additional graphics processor sub-units (that are not in the set) which do not necessarily implement multiple distributed hardware slots. The phrase “a set of graphics processor sub-units each implement multiple distributed hardware slots” is thus not to be interpreted to mean that in all cases, all sub-units in the device implement multiple distributed hardware slots—it simply provides for the possibility that this might be the case in some instances, and not in others. Similar interpretation is intended for other recitations herein that use the term “each.”
At 2220, in the illustrated embodiment, control circuitry determines a distribution rule for the first set of graphics work that indicates to distribute to all of the graphics processor sub-units in the set.
At 2230, in the illustrated embodiment, control circuitry determines a distribution rule for the second set of graphics work that indicates to distribute to fewer than all of the graphics processor sub-units in the set. In some embodiments, the determined distribution rule for the second set of graphics work indicates to distribute the first set of graphics work to a single group of sub-units. Alternatively, the determined distribution rule for the second set of graphics work may indicate to distribute the second set of graphics work to a single sub-unit.
The control circuitry may select the first and second distribution rules based on amounts of work in the first and second sets of graphics work. The control circuitry may determine the first distribution rule based on one or more software overrides signaled by a graphics program being executed. These may include any appropriate combination of the following types of example software overrides: mask information that indicates which sub-units are available to the first set of work, a specified distribution rule, group information that indicates a group of sub-units on which the first set of work should be deployed, and policy information that indicates a scheduling policy. In some embodiments, the control circuitry determines respective hold values for slots of the plurality of logical slots, where the hold values indicate status of kernels for a logical slot. The control circuitry may allow a logical slot with a first priority level to reclaim a hardware slot that is assigned to a logical slot with a second, lower priority level, based on one or more of the respective hold values.
The first and second sets of graphics work may be kicks. The first and second sets of graphics work may be compute kernels in the same kick or in different kicks. Thus, in some embodiments, the first set of graphics work is a first kernel of a compute kick assigned to the first logical slot, where the compute kick includes at least one other kernel and where the apparatus is configured to select a different distribution rule for the at least one other kernel than for the first kernel.
At 2240, in the illustrated embodiment, control circuitry determines a mapping between the first logical slot and a first set of one or more distributed hardware slots based on the first distribution rule.
At 2250, in the illustrated embodiment, control circuitry determines a mapping between the second logical slot and a second set of one or more distributed hardware slots based on the second distribution rule
At 2260, in the illustrated embodiment, control circuitry distributes the first and second sets of graphics work to one or more of the graphics processor sub-units according to the determined mappings.
In some embodiments, control circuitry for a logical slot includes: a control stream processor (e.g., a CSP 630) configured to determine the first and second distribution rules, a kernel processor (e.g., circuitry 640) configured to generate batches of compute workgroups, sub-unit assignment circuitry (e.g., circuitry 650) configured to assign batches of compute workgroups to sub-units. In some embodiments, the control circuitry includes hardware slot resource allocator circuitry (e.g., circuitry 620) configured to allocate hardware slots to control stream processors based on an indicated distribution rule and logical slot arbiter circuitry (e.g., circuitry 660) configured to arbitrate among batches from different logical slots for distribution to assigned sub-units. In some embodiments, the hardware slot resource allocator circuitry is configured to allocate hardware slot based on states of hardware slots. The states for different hardware slots may include at least: invalid, running, emptied, and flushing, for example.
In some embodiments, the device is configured to execute multiple types of cache flush invalidate operations, which may include a first type of cache flush invalidate operation that flushes and invalidates caches only for one or more sub-units to which a kernel was assigned and an unconditional type of cache flush invalidation operation that flushes and invalidates all caches for the set of graphics processor sub-units at one or more cache levels.
At 2310, in the illustrated embodiment, control circuitry receives a first set of software-specified graphics work and software-indicated priority information for the first set of graphics work.
At 2320, in the illustrated embodiment, control circuitry assigns the first set of graphics work to a first logical slot of a plurality of logical slots implemented by the device.
At 2330, in the illustrated embodiment, control circuitry determines mappings between logical slots and distributed hardware slots implemented by graphics sub-units of the device, where the mappings reserve a threshold number of hardware slots in each sub-unit for logical slots whose priority exceeds a threshold priority level. In some embodiments, a first subset of logical slots are high priority slots and the remaining logical slots are low priority slots. In these embodiments, the control circuitry may assign the first set of graphics work to the first logical slot based on the software-indicated priority information. In other embodiments, priority may be encoded and tracked using various other techniques.
At 2340, in the illustrated embodiment, control circuitry distributes the first set of graphics work to one or more of the graphics processor sub-units according to one of the mappings.
In some embodiments, control circuitry (e.g., distributed slot resource allocator circuitry) is configured to perform a reclaim procedure that allows a logical slot with a first software-indicated priority level to reclaim a hardware slot that was assigned to a logical slot with a second, lower priority level.
In some embodiments, based on software input for the first set of graphics work (e.g., a retain slots command), the control circuitry is configured to maintain the mapping of distributed hardware slots for the first logical slot after completion of processing for the first set of graphics work. In some embodiments, the control circuitry assigns e mapped distributed hardware slots for the first set of graphics work to another logical slot only after software input that indicates to release the mapped distributed slots.
In some embodiments, the control circuitry provides status information to software for the first set of graphics work. The control circuitry may support various status states, including without limitation: waiting on dependencies, waiting for configuration data for the first set of graphics work, waiting for assignment distributed slots, waiting for hardware resources, empty, programming complete, waiting for a logical slot, deallocating, and context stored. The status information may identify the first logical slot, identify assigned distributed hardware slots, or indicate timestamp information associated with execution of the first set of graphics work, for example.
The control circuitry may support various software control or override functionality in addition to or in place of priority information, including without limitation: a specified distribution rule that indicates whether to distribute to only a portion of the graphics processor sub-units in the set or to distribute to all of the graphics processor sub-units in the set, group information that indicates a group of sub-units on which the first set of graphics work should be deployed, mask information that indicates which sub-units are available to the first set of graphics work, and policy information that indicates a scheduling policy.
In some embodiments, the device includes control stream processor circuitry configured to determine distribution rules for the mappings and distributed slot resource allocator circuitry configured to determine the mappings based on: software input, determined distribution rules from the control stream processor circuitry, distributed slot state information.
At 2410, in the illustrated embodiment, control circuitry (e.g., kernel walker circuitry) receives a software-specified set of graphics work (e.g., a compute kernel) and a software-indicated mapping of portions of the set of graphics work to groups of graphics processor sub-units. The first group of sub-units may share a first cache and the second group of sub-units may share a second cache. Note that the mapping may or may not identify specific groups of graphics sub-units. Rather, the mapping may specify that multiple portions of the compute kernel should be assigned to the same group of graphics processor sub-units but may allow hardware to determine which group of graphics processor sub-units to actually assign.
At 2420, in the illustrated embodiment, control circuitry assigns, based on the mapping, a first subset of the set of graphics work to the first group of graphics sub-units and a second subset of the set of graphics work to the second group of graphics sub-units.
The control circuitry may be configured to store, in configuration registers, multiple mappings of portions of sets of graphics work to groups of graphics processor sub-units.
The kernel walker circuitry may include: primary kernel walker circuitry (e.g., element 1610 of
In some embodiments, the device includes work sharing control circuitry configured to: determine a set of one or more other groups of sub-units that have dispatched all of their assigned portions for the compute kernel and assign at least a first portion of the compute kernel, that was indicated by the mapping as targeting the first group of sub-units, to a group of the one or more other groups of sub-units.
In some embodiments, the control circuitry disables affinity-based work distribution in one or more modes of operation. The control circuitry may support mappings of portions of compute kernels to groups of graphics processor sub-units affinity maps for multiple dimensionalities of compute kernels including single-dimension kernels, two-dimensional kernels, and three-dimensional kernels.
In some embodiments, a non-transitory computer-readable medium having instructions stored thereon that are executable by a computing device to perform operations comprising: receiving a compute kernel and a corresponding mapping of portions of the compute kernel to groups of graphics processor sub-units, where the compute kernel and mapping are specified by the instructions and the mapping indicates cache affinity for a set of portions of the compute kernel mapped to a given group of graphics processor sub-units; and assigning, based on the mapping, a first subset of the compute kernel to a first group of graphics sub-units and a second subset of the compute kernel to a second group of graphics sub-units.
At 2510, in the illustrated embodiment, control circuitry (e.g., slot manager circuitry) stores, using an entry of tracking slot circuitry, software-specified information for a set of graphics work, wherein the information includes: type of work, dependencies on other sets of graphics work, and location of data for the set of graphics work
In some embodiments, the tracking slot circuitry is software-accessible to query various information associated with the set of graphics work. This may include, for example, status for the set of graphics work, timestamp information associated with execution of the set of graphics work, information indicating the logical primary slot, and information indicating the one or more distributed hardware slots. In some embodiments, the tracking slot circuitry supports status values that indicate at least the following status states for the set of graphics work: empty, register fetch initiated, waiting for one or more other sets of graphics work, waiting for logical slot resources, waiting for distributed hardware slot resources, and running.
At 2520, in the illustrated embodiment, control circuitry prefetches, from the location and prior to allocating shader core resources for the set of graphics work, configuration register data for the set of graphics work. Note that the prefetches may occur after configuration of a tracking slot for the set of graphics work, but before the control circuitry determines to start the set of graphics work (e.g., before all its dependencies have been satisfied). The control circuitry may utilize various criteria for determining when to begin prefetching. The prefetch may be performed from a shared memory (which may be shared among multiple instances of control circuitry, shared with non-GPU processors, or both) into an SRAM memory element of slot manager circuitry.
In some embodiments, the control circuitry sends, prior to completion of programming the configuration registers, portions of the set of graphics work to hardware slots assigned to the set of graphics work. The hardware slots may hardware slots include queue circuitry for received portions of the set of graphics work.
At 2530, in the illustrated embodiment, control circuitry programs configuration registers for the set of graphics work using the prefetched data. The configuration register may specify properties of the set of graphics work, location of data for the set of graphics work, parameters for processing the set of graphics work, etc. The configuration register may be distinct from data registers that store data to be processed by the set of graphics work.
At 2540, in the illustrated embodiment, control circuitry initiates processing of the set of graphics work by the graphics processor circuitry according to the dependencies. The control circuitry may assign set of graphics work to a logical primary slot (and at least a portion of the configuration register data may be for configuration registers of the logical primary slot) and assign the logical slot to one or more distributed hardware slots (and at least a portion of the configuration register data may be for configuration registers of the one or more distributed hardware slots).
In some embodiments, control circuitry is configured, in conjunction with initiating a set of graphics work from an entry of the tracking slot circuitry and based on information about the set of graphics work, to initiate an increase from a lower power mode to a higher power mode for one or more circuits associated with the set of graphics work.
In some embodiments, graphics instructions specify to store the information for the set of graphics work (e.g., indicating the type of work, dependencies on other sets of graphics work, and location of data for the set of graphics work) and queries the tracking slot circuitry to determine status information for the set of graphics work (e.g., a status from among: empty, register fetch initiated, waiting for one or more other sets of graphics work, waiting for logical slot resources, waiting for distributed hardware slot resources, and running, timestamp information associated with execution of the set of graphics work, information indicating an assigned logical primary slot, and information indicating assigned distributed hardware slots.
In some embodiments, in response to a halt command for the set of graphics work, control circuitry is configured to perform different operations depending on current status of the tracking slot. For example, control circuitry may, in response to determining that a logical primary slot has not been assigned, reset the entry of the tracking slot circuitry. As another example, control circuitry may, in response to determining that a logical primary slot has been assigned, de-allocate the logical primary slot and reset the entry of the tracking slot circuitry. As yet another example, control circuitry may, in response to determining that one or more distributed hardware slots have been assigned, perform one or more context switch operations, deallocate the one or more distributed hardware slots, de-allocate the logical primary slot, and reset the entry of the tracking slot circuitry.
The following section discusses improved or alternative kick scheduling and distribution techniques, streaming kickslot manager techniques with kick queues in memory (e.g., a DRAM), logical kickslots in the geometry kick context, event flags for dependencies that are not related to other kicks, and techniques for pipelining dependent kicks.
mGPU-Level Allocation
In some embodiments, kickslot manager 350 is configured to distribute logical kick slots such that they use a minimum number of mGPUs required for a given kick (e.g., in contrast to snapping the number of mGPUs allocated to one, the number of mGPUs in a group, or all mGPUs in a machine). In these embodiments, kicks may use any combination of mGPUs (e.g., in an eight-mGPU system, a kick may use 1, 2, 3, 4, 5, 6, 7, or 8 mGPUs). In various embodiments, this may advantageously allow more small or medium-sized kicks to run in parallel (and for small kicks to launch earlier), which may increase GPU hardware utilization.
Note that small-kick performance may be important in various contexts, such as games written for immediate-mode GPUs that do not minimize kick overhead and include a substantial number of small kicks. Further, fine-grained mGPU-level allocation may enable even large kicks to start earlier in conjunction with start-when-ready techniques discussed below.
Fragment/pixel primary control circuitry, in some embodiments that use tile-based rendering, is configured to calculate the number of mGPUs for a fragment kick based on the number of tiles in the kick. The following pseudocode provides one example technique that fragment generator circuitry may utilize to determine the number of mGPUs (and thus distributed slots) allocated to a fragment kick:
Compute control circuitry, in some embodiments, is configured to calculate the number of mGPUs for a compute kick based on the number of workgroups and/or work items in a kick or kernel. Compute control circuitry may dynamically re-size the number of distributed slots at different dispatch boundaries within a kick. The following pseudocode provides one example technique that compute control circuitry may utilize to determine the number of mGPUs (and thus distributed slots) allocated to a compute kick or a kernel:
Note that the allocations above may be subject to software overrides, e.g., that force a single-mGPU, particular group of mGPUs, use of all mGPUs, etc. Distributed slot assignment may take mGPU-level allocation into account, as discussed below with reference to
In this example, kick 0 targets six mGPUs, kick 1 targets two mGPUs, kick 2 targets one mGPU, kick 3 targets eight mGPUs, kick 4 targets three mGPUs, and kick 5 targets four mGPUs.
At time TO, kick 0 is distributed using the full-machine distribution mode. Therefore, at T1, kick 1 uses distributed slots on mGPU0 and mGPU1 (even though two upper distributed slots were not used on mGPU6 and mGPU7). Kick 1 uses a group-level allocation, which also blocks the second slot on mGPU 2 and mGPU 3.
At time T2, kick 0 has completed. At time T3, kick 2 is scheduled on mGPU0. At time T4, kick 1 has completed. At time T5, kick 3 is scheduled across all mGPUs. At time T6, kick 4 is scheduled across three mGPUs of group 1 (using group-level allocation). At time T7, kicks 2 and 4 have completed. At time T8, kick 5 is scheduled. As discussed in detail below, the mGPU-level allocation in the example of
At time TO, kick 1 is distributed to six mGPUs. Therefore, at T1, kick 1 can use the upper distributed slots in mGPU6 and mGPU7. At time T2, kick 2 is scheduled in the lower slot of mGPU0. At time T3, kick 0 has completed. At time T4, kick 3 is distributed to eight mGPUs, including lower slots on mGPUs 6 and 7. At time T5, kick 1 has completed. At time T6, kick 4 has been assigned to mGPUs 1-3. At time T7, kick 5 is distributed to mGPUs 4-7.
In this example, the processor distributed all kicks into the machine in 120 time units, relative to 160 time units for the example of
Note that in some embodiments discussed above, a given kick may wait until its total number of desired mGPUs is available before launching any kick portions. This may reduce the overall execution time between starting and ending execution of the kick across N mGPUs. Running the same kick on a single mGPU as N sequential portions, however, may utilize the same amount of computational resources. In some embodiments, therefore, it may be desirable to launch portions of a kick as soon as a distributed slot is available, whether or not the entire number of desired mGPUs is available. This may advantageously reduce graphics processor idle time, for some workloads (and may eliminate idle time when there is a non-dependent kick available to run). Thus, in these embodiments, a kick may start as soon as any mGPU is available and portions of a given kick may execute sequentially on the same distributed slot. Note that the probability of finding kicks that can start may be substantially increased by kick queue and streaming kickslot manager techniques discussed in detail below with reference to
In this example, distribution proceeds similarly to
At time T5, kick 4 obtains three distributed slots. At time T6, kick 5 has been allocated two slots and it receives all its requested slots at time T7. In this example, all kicks are launched into the machine within 80 time units.
Note that a given kick may never receive a slot in its desired number of mGPUs. For a seven-portion kick, for example, two of the portions may execute on the same mGPU, utilizing only six mGPUs. Generally, the N portions of a given kick may execute on a given mGPU and a kick may be allocated to any number 1 through N of its desired number of mGPUs.
In some embodiments, various performance tracking techniques may be used in the context of start-when-ready distribution. Without this feature, a given kick may have a clearly defined execution start point (on distributed slot allocation) although the portions might complete at different times. In these embodiments, a kick might be considered to end when the last distributed slot is released. These start and end timestamps may be provided to software for profiling and performance analysis.
In start-when-ready embodiments, the graphics processor may generate multiple types of performance indicators. For example, the kickslot manager may track how long a given kick runs on a given distributed slot (which may include execution of multiple kick portions). The kickslot manager may also aggregate these counts into a single run-time counter for the kick (which indicates the total resources in space and time utilized by the kick) and may also report the per-distributed slot counts. The kickslot manager may provide this information in a tracking slot register, write the information to a kick completion buffer (discussed in detail below), or both. This may advantageously provide developers with tools to profile their code.
In some embodiments, for a context store, the primary control circuitry for a given kick is configured to store state information that specifies which distributed slots were in use at the point in time that the kick was context stored. Similarly, the primary control circuitry may load the state information on a context load and wait for those distributed slots to be allocated before proceeding with the kick. Note that start-when-ready techniques may operate in conjunction with affinity scheduling and work stealing mechanisms may be utilized to redistribute work assigned to lagging mGPU(s) if needed.
Various techniques discussed above may allow work from kicks to stream into distributed mGPUs quickly in a fine-grained manner. Depending on the number of tracking slots implemented (which may have circuit area impacts), it may be challenging for software to configure enough tracking slots in the kickslot manager 350 to take full advantage of these features, particularly without knowledge of hardware resource utilization.
Therefore, in some embodiments, kick queues are stored externally from the kickslot manager (e.g., in a data structure in DRAM) and the kickslot manager is configured to select kicks from queues to populate tracking slots, logical slots, or both. As discussed in detail below, these embodiments may utilize various techniques to indicate and track dependencies, select from kick queues to populate tracking slots, store data for completed work in completion queues, handle interrupts for completed kicks, support partial rendering operations, etc.
Kickslot manager 350, in some embodiments, is configured to read work from a substantial number of kick queues located in DRAM (although other types of memory are also contemplated). For example, in different embodiments or modes of operation various numbers of kick queues may be implemented such as 16, 32, 64, 128, 256, 512, and so on. Similarly, each kick queue may allow up to a threshold number of entries to be enqueued (such as 16, 32, 64, 128, 256, 512, 1024, and so on).
In some embodiments, each kick queue entry is a fixed-size structure in memory and includes various information discussed above in the context of tracking slot entries. Therefore, rather than configuring top slots, software may write kick configuration data into a queue entry. Kickslot manager 350 may then select queue entries to populate tracking slots. A given queue entry may indicate dependencies on other kicks and may also indicate dependencies on system events, as discussed in detail below with reference to
In some embodiments, kick queues are implemented as ring buffers.
In some embodiments, a given kick queue is configured via a set of configuration registers, which may implement the following fields: valid, skip, halted, suspend, address, queue size, kick count, kick position, wrap count, context identifier, priority, add kicks, and one or more timestamp fields.
The skip field may indicate that all kicks in the queue should be skipped, such that they schedule as normal but, once unblocked to run in a tracking slot, should immediately complete without doing any work. The halted field may indicate that a kick queue cannot schedule work into tracking slots. Halts may occur based on software control (e.g., for a context switch) or based on dependency on another halted queue, for example. The suspend field may indicate that a kick is suspended and may include separate flags for different suspension reasons.
The address, queue size, kick count, kick position, and wrap count fields may specify dimensions of the queue structure in ring buffer embodiments. The context identifier may specify the context to use when fetching kick entries. The priority field indicates the priority of the queue. The timestamps may indicate the timing of the last kick selected from the queue and the oldest halted kick seen from the queue, for example. In some embodiments, software reads and writes these registers using masked register reads and writes.
In some embodiments, each kick is tracked using a kick identifier, which may be programmed by software. Each kick identifier may include queue identifier, a wrap count provided by software (which increments when a kick queue wraps or is repurposed), and a queue position. In other embodiments, the queue identifier and position may be implied by hardware based on an entry's position in a given queue.
Kickslot manager 350, in the illustrated embodiment, includes queue select logic 3020 (which in turn includes queue remap table 3025), register copy engine 1910, and top slot circuitry 3030 (which may implement status circuitry 1920 as discussed above with reference to
Example Kick Scheduling from Kick Queues to Tracking Slots
Queue select logic 3020, in some embodiments, is configured to select kicks based on various combinations of parameters, such as, without limitation: queue priority, queue deadlines, dependencies between kicks, the primary controller associated with kicks (e.g., compute, vertex, or pixel controllers), available hardware resources, etc. In some embodiments, queue select logic 3020 is triggered to select a kick under the following conditions: there is an empty tracking slot and there is at least one kick queue available that could potentially schedule into that top slot.
In some embodiments, each queue has a programmable queue priority. Generally, queue select logic 3020 may select work from higher-priority queues first. In some embodiments, queue select logic 3020 implements a fallback arbitration mechanism (e.g., round-robin) among queues with the same priority. Note that the queue priority used to select kicks from queues is separate from the tracking slot priority used to select tracking slots for allocation to logical slots, in some embodiments. In some situations, when higher-priority queues cannot provide kicks, queue select logic 3020 is configured to select kicks from relatively lower priority queues, in order to increase utilization of tracking slot resources.
In some embodiments, for queues with the same priority, queue select logic 3020 is configured to implement deadline-based scheduling before falling back to round-robin. In these embodiments, a given kick queue entry implements a programmable timestamp value. Timestamps values may include wrap count and queue position fields, for example, and may be compared using an integer subtraction circuit and sign bit checker. In some embodiments, when a kick is programmed into a tracking slot, a last_into_KSM timestamp is updated to match the timestamp of the kick entry. Control circuitry may then compare the timestamp of a given kick to the last_into_KSM timestamp to identify which is older (which indicates whether the given kick has been programmed into a tracking slot or is still in a kick queue).
Given two or more queues to which deadline-aware selection is to be applied (e.g., two queues with the same priority), queue select logic 3020 is configured to select a queue with the nearer deadline in some embodiments. In these embodiments, each kick queue may maintain a deadline_timestamp that indicates a target completion time for kicks in that queue. Each kick entry in the queue may also have a deadline_timestamp that may be used to update the queue deadline_timestamp when kickslot manager 350 reads a given kick entry. The updated queue deadline_timestamp may then be used to arbitrate subsequent selection from queues. In other embodiments, kick entry deadlines may be snooped or pre-fetched to provide more synchronization for queue timestamps.
Priority-based scheduling, deadline-based scheduling, or both may be subject to constraints corresponding to dependencies. For dependencies between kicks, queue select logic 3020 may redirect attempts to pull work from a blocked queue to pull from the queue that is blocking it (e.g., using queue remap table 3025 to remap selections based on priority). For queues that are blocked by system dependencies (also referred to as event flags), queue select logic 3020 may remove those queues from selection consideration until they are unblocked.
In some embodiments, each queue entry includes a list of parent kick identifiers that specify the kicks on which that kick depends. Queue entries may also include a valid parent mask, indicating whether some of entries in the list should be ignored, which may facilitate a fixed queue entry size. Note that a parent kick identifier may be specified as a kick queue identifier and a timestamp to allow resolution of whether a dependency is blocking, as discussed below.
If a parent kick identifier is located in a different queue, kickslot manager 350 compares the parent kick's timestamp to the last_into_KSM timestamp of the parent kick queue (and the oldest_halted if the parent's queue is halted). If the parent kick timestamp is older than those timestamps, then the dependency has already been resolved. Otherwise, kickslot manager 350 may update an appropriate entry in queue remap table 3025.
Entries in queue remap table 3025, in some embodiments, include: a kick queue identifier field, a remapped kick queue identifier field, and a reset timestamp. In some embodiments, all requests pass through the queue remapping table 3025, which initially sets the kick queue identifier and remapped kick queue identifier to the same kick. When a dependency is detected, kickslot manager 350 updates the remapped kick queue identifier to specify the kick on which the current queue depends and sets the reset timestamp to the timestamp of the parent kick. When the current queue wins arbitration, queue select logic 3020 may select from the remapped queue instead. The remap table entry remains valid until the last_into_KSM timestamp reaches the reset timestamp.
Note that these dependency techniques are different than the techniques discussed in Section I, in the sense that software sets up kick queues rather than directly programming kick-to-kick dependencies in tracking slots. This allows software to remain unaware of which tracking slots will run a kick or which kicks will be resident in the GPU at a given time. Rather, software may freely specify dependencies between kicks across various kick queues.
In some embodiments, selection by queue selection logic 3020 is also subject to restrictions on tracking slot allocation. For example, in some embodiments, software provides restrictions on one or more of: the maximum tracking slots allocated per kick queue, the maximum tracking-slots allocated per primary controller (e.g., for pixel, vertex, or compute work), the maximum default-priority tracking slots per primary control controller (which, in conjunction with the previous restriction, may determine the number of tracking slots reserved for high priority kicks), and the maximum number of tracking slots that have a dependency on another tracking slot (which may allow software to ensure that there is always at least one tracking slot available for partial rendering, for example).
When queue select logic 3020 would normally select from a kick queue whose selection would violate one of the restrictions, that kick queue may be suspended. In some embodiments, kick queues in a suspended state (which may be distinct from valid and invalid states) may reduce over-fetching of kick entries. The suspend state may indicate that a queue is unable to make forward progress due to a temporary limitation. Examples of such limitations include: waiting for an event flag to clear, waiting for a tracking slot that is unavailable (e.g., based on primary controller type, priority level and number of dependencies required by kick, etc.), kick at the head of the queue depends on an invalid or empty queue in certain scenarios, etc. Suspend flags may indicate the reason for suspension of the queue. When kickslot manager 350 determines that all flags are cleared for a queue, the queue is resumed. In some embodiments, software is also allowed to reset suspend flags.
Note that reserving tracking slots for different primary controllers (rather than allowing one primary controller to use all of the tracking slots at a given time) may facilitating finding non-dependent kicks for scheduling, in certain situations.
In some embodiments, queue selection logic 3020 is configured to consider availability of downstream processing resources when selecting kicks. The disclosed embodiments discussed above relating to restrictions on tracking slots per primary controller is one example of this feature. For example, if a primary controller meets the restriction on its number of tracking slots, it is likely that corresponding downstream resources are busy (e.g., geometry hardware for the vertex controller). In some embodiments, additional flag fields are assigned to queues to indicate what resources they target. For example, a given flag may indicate whether queues use specialized resources such as: ray tracing acceleration hardware, texture sampling hardware, fragment processing hardware, matrix multiplication pipelines, etc. Queue selection logic 3020 may then limit the number of tracking slots allocated to queues that target a given resource (e.g., N tracking slots that access ray tracing hardware, M tracking slots that access texture sampling hardware, etc.).
In some embodiments, hardware may provide more detailed feedback regarding resource availability as input to queue selection logic 3020. While tracking slot usage may roughly correspond to resource usage, more fine-grained information may allow queue selection logic 3020 to utilize more complex logic to select kicks from queues (based on which kick's resources are more likely to be available), which may further improve performance. Similarly, queues may include fields with more detailed information about resource utilization (e.g., encoding information such as specific resources targeted, amount of work targeting those resources, etc.).
Generally, resource availability may be considered at various allocation levels, including selecting queues for tracking slots, assigning tracking slots to primary slots, distributing work from primary slots to distributed, etc.
In some embodiments, each kick entry includes fields to specify up to N pointers to register values that should be programmed at kick start time (e.g., by the register copy engine 1910). Further, a kick phase value may allow software to specify which of the N pointers should be used. In some embodiments, all kicks pre-fetch and program registers with data located in memory identified by the first register pointer, but optionally append additional register data located in memory identified by one of the other pointers based on the kick phase value. This may provide hardware partial render support, in some embodiments.
Further, kicks may optionally program a set of registers (indicated by software in DRAM) at kick completion time (e.g., in addition to producing data for a completion queue). This may facilitate tasks that want to update certain data without waiting for software to process a completion queue. Examples of such tasks include, without limitation: providing memory cache drop hints, updating event flags, etc.
When a kick completes, kickslot manager may evict it from its tracking slot and move its data to a completion queue. The completion queues are stored in the same memory space as the kick queues, in some embodiments. Generally, completion queues may allow software to delay processing of completed kicks rather than immediately processing each kick as it completes.
In some embodiments, completion queues include queues with different priorities and queues for different complexities. Different completion queue priorities may correspond to the priority of executed kicks (e.g., with one or more kick priority thresholds separating kicks into two or more different priority bins for assignment to different sets of completion buffers). Regarding queue complexity, kicks that complete work normally may be evicted to a normal completion queue and kicks that complete as the result of a halt request may be evicted to a complex completion queue, for example. Generally, various number of completion queues may be included for different classifications of kicks in other embodiments. As one fine-grained example, the processor may implement a completion queue for each input kick queue.
In some embodiments, complex completion queues support the following states for a given kick: dequeued by kickslot manager, dequeued by primary controller, and context stored. These states may indicate how far a kick had progressed before being halted. Normal completion queues may support complete and skipped states.
Kicks may be categorized as high or normal priority based on comparison of their priority to a software-configurable priority threshold. In some embodiments, at least four completion queues are supported: normal completion default priority, normal completion high priority, complex completion default priority, and complex completion high priority. In other embodiments, various other categories of completion queues may be implemented, e.g., based on additional priority classes, other types of completion, etc. Separate completion queues may allow software to efficiently prioritize completion tasks. In some embodiments, software may disable one or more types of completion queues.
In some embodiments, kickslot manager 350 is configured to halt a kick queue, e.g., to remove a given application from the system. This may include providing a halt signal to kicks from that kick queue and tracking slots that depend on that kick queue (either directly or via other kicks). In some embodiments, any subsequent attempt to schedule a kick entry that depends on a halted kick or kick queue will fail and mark its kick queue as halted (and may initiate an interrupt). In some embodiments, when a kick is halted, control circuitry updates an oldest_halted timestamp for the kick queue to the oldest of (A) the halted kick and (B) the kick queue's current oldest_halted timestamp.
In some embodiments, halts may utilize the tracking slot dependency matrix (and dependency information for kicks still in queues) to recursively determine which kicks depend on halted queues. The recursive approach by kickslot manager 350 may determine a set of dependent tracking slots whose kicks should be halted. Kickslot manager 350 may also set the oldest_halted timestamp to the oldest timestamp of any kick that was sent a halt signal during the process. On a context load, software may drain the complex completion buffer to establish which kicks were dequeued or context stored (and may also look at the normal completion buffer to determine which kicks completed successfully). Software may then program halted kicks as new kick entries in the kick queues or may rewind the queues (e.g., by manipulating kick position and kick count values of halted queues). Software may also appropriately modify the last_into_KSM timestamp before un-halting the queue.
Example partial render techniques
As mentioned above, kickslot manager 350 may include hardware support for partial render operations. This may occur, for example, when a geometry kick has an out-of-memory condition. Software may check whether previous renders from a paired fragment kick queue have finished (e.g., based on completion buffer timestamps). If not, the previous renders may be allowed to finish (which may free up parameter buffer pages) and the geometry kick may be restarted.
If the previous renders have finished, the fragment kick required for the partial render should be the kick entry at the head of the kick queue. Software may request a halt that halts only kicks that depend on the current kick queue (this may be referred to as halt-children). This may halt all kicks that depend on the out-of-memory geometry kick (as well as any such later-arriving kicks) and the out-of-memory geometry kick may remain in its tracking slot. Software may then remove the dependency of the fragment kick on the geometry kick completing and remove the halt on the fragment kick queue, allowing the first copy of the fragment kick to run. The Kickslot manager may schedule the first copy of the fragment kick (the partial render) into the tracking slot (without updating any of the queue's kick queue pointers, kick counts, or last_into_KSM) to effectively submit the copy without removing the fragment kick at the head of the queue so that it can be scheduled again in the future. The fragment queue may then be marked as halted to prevent the second copy of the fragment kick from scheduling. Software may then restart the geometry kick, add back the dependency, and remove the halt of the fragment kick.
Software may also update the register programming of the fragment kick so that it knows to resume from an existing partial render image. As discussed above, the kick phase value may correspond to multiple different pointers to registers that should be used by the register copy engine for different phases of a kick.
Once the geometry kick completes (normally, e.g., because the partial render freed pages), the second copy of the fragment kick may schedule normally and finish the render.
In some embodiments, kickslot manager 350 is configurable to generate interrupts in various kick completion contexts. For example, kickslot manager 350 may trigger interrupts in response to: normal kick completion, complex kick completion, default priority kick completion, high priority kick completion, kick completion that stalled in retain_slots mode first, kick halted by hardware, kickslot manager 350 being idle due to lack of work, kickslot manager 350 being idle due to all available kicks being blocked from starting, kickslot manager 350 no longer being idle due to an external event, etc., or some combination thereof.
Software may configure kickslot manager 350 to generate interrupts for only a subsets of completion types, e.g., by suppressing other completion types. In some embodiments a single interrupt interface is shared by multiple interrupt types and kickslot manager 350 includes a live status register with read-only flags indicating the reasons for interrupts (which are also individually resettable). Disclosed interrupt control techniques may allow threads of a given kick to control its own behavior when it ends, e.g., by configuring kickslot manager 350.
DRAM 3110, in the illustrated embodiment, stores data structures for kick queues 3010, data for kick setup registers 3115, and data for kick execute registers 3120 (the register data may be accessed by register copy engine 1910, for example). DRAM 3110 also stores data structures for four completion queues 3142, 3144, 3146, 3148 with different complexity and priority attributes.
In the illustrated example, primary pixel control circuitry 3134 and primary compute control circuitry 3136 have separate default-priority sets 3135 and 3138 and high-priority sets 3137 and 3139 of logical slots. The high priority slots may utilize dedicated logical slots in the mGPUs. In the illustrated example, primary geometry control circuitry 3132 is shown as including a single set of logical slots 3133, but multiple sets of geometry logical slots may be implemented in various embodiments. Similarly, various numbers of priority classes of logical slots in various primary control circuitry may be implemented in other embodiments; the disclosed example is not intended to limit the scope of the present disclosure.
Workload distribution bus 3150, in some embodiments, is configured to route control data for work distribution from logical slots to distributed slots. In some embodiments, bus 3150 is a scalable serial bus that is distinct from one or more interfaces or fabrics utilized to access the actual graphics data to be operated on.
mGPUs 320, in the illustrated embodiment, include respective distributed pixel control circuitry 3161, distributed geometry control circuitry 3162, distributed compute control circuitry 3163, and shader/texture/pixel circuitry 3164. The distributed control circuitry may handle execution of assigned kick portions using multiple distributed hardware slots per mGPU. The execution resources of circuitry 3164 may be replicated within a given mGPU (e.g., with instances corresponding to different distributed hardware slots). Further, some resources of circuitry 3164 may be shared by multiple types of work (e.g., shader resources) while other resources may be dedicated to work from certain primary controllers or certain operations (e.g., texture sampling). In some embodiments, each distributed controller controls a subset of distributed hardware slots of a given mGPU for its type of work (e.g., N slots for geometry work, M slots for pixel work, and P slots for compute work). As discussed in detail below with reference to
The illustrated example shows use of timestamps (“t=” values) to track movement of kicks through the system and a ring buffer structure for a given kick queue. These details are included for purposes of illustration, but are not intended to limit the scope of the present disclosure. In other embodiments, various queue data structures, timestamp encodings, dependency encodings, etc. may be utilized.
U.S. Pat. Appl. Ser. No. 18/055,111 filed Nov. 14, 2022 and titled “Initial Object Shader Run for Graphics Workload Distribution” describes example techniques for performing a parsing run of a geometry kick to determine segment boundaries (to split the kick into multiple segments for parallel processing on distributed slots). According to these techniques, a pre-parse set of work may execute on one or more distributed slots before distributing the work for actual parallel execution on a number of distributed slots. U.S. Pat. Appl. No. 17,805,607 filed Jun. 6, 2022 and titled “Distributed Geometry Processing and Tracking Closed Pages” describes techniques for stitching one or more data structures from different segments of a geometry kick.
In logical kickslot techniques for geometry work discussed below, kicks may be dynamically divided into an appropriate number of segments and processed on a subset of available distributed slots (e.g., segments may be launched as soon as distributed slots become available). In these embodiments, segments from multiple kicks may be processed in parallel (e.g., potentially segments from as many kicks as the number of mGPUs) and multiple kicks may stitch their segments in parallel. Further, unified primary parameter manager circuitry may allow mixing of geometry kick execution from different applications and multiple kicks from the same application in parallel. Disclosed techniques discussed below may be particularly advantageous in the context of applications (e.g., gaming titles) that send UI elements as large numbers of small draw calls being appended to a previous render. These applications may have a large number of small kicks mixed with larger kicks, and disclosed logical kickslot techniques may substantially improve geometry hardware utilization.
In the illustrated example, the processor includes primary geometry control 3132, primary parameter manager control 3310, workload distribution bus 3150, and mGPUs 320A-320N. In some embodiments, primary controller duties for geometry work are split between primary geometry control 3132 (which may handle the front end of the geometry pipeline) and primary parameter manager control 3310 (which may handle the back end of the geometry pipeline).
Primary geometry control 3132, in the illustrated embodiment, includes logical slots 3320, arbiter 3325, command stream pre-parser 3330, and scheduler 3335. Kickslot manager 350 may assign tracking slots to logical slots 3320. In some embodiments, the number of logical slots 3320 corresponds to at least the number of mGPUs+1 (with the extra logical slot being available for pre-parse work). Arbiter 3325, in some embodiments, is configured to arbitrate among logical slots to access mGPU resources. Primary geometry control 3132 may have knowledge of the occupancy and state of the distributed slots in the system and therefore determine which distributed slots are available to accept new work.
Command stream pre-parser 3330, in the illustrated embodiment, is configured to control pre-parsing operations, e.g., by generating pre-parse tasks for one or more distributed slots. Command stream pre-parser 3330 may strip certain operations from the command stream to generate the pre-parse work. Pre-parsing may run across all mGPUs (e.g., using a distributed slot in each), a single mGPU, or a proper subset of mGPUs. Scheduler 3335 is configured to send pre-parse or actual segment work to distributed slots 3360A-3360N in mGPUs 320, via workload distribution bus 3150. Once pre-parsed, a geometry kick may correspond to a stream of primitive segments followed by a termination marker.
In the illustrated example, each mGPU includes segment distributed slots 3360 and stitch distributed slots 3365. In some embodiments, a geometry kick is allowed to occupy up to one tracking slot, up to one logical slot 3320 in primary geometry control 3132, up to one segment distributed slot 3360 for kick execution in a given mGPU, up to one distributed slot 3360 for pre-parsing in a given mGPU, and up to one stitch distributed slot 3365 in a given mGPU.
In some embodiments, primary geometry control 3132 is configured to serially stream kicks (e.g., single-segment kicks) and segments to mGPUs such that the first segment of the next kick is not launched to an mGPU until the last segment of the current kick is launched.
Primary parameter manager control 3310, in the illustrated embodiment, is configured to control stitching operations using stitch distributed slots 3365. Primary parameter manager control 3310 may track completion of segments launched by primary geometry control 3132 and use stitch circuitry to stitch data structures for completed segments. In these embodiments, logical kickslot techniques are separately implemented for geometry tasks and stitching tasks. In the illustrated example, primary parameter manager control 3310 includes logical slot tracker 3340, arbiter 3345, stitch slots 3350, and scheduler 3355.
Logical slot tracker 3340 may track the status of logical slots 3320 and may assert a ready signal when one or more segments of a given logical slot are ready for stitching. In some embodiments, primary parameter manager control 3310 and primary geometry control 3132 utilize a direct interface connection for notification of stitching completion, logical slot completion, etc. Arbiter 3345 may select from among logical slots 3320 that are ready for stitching and assign stitching work to stitch slots 3350. For distributed stitching, scheduler 3355 is configured to schedule stitch work across one or more stitch distributed slots 3365 of mGPUs 320.
In some embodiments, stitching is performed at different granularities for different data structures. For example, in some embodiment stitch slots 3350 includes hardware configured to stitch one or more data structures and stitch distributed slots 3365 include hardware configured to stitch one or more other data structures. As one specific example, in some embodiments, stitch distributed slots 3365 are configured to stitch tile region array (RA) headers of kick segments together. In some embodiments, stitch slots 3350 are configured to stitch layer identifier caches (LIC) of kick segments (this stitching may be performed at the primary controller because it may affect region array stitching) and a list of closed pages (also referred to as an “A-list”) written by kick segments.
A layer identifier cache may allow the geometry processing phase to specify a layer of a final render target. For LIC stitching, the distributed slots 3360 working on a segment may update an LIC base address and initialize the base address at the start of the kick. Control 3310 may monitor a segment stitch mask and a segment start pointer to determine when a threshold number of segments are available for stitching. LIC stitching by a given stitch slot 3550 may involve adding a segment identifier times a fixed size to a base address and performing an atomic OR operation to a destination address associated with the layer cache base, for example. The LIC stitch may be performed prior to region array stitching because when layered rendering is enabled, only modified layers may need to have tiles stitched together across region array segments and non-modified layers may be skipped. Software may indicate a segment stitch mask that uses a segment identifier to determine an offset from a layer base address for reading each segment's LIC data. LIC stitching may be performed in the background relative to per-segment processing so that segment completion and launching is independent of LIC stitching.
Segment distributed slots 3360, in some embodiments, are configured to generate list of closed pages to which hardware for a given slot has finished writing. This may be referred to as an allocation list or (A-list). In some embodiments, this is a linked list of closed pages (LLCP). The first portion of an A-list page may be a header that includes a link to the next A-list page. A stitch slot 3350 may wait for a threshold number of segments to be ready for A-list stitching and then may update pointers of the segment A-list's last page to point to the first A-list page of the subsequent segment.
Note that, in some embodiments stitching is performed in stitch slots 3350 for relatively smaller data structures being stitched in memory (such as the LIC and A-list, as examples). Generally, stitching operations may be substantially affected by memory latencies (time to fetch data from memory and write stitched data back to memory). Therefore, larger structures such as the region array may be stitched in parallel by stitch distributed slots 3365 to utilize additional memory interfaces, as discussed in detail below.
In some embodiments, master stitcher circuitry is configured to coordinate the activities of various stitch hardware (there may be instance of the master stitcher per stitch slot 3350. In some embodiments, each stitch slot 3350 is responsible for stitching the closed page list, stitching the LIC, and scheduling region array stitches for mGPUs that had active segment distributed slots 3360 for the kick.
A region array may be used for tile-based deferred rendering (TBDR) in which tiling engine circuitry may bin geometry into tiles and generate control streams to be processed by fragment processing circuitry (e.g., with a number of per-tile linked lists). In some embodiments, a given stitch distributed slot 3365 corresponds to region array stitcher (RAS) circuitry that reads in region arrays produced by segment distributed slots 3360 from memory and stitches them back to a single region array for processing by fragment circuitry. The RAS may include a prefetch stage with a read memory interface, a latency hiding memory (e.g., a RAM), a decode stage, a stitch stage, and a write memory interface. In some embodiments, the RAS stitcher is triggered by a threshold number of segments completing their LIC stitching. In some embodiments, the primary parameter manager control 3310 provides information to the RAS stitchers such as a stitch command and an indication of whether the stitching is for the start of the kick or to append to previously-stitched segments (and may differentiate between initial start-of-kick stitched segments and post-partial render stitched segments).
The primary parameter manager control 3310 may also provide a RAS instance identifier, a count of RAS instance enabled for stitching, a count of segments to be stitched, a starting segment identifier, and a previous segment identifier (from the previous stitch set). This may allow each RAS circuit to determine which sets of region headers to stitch.
A given region array header may include a control stream pointer to the first control block of a tile, an index, whether the region array is empty and a shared field that indicates whether the tile shares control blocks with adjacent tiles. A stitch link pointer may include a control stream pointer to the next control block of the tile and a link terminate field that indicates whether to follow the pointer or that this is the last segment of a tile's list. The stitching algorithm may copy the control stream pointer of a region array header into the stitch link pointer of the previous segment.
Therefore, an RAS circuit may read data for its set of region array headers into its latency hiding memory and decode data in the memory and route it to the correct segment. The stitch stage may then perform the stitch algorithm and write results back to memory. In some embodiments, each RAS instance operates on complete memory cache lines, e.g., to avoid sharing cache lines across instances.
While primary geometry control 3132 may launch work in a serial fashion, primary parameter manager control 3310 may see work from multiple logical slots 3320 in parallel. Therefore, in some embodiments, primary parameter manager control 3310 is configured to handle logical slots correspond to up to the number of mGPUs in parallel (and these logical slots may be any combination of segmented and single-segment kicks). When the number of logical slots 3320 to be stitched is greater than the number of available stitch slots 3350, arbiter 3345 may utilize round-robin arbitration.
In some embodiments, control circuitry does not impose strict age-based ordering on completing work. Therefore, single-segment kicks (which may also be referred to as non-segmented kicks) may complete out of order with respect to segmented kicks and segmented kicks that complete faster may complete out of order relative to older, slower kicks.
In other embodiments (not shown in
In some embodiments, the processor supports various software overrides for geometry work, e.g., to force a kick to only schedule on certain group(s) of mGPUs, scheduling overrides (e.g., to change the type of scheduling between round robin and other types such as find-first, which targets the lowest-identifier available mGPU), a maximum number of mGPUs to be utilized for a given kick, etc.
In some embodiments, the processor is configured to execute segments from different geometry kicks in parallel only if the kicks do not share a parameter buffer.
At time TO in the illustrated example, primary geometry control 3132 has launched pre-parse tasks for kick 0 across the first distributed slot on all mGPUs. Once the segments are identified for kick 0 (three segments in this example), primary geometry control 3132 utilizes round-robin scheduling, starting at group 0, mGPU 0. Thus, at time TO, primary geometry control 3132 has launched pre-parsing for kick 1 across all mGPUs and the segments of kick 0 across mGPU0, mGPU1, and mGPU2. In this example, kick 1 includes at least eight segments. At time T2, primary geometry control 3132 has launched five of these segments into available mGPUs 3-7 while the remaining segments wait for available distributed slots.
At time T3, primary geometry control 3132 has launched segments from kick 1 across all mGPUs in the system (submitting segments from kick 1 as segments from kick 0 completed execution and distributed slots became available. In this example, each kick is allowed to use at most a single distributed slot per mGPU. In other embodiments, a kick may be allowed to use multiple distributed slots in a given mGPU. At time T4, primary geometry control 3132 has launched pre-parse tasks for kick 2 across all mGPUs and three segments for kick 1 are still executing.
In some embodiments, kickslot manager 350 supports a set of event flags (e.g., in GPU register space) that indicate dependencies on system events. Software may utilize various encodings to indicate dependencies of a kick on one or more event flags.
In the illustrated example, render A is assigned to tracking slot 0 and render C is assigned to tracking slot 2. Render C depends on render A (as shown in the tracking slot dependency matrix, which may be maintained in top slot circuitry 3030) and also depends on event flag field 0, as indicated by the dependency mask 0x1. In this example, software has assigned event flag field 0 so that external circuitry 3510 is able to indicate when buffer C is ready for render C. In this example, render C is not eligible for assignment to a logical slot until both dependencies have been satisfied (all tracking slots dependency matrix entries in the row for render C are cleared and the event flag 0 has been cleared).
In some embodiments, event flags may be used to stream image work across different circuitry of a processor or system on a chip. The following discussion explains example macro-tile level completion tracking for a frame of image data and example techniques for utilizing event flags across IP blocks.
In some embodiments, certain circuitry (such as fragment generator circuitry) may process tiles of a macro-tile before selecting the next macro-tile to schedule. Generally, it may be useful to break frames into smaller chunks of work such as macro-tiles. For example, this may allow demand-based rendering to generate only required regions of a given render at a time. As another example, slip streaming may process corresponding areas in multiple renders (e.g., sequential renders) to improve cache locality. As yet another example, this may allow breaking large kicks (e.g., a full frame render) into smaller kicks (e.g., a macro-tile render), which may facilitate GPU resource utilization by generating small kicks for selection to run on idle shader cores (which may be particularly useful using mGPU-granularity scheduling and start-when-ready techniques discussed above).
Utilizing event flags, a producer or consumer circuit IP is able to map available chunks of data (e.g., macro-tiles) into a format that they want to produce or consume. As initials examples, an event flag might correspond to a single macro-tile being ready. As other examples, an event flag might be mapped to various granularities.
In the example if
In various embodiments, disclosed event flag techniques may provide software with a flexible mechanism to indicate kick dependencies on system events (as well as on other kicks), which may facilitate various demand-based processing techniques discussed above.
Pipelining kicks may be useful to improve performance. Traditionally, dependent kicks may not be pipelined (rather, a parent kick must complete before a child kick is launched) to ensure that dependencies are satisfied. In disclosed embodiments discussed below, however, the spin-up portion of a dependent kick may be pipelined behind the spin-down portion of a parent kick. For example, a dependent kick release (DKR) signal may be routed from distributed shader circuitry to primary control circuitry and to kickslot manager 350, which may conditionally unblock a dependent kick. On some embodiments, a graphics driver may provide finer-grained dependency information to allow a determination that is safe to release a dependent kick, e.g., up to one or more stall points. The stall points may be referred to herein as shader “kick gates.”
Note that a given kick may include execution state load (ESL) program SIMD groups, which may be allowed to execute in certain situations without violating dependencies (e.g., dependencies associated with the main shader). In some embodiments, one kick gate may correspond to a point where the first ESL SIMD group has had resources allocated but has not executed instructions. This may be referred to as the ESL gate or early gate. Another kick gate may correspond to a point where the first main shader (non-ESL) SIMD group has had resources allocated but has not executed instructions. This may be referred to as the work gate or late gate.
In some embodiments, a dependent kick is allowed to proceed to the first kick gate when there is no known dependency between the first kick and the control stream, or indirects, of the parent kick (although there may be dependency to ESL data). In some embodiments, a dependent kick is allowed to proceed to the second kick gate when there is no known dependency between the dependent kick and the control stream, indirects, or ESL data of the parent kick. Generally, software may specify which one or more of N kick gates that a kick should be blocked by.
Note that these kick gates are included for purposes of explanation, but other kick gates may be implemented at various resource allocation or execution stages in other embodiments. Further, the listed dependencies are merely examples; different gates may correspond to various combinations of kick dependencies pending depending on the location of the gate within the dependent kick.
In some embodiments, kick gates are detected and enforced by hardware, based on the type of dependency for a given kick. Kickslot manager 350 may utilize such dependency information, in conjunction with status information from distributed shader circuitry, to pipeline dependent kicks. In other embodiments, software may provide dependency information that indicates one of multiple kick gates supported by hardware as a gate for a specific dependent kick.
In some embodiments, there are multiple types of DKR signals. For example, an early DKR may signal that the shader has launched all SIMD groups for a kick (e.g., from token parser circuitry to tile and threadgroup manager circuitry). Token parser circuitry, in some embodiments, is configured to receive work tokens from multiple primary controllers, form SIMD groups, and interact with allocator circuitry to allocate pages for private memory. Tile and threadgroup manager circuitry, in some embodiments, is configured to coordinate execution of SIMD groups within a tile (e.g., for pixel work) or threadgroup (e.g., for compute work). This may include enforcing various types of synchronization, for example. SIMD group scheduler circuitry may then select from ready SIMD groups to schedule them for execution. These specific circuit examples are included for purposes of illustration, but DKR signals may be initiated at various appropriate execution points in other embodiments.
A late DKR may signal that the shader has finished executing all SIMD groups for a kick. In some embodiments, the early DKR is not used for kicks that depend on compute or geometry kicks. Note that these release signals are included for purposes of explanation, but other release points may be implemented at various resource launch or execution stages in other embodiments (e.g., signals for a threshold number of SIMD groups remaining that have not launched or executed, etc.). An end of kick signal may indicate that all fences, flushes, etc. for the kick are complete.
In various embodiments, disclosed dependent kick pipelining techniques may reduce cycle costs (e.g., associated with fixed-function hardware and memory latency) corresponding to ramp-up to the first shader execution for kicks as well as ramp-down after the last shader instruction has executed. This may advantageously improve overall performance, in some embodiments. Further, faster execution of dependent kicks may free up resources for various disclosed kick streaming and scheduling techniques, which may further improve utilization.
In the illustrated example, the spin-up portion of fragment kick B corresponds to the portion between the start of the kick and the late kick gate. This may include operations such as region array fetch, control stream and primitive block fetch, rasterization, and ESL. As shown, kickslot manager may initiate the dependent kick B after the early DKR signal from fragment kick A. In this example, part of the spin-up portion of fragment kick B is hidden, reducing overall processing time of kick A and kick B, relative to waiting to initiate kick B until kick A has completed.
Note that if fragment kick B were to reach a kick gate prior to the corresponding release from fragment kick A, it would stall, in some embodiments.
As shown, kickslot manager 350 is configured to wait to initiate dependent kick B until receiving the late DKR signal from the compute kick. Note that this may allow pipelining to operate in the context of preemption. In this example, the compute kick can be preempted between the early and late DKR signals. Note that at some point in fragment kick B, it is too late to context switch without data dependency ordering problems. Therefore, in some embodiments, kicks that depend on certain other types of kicks may not be initiated until the late DKR signal (unlike the example of
Signal 1, in the illustrated example, is an early DKR signal based on processing of fragment kick A. This satisfies the soft dependency on kick A. Signal 2 is a late DKR signal from kick B, which satisfies the soft dependency on kick B. Signal 3 is an end-of-kernel (EOK) signal from kick C, which satisfies the hard dependency.
At 4, kickslot manager 350 starts kick D due to signals 1-3. After the spin-up interval, kick D reaches a kick gate and stalls.
Signal 5, in the illustrated example, is an EOK signal for kick B and signal 6 is an EOK signal for kick A. These two signals allow the kick gate to unlock and kick D to proceed with execution. Note that, had the EOK from fragment kick A been received prior to the kick gate, fragment D could have proceeded immediately with executing after spinning up, without the stall shown in this example.
Note that multiple kicks may depend from the same parent kick (e.g., a fragment kick and a compute kick may depend on another fragment kick). Therefore, multiple kicks may be allowed to spin-up based on one DKR from the parent kick.
In some embodiments, kickslot manager 350 implements a soft dependency field. In some embodiments, when programming execute phase registers for a kick, software includes a gate lock as discussed above for dependent kicks.
In some embodiments, to generate DKR signals, distributed control circuitry may aggregate early DKR signals from shaders and send them to primary control circuitry for further aggregation. When the primary control circuitry detects reception of early DKR signals for all assigned shaders for a kick, it may generate an early DKR signal to kickslot manager 350. Primary control circuitry may generate a late DKR signal when all work dispatches, tiles, or geometry for a given kick are known to be completed (and may also send end-of-kick requests such as cache flush invalidate, memory allocator cleanup, etc. at this point). The shaders may receive a token denoting the last work token in a kick, which may allow them to generate early DKR signals.
At 4310, in the illustrated embodiment, queue access circuitry (e.g., queue access circuitry 4820) accesses a data structure in memory (e.g., in DRAM 3110) that specifies multiple queues (e.g., queues 4810), where respective queues enqueue control information for multiple sets of graphics work.
At 4320, in the illustrated embodiment, queue select circuitry (e.g., queue select logic 3020) selects sets of graphics work from the data structure based on one or more selection parameters and stores control information for selected sets of graphics work in tracking slots (e.g., top slot circuitry 3030).
In some embodiments, the selection parameters include a work category parameter included in the data structure for a given set of graphics work, where the work category parameter indicates whether a given set of graphics work is compute work, fragment work, or geometry work. In some embodiments, the selection parameters include a resources available parameter provided by the graphics processor circuitry, where the resources available parameter indicates availability of different graphics processor hardware resources. In some embodiments, the selection parameters include a priority parameter included in the data structure for a given queue, where different queues have different priority parameter values. In some embodiments, the selection parameters include a deadline parameter included in the data structure for a given set of graphics work.
In some embodiments, the selection parameters include a dependency parameter included in the data structure for a given set of graphics work, where the dependency parameter indicates one or more other sets of graphics work on which the given set of graphics work depends. In some embodiments, a dependency parameter for a given set of graphics work includes a set of parent identifiers and a valid parents mask indicating which parent identifiers are valid, and the dependency parameter is specified in a manner that is independent of tracking slots to which sets of graphics work are assigned. In some embodiments, one or more dependency parameters indicate at least one parent that is in a different queue than the given set of graphics work. In some embodiments, the queue select circuitry is configured to pause selection from a first queue and select sets of graphics work from a second queue in response to a dependency parameter that indicates a dependency of a set of work in the first queue on a set of work in the second queue.
In some embodiments, the selection parameters include an event flag parameter included in the data structure for a given set of graphics work, the event flag parameter indicates one or more software-programmable event flags on which the set of graphics work depends, and the queue select circuitry is configured to pause selection from a first queue based on a set of graphics work waiting for one or more event flags. In some embodiments, at least one of the event flags is encoded as a counter value. In some embodiments, a group of sets of graphics work are not dependent on one another, are included in at least two different queues, and target a first hardware resource, and a launched set of graphics work in the group sets an event flag to acquire the hardware resource and prevent other sets of graphics work from launching until the event flag is cleared.
At 4330, in the illustrated embodiment, distribution circuitry (e.g., primary control circuitry 210, kickslot manager 305, or both) assigns portions of respective sets of graphics work from the tracking slots to graphics processor circuitry for execution.
In some embodiments, another processor of the apparatus is configured to perform image processing on graphics frame data generated by the graphics processor circuitry, and the apparatus is configured to execute program instructions to utilize event flag parameters to indicate when subsets of a frame of graphics data have completed processing by the other processor and are ready for the graphics processor circuitry. In some embodiments, the apparatus is configured to control at least one event based on tasks performed by one or more other circuit components of the apparatus that are external to the graphics processing circuitry.
In some embodiments, the graphics processor circuitry includes control circuitry configured to control a partial render procedure, including to: halt all sets of graphics work that dependent on a geometry set of work, schedule a first copy of a fragment set of work that operates on data from the geometry set of work, restart the geometry set of work subsequent to execution of the first copy of the fragment set of work, and configure a second copy of the fragment set of work to resume from a partial render image generated by the first copy of the fragment set of work. In some embodiments, the graphics processor circuitry includes control circuitry configured to control which sets of graphics work trigger interrupts on completion.
In some embodiments, the graphics processor circuitry includes control circuitry configured to write result data for completed sets of graphics work to completion queue structures in memory. In some embodiments, the control circuitry is configured to write result data to multiple different completion queues with different priorities. In some embodiments, the control circuitry is configured to write result data to different completion queues based on whether a given set of graphics work completed normally. In some embodiments, the control circuitry is further configured to program a set of registers indicated by a set of graphics work in response to completion of the set of graphics work. In some embodiments, the graphics processor circuitry is configured to execute firmware to provide one or more of the sets of graphics work for a queue in the data structure.
In some embodiments, memory circuitry stores the data structure and processor executes program instructions to add control information to queues of the data structure. In some embodiments, a plurality of single-instruction multiple-data pipelines executes instructions, and fixed-function circuitry controls the single-instruction multiple-data pipelines to perform operations for at least one of the following types of programs: graphics shader programs, and machine learning programs.
At 4410, in the illustrated embodiment, control circuitry (e.g., primary control circuitry 210) determines that a full number of distributed hardware slots to be utilized by a set of graphics work is not available.
At 4410, control circuitry assigns respective portions of a set of graphics work from a logical slot (e.g., logical slot 215) to distributed hardware slots (e.g., distributed hardware slots 230) based on control information for the set of graphics work. In the illustrated embodiment, this includes assigning a proper sub-set of portions of the set of graphics work to available distributed hardware slots in response to the determination of element 4410.
In some embodiments, the plurality of logical slots include one or more slots dedicated for one or more types of graphics work. In some embodiments, control circuitry assigns a first set of geometry work to N-1 of N graphics processor sub-units of the apparatus and assigns a second set of work to a single remaining graphics processor sub-unit of the apparatus.
In some embodiments, the controller supports allocating any determined integer number of graphics processor sub-units in a range from one processor sub-unit to a total number of processor sub-units included in the apparatus. The range may include one or more integer numbers of graphics processor sub-units that are not powers of two.
In some embodiments, the set of graphics work is a fragment processing set of graphics work and the control circuitry is configured to determine the number of graphics processor sub-units based on a number of tiles included in the set of graphics work, or based on a number of pixels included in the set of graphics work. In some embodiments, the set of graphics work is a compute set of graphics work and the control circuitry is configured to determine the number of graphics processor sub-units based on a number of workgroups, work items, or both included in the set of graphics work. In some embodiments, the set of graphics work is a geometry set of graphics work and the control circuitry is configured to determine the number of graphics processor sub-units based on one or more of the following parameters: a number of primitives included in the set of graphics work, a number of vertices included in the set of graphics work, and a determined complexity of the set of graphics work.
In some embodiments, control circuitry, for a portion of the set of graphics work to be assigned, attempts to obtain a distributed hardware slot in a graphics processor sub-unit that does not currently have a distributed hardware slot assigned to the logical slot, and in response to failure of the attempt, sends the portion of the set of graphics work to an already-owned distributed hardware slot for the logical slot.
In some embodiments, control circuitry executes the set of graphics work using a smaller number of distributed hardware slots than a determined number of hardware slots for the set of graphics work and may, in some embodiments, execute multiple portions of the set of graphics work using the same distributed hardware slot. In some embodiments, control circuitry implements a no-overlap mode in which different portions of the same set of graphics work cannot be assigned to the same distributed hardware slot.
In some embodiments, control circuitry tracks runtime for portions of the set of graphics work in respective distributed hardware slots and stores the tracked runtimes using one or more techniques of the following techniques: 1) aggregating the tracked runtimes into a single runtime count, or 2) writing the tracked runtimes to a completion buffer. In some embodiments, the control circuitry is further configured to, in response to a context store, store information that indicates which distributed hardware slots were in use by the logical slot, and in response to a context load, wait for the indicated distributed hardware slots to be allocated before proceeding to execute the set of graphics work.
At 4510, in the illustrated embodiment, control circuitry assigns a parse version of a set of geometry work to distributed hardware slots (e.g., distributed hardware slots 230) of one or more of the graphics processor sub-units (e.g., sub-units 220).
In some embodiments, control circuitry is configured to assign parse work for the set of geometry work to at most one distributed hardware slot of a given graphics processor sub-unit and assign segment execution work to at most one distributed hardware slot of a given graphics processor sub-unit. In some embodiments, control circuitry assigns the parse version to all graphics processor sub-units in a set of graphics processor sub-units, and serially assigns segments of the determined number of segments to available graphics processor sub-units in the set.
At 4520, in the illustrated embodiment, control circuitry determines a number of segments for the set of geometry work based on execution of the parse version.
In some embodiments, control circuitry dynamically changes the number of distributed hardware slots assigned to the set of geometry work during execution of the set of geometry work.
At 4530, in the illustrated embodiment, control circuitry assigns determined segments to distributed hardware slots of respective graphics processor sub-units for execution.
In some embodiments, control circuitry allows different sets of geometry work to execute in parallel on different distributed hardware slots only if the different sets of geometry work share a parameter buffer.
At 4540, in the illustrated embodiment, stitch circuitry (e.g., stitch circuitry 4930) stitches results of the segments processed by the assigned distributed hardware slots.
In some embodiments, stitch circuitry is configured to stitch results on multiple graphics processor sub-units that were assigned a segment for the set of geometry work. In some embodiments, stitch circuitry includes stitch control circuitry configured to assign stitch work for one or more first data structure categories to hardware stitch slots in primary control circuitry and assign stitch work for one or more second data structure categories to distributed hardware stitch slots in respective graphics processor sub-units, where the distributed hardware stitch slots include respective memory interfaces to access a memory that stores data structures to be stitched. In some embodiments, the one or more first data structure categories utilize less memory space than the one or more second data structure categories. In some embodiments, the one or more first data structure categories include a layer identifier cache and a list of closed pages, and one or more second data structure categories include tile region array headers.
At 4610, in the illustrated embodiment, control circuitry (e.g., kickslot manager 350) receives different sets of graphics work and schedule sets of graphics work for execution on distributed hardware resources, including a first set of work that depends on a second set of work.
At 4620, in the illustrated embodiment, control circuitry initiates processing of the first set of work in response to a release signal from the second set of work that indicates that the second set of work has reached a first processing point.
At 4630, in the illustrated embodiment, control circuitry stalls processing of the first set of work in response to reaching a gate point in the first set of work.
At 4640, in the illustrated embodiment, control circuitry resumes processing of the first set of work in response to an end signal for the second set of work.
In some embodiments, the method of
At 4710, in the illustrated embodiment, a computing device determines a first dependency of a first set of graphics work on a second set of graphics work.
At 4720, in the illustrated embodiment, the device determines a second dependency of a third set of graphics work on a fourth set of graphics work.
At 4730, in the illustrated embodiment, the device specifies a soft dependency for the first set of graphics work based on determining that an initial portion of the first set of graphics work does not depend on the second set of graphics work.
At 4740, in the illustrated embodiment, the device specifies a hard dependency for the third set of graphics work.
In some embodiments, the devices generates release and gate information associated with hard and soft dependencies.
The following numbered clauses set out various non-limiting embodiments disclosed herein:
A1. An apparatus, comprising:
write result data for completed sets of graphics work to completion queue structures in memory.
A17. The apparatus of clause A16, wherein the control circuitry is configured to write result data to multiple different completion queues with different priorities.
A18. The apparatus of clause A16, wherein the control circuitry is configured to write result data to different completion queues based on whether a given set of graphics work completed normally.
A19. The apparatus of clause A16, wherein the control circuitry is further configured to program a set of registers indicated by a set of graphics work in response to completion of the set of graphics work.
A20. The apparatus of any previous clause within set A, wherein the graphics processor circuitry is configured to execute firmware to provide one or more of the sets of graphics work for a queue in the data structure.
A21. The apparatus of any previous clause within set A, further comprising:
B1. An apparatus, comprising:
any combination of the elements recited in any previous clause within set B.
B16. A method, comprising any combination of the operations performed by the apparatus of any previous clause within set B.
C1. An apparatus, comprising:
assign parse work for the set of geometry work to at most one distributed hardware slot of a given graphics processor sub-unit; and
assign segment execution work to at most one distributed hardware slot of a given graphics processor sub-unit.
C6. The apparatus of any previous clause within set C, wherein the control circuitry is configured to:
any combination of the elements recited in any previous clause within set C.
C11. A method, comprising any combination of the operations performed by the apparatus of any previous clause within set C.
D1. An apparatus, comprising:
The concept of “execution” is broad and may refer to 1) processing of an instruction throughout an execution pipeline (e.g., through fetch, decode, execute, and retire stages) and 2) processing of an instruction at an execution unit or execution subsystem of such a pipeline (e.g., an integer execution unit or a load-store unit). The latter meaning may also be referred to as “performing” the instruction. Thus, “performing” an add instruction refers to adding two operands to produce a result, which may, in some embodiments, be accomplished by a circuit at an execute stage of a pipeline (e.g., an execution unit). Conversely, “executing” the add instruction may refer to the entirety of operations that occur throughout the pipeline as a result of the add instruction. Similarly, “performing” a “load” instruction may include retrieving a value (e.g., from a cache, memory, or stored result of another instruction) and storing the retrieved value into a register or other location.
As used herein the terms “complete” and “completion” in the context of an instruction refer to commitment of the instruction's result(s) to the architectural state of a processor or processing element. For example, completion of an add instruction includes writing the result of the add instruction to a destination register. Similarly, completion of a load instruction includes writing a value (e.g., a value retrieved from a cache or memory) to a destination register or a representation thereof.
The concept of a processor “pipeline” is well understood, and refers to the concept of splitting the “work” a processor performs on instructions into multiple stages. In some embodiments, instruction decode, dispatch, execution (i.e., performance), and retirement may be examples of different pipeline stages. Many different pipeline architectures are possible with varying orderings of elements/portions. Various pipeline stages perform such steps on an instruction during one or more processor clock cycles, then pass the instruction or operations associated with the instruction on to other stages for further processing.
Referring now to
Fabric 5010 may include various interconnects, buses, MUX's, controllers, etc., and may be configured to facilitate communication between various elements of device 5000. In some embodiments, portions of fabric 5010 may be configured to implement various different communication protocols. In other embodiments, fabric 5010 may implement a single communication protocol and elements coupled to fabric 5010 may convert from the single communication protocol to other communication protocols internally.
In the illustrated embodiment, compute complex 5020 includes bus interface unit (BIU) 5025, cache 5030, and cores 5035 and 5040. In various embodiments, compute complex 5020 may include various numbers of processors, processor cores and caches. For example, compute complex 5020 may include 1, 2, or 4 processor cores, or any other suitable number. In one embodiment, cache 5030 is a set associative L2 cache. In some embodiments, cores 5035 and 5040 may include internal instruction and data caches. In some embodiments, a coherency unit (not shown) in fabric 5010, cache 5030, or elsewhere in device 5000 may be configured to maintain coherency between various caches of device 5000. BIU 5025 may be configured to manage communication between compute complex 5020 and other elements of device 5000. Processor cores such as cores 5035 and 5040 may be configured to execute instructions of a particular instruction set architecture (ISA) which may include operating system instructions and user application instructions. These instructions may be stored in computer readable medium such as a memory coupled to memory controller 5045 discussed below.
As used herein, the term “coupled to” may indicate one or more connections between elements, and a coupling may include intervening elements. For example, in
Cache/memory controller 5045 may be configured to manage transfer of data between fabric 5010 and one or more caches and memories. For example, cache/memory controller 5045 may be coupled to an L3 cache, which may in turn be coupled to a system memory. In other embodiments, cache/memory controller 5045 may be directly coupled to a memory. In some embodiments, cache/memory controller 5045 may include one or more internal caches. Memory coupled to controller 5045 may be any type of volatile memory, such as dynamic random access memory (DRAM), synchronous DRAM (SDRAM), double data rate (DDR, DDR2, DDR3, etc.) SDRAM (including mobile versions of the SDRAMs such as mDDR3, etc., and/or low power versions of the SDRAMs such as LPDDR4, etc.), RAMBUS DRAM (RDRAM), static RAM (SRAM), etc. One or more memory devices may be coupled onto a circuit board to form memory modules such as single inline memory modules (SIMMs), dual inline memory modules (DIMMs), etc. Alternatively, the devices may be mounted with an integrated circuit in a chip-on-chip configuration, a package-on-package configuration, or a multi-chip module configuration. Memory coupled to controller 5045 may be any type of non-volatile memory such as NAND flash memory, NOR flash memory, nano RAM (NRAM), magneto-resistive RAM (MRAM), phase change RAM (PRAM), Racetrack memory, Memristor memory, etc. As noted above, this memory may store program instructions executable by compute complex 5020 to cause the computing device to perform functionality described herein.
Graphics unit 5075 may include one or more processors, e.g., one or more graphics processing units (GPUs). Graphics unit 5075 may receive graphics-oriented instructions, such as OPENGL®, Metal®, or DIRECT3D® instructions, for example. Graphics unit 5075 may execute specialized GPU instructions or perform other operations based on the received graphics-oriented instructions. Graphics unit 5075 may generally be configured to process large blocks of data in parallel and may build images in a frame buffer for output to a display, which may be included in the device or may be a separate device. Graphics unit 5075 may include transform, lighting, triangle, and rendering engines in one or more graphics processing pipelines. Graphics unit 5075 may output pixel information for display images. Graphics unit 5075, in various embodiments, may include programmable shader circuitry which may include highly parallel execution cores configured to execute graphics programs, which may include pixel tasks, vertex tasks, and compute tasks (which may or may not be graphics-related).
Display unit 5065 may be configured to read data from a frame buffer and provide a stream of pixel values for display. Display unit 5065 may be configured as a display pipeline in some embodiments. Additionally, display unit 5065 may be configured to blend multiple frames to produce an output frame. Further, display unit 5065 may include one or more interfaces (e.g., MIPI® or embedded display port (eDP)) for coupling to a user display (e.g., a touchscreen or an external display).
I/O bridge 5050 may include various elements configured to implement: universal serial bus (USB) communications, security, audio, and low-power always-on functionality, for example. I/O bridge 5050 may also include interfaces such as pulse-width modulation (PWM), general-purpose input/output (GPIO), serial peripheral interface (SPI), and inter-integrated circuit (I2C), for example. Various types of peripherals and devices may be coupled to device 5000 via I/O bridge 5050.
In some embodiments, device 5000 includes network interface circuitry (not explicitly shown), which may be connected to fabric 5010 or I/O bridge 5050. The network interface circuitry may be configured to communicate via various networks, which may be wired, wireless, or both. For example, the network interface circuitry may be configured to communicate via a wired local area network, a wireless local area network (e.g., via Wi-Fi™), or a wide area network (e.g., the Internet or a virtual private network). In some embodiments, the network interface circuitry is configured to communicate via one or more cellular networks that use one or more radio access technologies. In some embodiments, the network interface circuitry is configured to communicate using device-to-device communications (e.g., Bluetooth® or Wi-Fi™ Direct), etc. In various embodiments, the network interface circuitry may provide device 5000 with connectivity to various types of other devices and networks.
Turning now to
Similarly, disclosed elements may be utilized in a wearable device 5160, such as a smartwatch or a health-monitoring device. Smartwatches, in many embodiments, may implement a variety of different functions—for example, access to email, cellular service, calendar, health monitoring, etc. A wearable device may also be designed solely to perform health-monitoring functions, such as monitoring a user's vital signs, performing epidemiological functions such as contact tracing, providing communication to an emergency medical service, etc. Other types of devices are also contemplated, including devices worn on the neck, devices implantable in the human body, glasses or a helmet designed to provide computer-generated reality experiences such as those based on augmented and/or virtual reality, etc.
System or device 5100 may also be used in various other contexts. For example, system or device 5100 may be utilized in the context of a server computer system, such as a dedicated server or on shared hardware that implements a cloud-based service 5170. Still further, system or device 5100 may be implemented in a wide range of specialized everyday devices, including devices 5180 commonly found in the home such as refrigerators, thermostats, security cameras, etc. The interconnection of such devices is often referred to as the “Internet of Things” (IoT). Elements may also be implemented in various modes of transportation. For example, system or device 5100 could be employed in the control systems, guidance systems, entertainment systems, etc. of various types of vehicles 5190.
The applications illustrated in
The present disclosure has described various example circuits in detail above. It is intended that the present disclosure cover not only embodiments that include such circuitry, but also a computer-readable storage medium that includes design information that specifies such circuitry. Accordingly, the present disclosure is intended to support claims that cover not only an apparatus that includes the disclosed circuitry, but also a storage medium that specifies the circuitry in a format that programs a computing system to generate a simulation model of the hardware circuit, programs a fabrication system configured to produce hardware (e.g., an integrated circuit) that includes the disclosed circuitry, etc. Claims to such a storage medium are intended to cover, for example, an entity that produces a circuit design, but does not itself perform complete operations such as: design simulation, design synthesis, circuit fabrication, etc.
In the illustrated example, computing system 5240 processes the design information to generate both a computer simulation model of a hardware circuit 5260 and lower-level design information 5250. In other embodiments, computing system 5240 may generate only one of these outputs, may generate other outputs based on the design information, or both. Regarding the computing simulation, computing system 5240 may execute instructions of a hardware description language that includes register transfer level (RTL) code, behavioral code, structural code, or some combination thereof. The simulation model may perform the functionality specified by the design information, facilitate verification of the functional correctness of the hardware design, generate power consumption estimates, generate timing estimates, etc.
In the illustrated example, computing system 5240 also processes the design information to generate lower-level design information 5250 (e.g., gate-level design information, a netlist, etc.). This may include synthesis operations, as shown, such as constructing a multi-level network, optimizing the network using technology-independent techniques, technology dependent techniques, or both, and outputting a network of gates (with potential constraints based on available gates in a technology library, sizing, delay, power, etc.). Based on lower-level design information 5250 (potentially among other inputs), semiconductor fabrication system 5220 is configured to fabricate an integrated circuit 5230 (which may correspond to functionality of the simulation model 5260). Note that computing system 5240 may generate different simulation models based on design information at various levels of description, including information 5250, 5215, and so on. The data representing design information 5250 and model 5260 may be stored on medium 5210 or on one or more other media.
In some embodiments, the lower-level design information 5250 controls (e.g., programs) the semiconductor fabrication system 5220 to fabricate the integrated circuit 5230. Thus, when processed by the fabrication system, the design information may program the fabrication system to fabricate a circuit that includes various circuitry disclosed herein.
Non-transitory computer-readable storage medium 5210, may comprise any of various appropriate types of memory devices or storage devices. Non-transitory computer-readable storage medium 5210 may be an installation medium, e.g., a CD-ROM, floppy disks, or tape device; a computer system memory or random access memory such as DRAM, DDR RAM, SRAM, EDO RAM, Rambus RAM, etc.; a non-volatile memory such as a Flash, magnetic media, e.g., a hard drive, or optical storage; registers, or other similar types of memory elements, etc. Non-transitory computer-readable storage medium 5210 may include other types of non-transitory memory as well or combinations thereof. Accordingly, non-transitory computer-readable storage medium 5210 may include two or more memory media; such media may reside in different locations-for example, in different computer systems that are connected over a network.
Design information 5215 may be specified using any of various appropriate computer languages, including hardware description languages such as, without limitation: VHDL, Verilog, SystemC, System Verilog, RHDL, M, MyHDL, etc. The format of various design information may be recognized by one or more applications executed by computing system 5240, semiconductor fabrication system 5220, or both. In some embodiments, design information may also include one or more cell libraries that specify the synthesis, layout, or both of integrated circuit 5230. In some embodiments, the design information is specified in whole or in part in the form of a netlist that specifies cell library elements and their connectivity. Design information discussed herein, taken alone, may or may not include sufficient information for fabrication of a corresponding integrated circuit. For example, design information may specify the circuit elements to be fabricated but not their physical layout. In this case, design information may be combined with layout information to actually fabricate the specified circuitry.
Integrated circuit 5230 may, in various embodiments, include one or more custom macrocells, such as memories, analog or mixed-signal circuits, and the like. In such cases, design information may include information related to included macrocells. Such information may include, without limitation, schematics capture database, mask design data, behavioral models, and device or transistor level netlists. Mask design data may be formatted according to graphic data system (GDSII), or any other suitable format.
Semiconductor fabrication system 5220 may include any of various appropriate elements configured to fabricate integrated circuits. This may include, for example, elements for depositing semiconductor materials (e.g., on a wafer, which may include masking), removing materials, altering the shape of deposited materials, modifying materials (e.g., by doping materials or modifying dielectric constants using ultraviolet processing), etc. Semiconductor fabrication system 5220 may also be configured to perform various testing of fabricated circuits for correct operation.
In various embodiments, integrated circuit 5230 and model 5260 are configured to operate according to a circuit design specified by design information 5215, which may include performing any of the functionality described herein. For example, integrated circuit 5230 may include any of various elements shown in
As used herein, a phrase of the form “design information that specifies a design of a circuit configured to . . . ” does not imply that the circuit in question must be fabricated in order for the element to be met. Rather, this phrase indicates that the design information describes a circuit that, upon being fabricated, will be configured to perform the indicated actions or will include the specified components. Similarly, stating “instructions of a hardware description programming language” that are “executable” to program a computing system to generate a computer simulation model” does not imply that the instructions must be executed in order for the element to be met, but rather specifies characteristics of the instructions. Additional features relating to the model (or the circuit represented by the model) may similarly relate to characteristics of the instructions, in this context. Therefore, an entity that sells a computer-readable medium with instructions that satisfy recited characteristics may provide an infringing product, even if another entity actually executes the instructions on the medium.
Note that a given design, at least in the digital logic context, may be implemented using a multitude of different gate arrangements, circuit technologies, etc. As one example, different designs may select or connect gates based on design tradeoffs (e.g., to focus on power consumption, performance, circuit area, etc.). Further, different manufacturers may have proprietary libraries, gate designs, physical gate implementations, etc. Different entities may also use different tools to process design information at various layers (e.g., from behavioral specifications to physical layout of gates).
Once a digital logic design is specified, however, those skilled in the art need not perform substantial experimentation or research to determine those implementations. Rather, those of skill in the art understand procedures to reliably and predictably produce one or more circuit implementations that provide the function described by the design information. The different circuit implementations may affect the performance, area, power consumption, etc. of a given design (potentially with tradeoffs between different design goals), but the logical function does not vary among the different circuit implementations of the same circuit design.
In some embodiments, the instructions included in the design information instructions provide RTL information (or other higher-level design information) and are executable by the computing system to synthesize a gate-level netlist that represents the hardware circuit based on the RTL information as an input. Similarly, the instructions may provide behavioral information and be executable by the computing system to synthesize a netlist or other lower-level design information. The lower-level design information may program fabrication system 5220 to fabricate integrated circuit 5230.
The various techniques described herein may be performed by one or more computer programs. The term “program” is to be construed broadly to cover a sequence of instructions in a programming language that a computing device can execute. These programs may be written in any suitable computer language, including lower-level languages such as assembly and higher-level languages such as Python. The program may written in a compiled language such as C or C++, or an interpreted language such as JavaScript.
Program instructions may be stored on a “computer-readable storage medium” or a “computer-readable medium” in order to facilitate execution of the program instructions by a computer system. Generally speaking, these phrases include any tangible or non-transitory storage or memory medium. The terms “tangible” and “non-transitory” are intended to exclude propagating electromagnetic signals, but not to otherwise limit the type of storage medium. Accordingly, the phrases “computer-readable storage medium” or a “computer-readable medium” are intended to cover types of storage devices that do not necessarily store information permanently (e.g., random access memory (RAM)). The term “non-transitory,” accordingly, is a limitation on the nature of the medium itself (i.e., the medium cannot be a signal) as opposed to a limitation on data storage persistency of the medium (e.g., RAM vs. ROM).
The phrases “computer-readable storage medium” and “computer-readable medium” are intended to refer to both a storage medium within a computer system as well as a removable medium such as a CD-ROM, memory stick, or portable hard drive. The phrases cover any type of volatile memory within a computer system including DRAM, DDR RAM, SRAM, EDO RAM, Rambus RAM, etc., as well as non-volatile memory such as magnetic media, e.g., a hard drive, or optical storage. The phrases are explicitly intended to cover the memory of a server that facilitates downloading of program instructions, the memories within any intermediate computer system involved in the download, as well as the memories of all destination computing devices. Still further, the phrases are intended to cover combinations of different types of memories.
In addition, a computer-readable medium or storage medium may be located in a first set of one or more computer systems in which the programs are executed, as well as in a second set of one or more computer systems which connect to the first set over a network. In the latter instance, the second set of computer systems may provide program instructions to the first set of computer systems for execution. In short, the phrases “computer-readable storage medium” and “computer-readable medium” may include two or more media that may reside in different locations, e.g., in different computers that are connected over a network.
The present disclosure includes references to “an “embodiment” or groups of “embodiments” (e.g., “some embodiments” or “various embodiments”). Embodiments are different implementations or instances of the disclosed concepts. References to “an embodiment,” “one embodiment,” “a particular embodiment,” and the like do not necessarily refer to the same embodiment. A large number of possible embodiments are contemplated, including those specifically disclosed, as well as modifications or alternatives that fall within the spirit or scope of the disclosure.
This disclosure may discuss potential advantages that may arise from the disclosed embodiments. Not all implementations of these embodiments will necessarily manifest any or all of the potential advantages. Whether an advantage is realized for a particular implementation depends on many factors, some of which are outside the scope of this disclosure. In fact, there are a number of reasons why an implementation that falls within the scope of the claims might not exhibit some or all of any disclosed advantages. For example, a particular implementation might include other circuitry outside the scope of the disclosure that, in conjunction with one of the disclosed embodiments, negates or diminishes one or more of the disclosed advantages. Furthermore, suboptimal design execution of a particular implementation (e.g., implementation techniques or tools) could also negate or diminish disclosed advantages. Even assuming a skilled implementation, realization of advantages may still depend upon other factors such as the environmental circumstances in which the implementation is deployed. For example, inputs supplied to a particular implementation may prevent one or more problems addressed in this disclosure from arising on a particular occasion, with the result that the benefit of its solution may not be realized. Given the existence of possible factors external to this disclosure, it is expressly intended that any potential advantages described herein are not to be construed as claim limitations that must be met to demonstrate infringement. Rather, identification of such potential advantages is intended to illustrate the type(s) of improvement available to designers having the benefit of this disclosure. That such advantages are described permissively (e.g., stating that a particular advantage “may arise”) is not intended to convey doubt about whether such advantages can in fact be realized, but rather to recognize the technical reality that realization of such advantages often depends on additional factors.
Unless stated otherwise, embodiments are non-limiting. That is, the disclosed embodiments are not intended to limit the scope of claims that are drafted based on this disclosure, even where only a single example is described with respect to a particular feature. The disclosed embodiments are intended to be illustrative rather than restrictive, absent any statements in the disclosure to the contrary. The application is thus intended to permit claims covering disclosed embodiments, as well as such alternatives, modifications, and equivalents that would be apparent to a person skilled in the art having the benefit of this disclosure.
For example, features in this application may be combined in any suitable manner. Accordingly, new claims may be formulated during prosecution of this application (or an application claiming priority thereto) to any such combination of features. In particular, with reference to the appended claims, features from dependent claims may be combined with those of other dependent claims where appropriate, including claims that depend from other independent claims. Similarly, features from respective independent claims may be combined where appropriate.
Accordingly, while the appended dependent claims may be drafted such that each depends on a single other claim, additional dependencies are also contemplated. Any combinations of features in the dependent that are consistent with this disclosure are contemplated and may be claimed in this or another application. In short, combinations are not limited to those specifically enumerated in the appended claims.
Where appropriate, it is also contemplated that claims drafted in one format or statutory type (e.g., apparatus) are intended to support corresponding claims of another format or statutory type (e.g., method).
Because this disclosure is a legal document, various terms and phrases may be subject to administrative and judicial interpretation. Public notice is hereby given that the following paragraphs, as well as definitions provided throughout the disclosure, are to be used in determining how to interpret claims that are drafted based on this disclosure.
References to a singular form of an item (i.e., a noun or noun phrase preceded by “a,” “an,” or “the”) are, unless context clearly dictates otherwise, intended to mean “one or more.” Reference to “an item” in a claim thus does not, without accompanying context, preclude additional instances of the item. A “plurality” of items refers to a set of two or more of the items.
The word “may” is used herein in a permissive sense (i.e., having the potential to, being able to) and not in a mandatory sense (i.e., must).
The terms “comprising” and “including,” and forms thereof, are open-ended and mean “including, but not limited to.”
When the term “or” is used in this disclosure with respect to a list of options, it will generally be understood to be used in the inclusive sense unless the context provides otherwise. Thus, a recitation of “x or y” is equivalent to “x or y, or both,” and thus covers 1) x but not y, 2) y but not x, and 3) both x and y. On the other hand, a phrase such as “either x or y, but not both” makes clear that “or” is being used in the exclusive sense.
A recitation of “w, x, y, or z, or any combination thereof” or “at least one of . . . w, x, y, and z” is intended to cover all possibilities involving a single element up to the total number of elements in the set. For example, given the set [w, x, y, z], these phrasings cover any single element of the set (e.g., w but not x, y, or z), any two elements (e.g., w and x, but not y or z), any three elements (e.g., w, x, and y, but not z), and all four elements. The phrase “at least one of . . . w, x, y, and z” thus refers to at least one element of the set [w, x, y, z], thereby covering all possible combinations in this list of elements. This phrase is not to be interpreted to require that there is at least one instance of w, at least one instance of x, at least one instance of y, and at least one instance of z.
Various “labels” may precede nouns or noun phrases in this disclosure. Unless context provides otherwise, different labels used for a feature (e.g., “first circuit,” “second circuit,” “particular circuit,” “given circuit,” etc.) refer to different instances of the feature. Additionally, the labels “first,” “second,” and “third” when applied to a feature do not imply any type of ordering (e.g., spatial, temporal, logical, etc.), unless stated otherwise.
The phrase “based on” or is used to describe one or more factors that affect a determination. This term does not foreclose the possibility that additional factors may affect the determination. That is, a determination may be solely based on specified factors or based on the specified factors as well as other, unspecified factors. Consider the phrase “determine A based on B.” This phrase specifies that B is a factor that is used to determine A or that affects the determination of A. This phrase does not foreclose that the determination of A may also be based on some other factor, such as C. This phrase is also intended to cover an embodiment in which A is determined based solely on B. As used herein, the phrase “based on” is synonymous with the phrase “based at least in part on.”
The phrases “in response to” and “responsive to” describe one or more factors that trigger an effect. This phrase does not foreclose the possibility that additional factors may affect or otherwise trigger the effect, either jointly with the specified factors or independent from the specified factors. That is, an effect may be solely in response to those factors, or may be in response to the specified factors as well as other, unspecified factors. Consider the phrase “perform A in response to B.” This phrase specifies that B is a factor that triggers the performance of A, or that triggers a particular result for A. This phrase does not foreclose that performing A may also be in response to some other factor, such as C. This phrase also does not foreclose that performing A may be jointly in response to B and C. This phrase is also intended to cover an embodiment in which A is performed solely in response to B. As used herein, the phrase “responsive to” is synonymous with the phrase “responsive at least in part to.” Similarly, the phrase “in response to” is synonymous with the phrase “at least in part in response to.”
Within this disclosure, different entities (which may variously be referred to as “units,” “circuits,” other components, etc.) may be described or claimed as “configured” to perform one or more tasks or operations. This formulation-[entity] configured to [perform one or more tasks]-is used herein to refer to structure (i.e., something physical). More specifically, this formulation is used to indicate that this structure is arranged to perform the one or more tasks during operation. A structure can be said to be “configured to” perform some task even if the structure is not currently being operated. Thus, an entity described or recited as being “configured to” perform some task refers to something physical, such as a device, circuit, a system having a processor unit and a memory storing program instructions executable to implement the task, etc. This phrase is not used herein to refer to something intangible.
In some cases, various units/circuits/components may be described herein as performing a set of tasks or operations. It is understood that those entities are “configured to” perform those tasks/operations, even if not specifically noted.
The term “configured to” is not intended to mean “configurable to.” An unprogrammed FPGA, for example, would not be considered to be “configured to” perform a particular function. This unprogrammed FPGA may be “configurable to” perform that function, however. After appropriate programming, the FPGA may then be said to be “configured to” perform the particular function.
For purposes of United States patent applications based on this disclosure, reciting in a claim that a structure is “configured to” perform one or more tasks is expressly intended not to invoke 35 U.S.C. § 112(f) for that claim element. Should Applicant wish to invoke Section 112(f) during prosecution of a United States patent application based on this disclosure, it will recite claim elements using the “means for” [performing a function] construct.
Different “circuits” may be described in this disclosure. These circuits or “circuitry” constitute hardware that includes various types of circuit elements, such as combinatorial logic, clocked storage devices (e.g., flip-flops, registers, latches, etc.), finite state machines, memory (e.g., random-access memory, embedded dynamic random-access memory), programmable logic arrays, and so on. Circuitry may be custom designed, or taken from standard libraries. In various implementations, circuitry can, as appropriate, include digital components, analog components, or a combination of both. Certain types of circuits may be commonly referred to as “units” (e.g., a decode unit, an arithmetic logic unit (ALU), functional unit, memory management unit (MMU), etc.). Such units also refer to circuits or circuitry.
The disclosed circuits/units/components and other elements illustrated in the drawings and described herein thus include hardware elements such as those described in the preceding paragraph. In many instances, the internal arrangement of hardware elements within a particular circuit may be specified by describing the function of that circuit. For example, a particular “decode unit” may be described as performing the function of “processing an opcode of an instruction and routing that instruction to one or more of a plurality of functional units,” which means that the decode unit is “configured to” perform this function. This specification of function is sufficient, to those skilled in the computer arts, to connote a set of possible structures for the circuit.
In various embodiments, as discussed in the preceding paragraph, circuits, units, and other elements may be defined by the functions or operations that they are configured to implement. The arrangement and such circuits/units/components with respect to each other and the manner in which they interact form a microarchitectural definition of the hardware that is ultimately manufactured in an integrated circuit or programmed into an FPGA to form a physical implementation of the microarchitectural definition. Thus, the microarchitectural definition is recognized by those of skill in the art as structure from which many physical implementations may be derived, all of which fall into the broader structure described by the microarchitectural definition. That is, a skilled artisan presented with the microarchitectural definition supplied in accordance with this disclosure may, without undue experimentation and with the application of ordinary skill, implement the structure by coding the description of the circuits/units/components in a hardware description language (HDL) such as Verilog or VHDL. The HDL description is often expressed in a fashion that may appear to be functional. But to those of skill in the art in this field, this HDL description is the manner that is used transform the structure of a circuit, unit, or component to the next level of implementational detail. Such an HDL description may take the form of behavioral code (which is typically not synthesizable), register transfer language (RTL) code (which, in contrast to behavioral code, is typically synthesizable), or structural code (e.g., a netlist specifying logic gates and their connectivity). The HDL description may subsequently be synthesized against a library of cells designed for a given integrated circuit fabrication technology, and may be modified for timing, power, and other reasons to result in a final design database that is transmitted to a foundry to generate masks and ultimately produce the integrated circuit. Some hardware circuits or portions thereof may also be custom-designed in a schematic editor and captured into the integrated circuit design along with synthesized circuitry. The integrated circuits may include transistors and other circuit elements (e.g., passive elements such as capacitors, resistors, inductors, etc.) and interconnect between the transistors and circuit elements. Some embodiments may implement multiple integrated circuits coupled together to implement the hardware circuits, and/or discrete elements may be used in some embodiments. Alternatively, the HDL design may be synthesized to a programmable logic array such as a field programmable gate array (FPGA) and may be implemented in the FPGA. This decoupling between the design of a group of circuits and the subsequent low-level implementation of these circuits commonly results in the scenario in which the circuit or logic designer never specifies a particular set of structures for the low-level implementation beyond a description of what the circuit is configured to do, as this process is performed at a different stage of the circuit implementation process.
The fact that many different low-level combinations of circuit elements may be used to implement the same specification of a circuit results in a large number of equivalent structures for that circuit. As noted, these low-level circuit implementations may vary according to changes in the fabrication technology, the foundry selected to manufacture the integrated circuit, the library of cells provided for a particular project, etc. In many cases, the choices made by different design tools or methodologies to produce these different implementations may be arbitrary.
Moreover, it is common for a single implementation of a particular functional specification of a circuit to include, for a given embodiment, a large number of devices (e.g., millions of transistors). Accordingly, the sheer volume of this information makes it impractical to provide a full recitation of the low-level structure used to implement a single embodiment, let alone the vast array of equivalent possible implementations. For this reason, the present disclosure describes structure of circuits using the functional shorthand commonly employed in the industry.
This application claims priority to U.S. Prov. Pat. Appl. No. 63/484,875 titled “Graphics Work Streaming Techniques for Distributed Architecture” filed on Feb. 14, 2023, U.S. Prov. Pat. Appl. No. 63/484,888 titled “Logical Slot to Distributed Hardware Slot Scheduling for Graphics Work” and filed on Feb. 14, 2023, U.S. Prov. Pat. Appl. No. 63/484,893 titled “Geometry Kick Distribution in Graphics Processor” filed on Feb. 14, 2023, and U.S. Prov. Pat. Appl. No. 63/484,897 titled “Pipeline Techniques for Dependent Graphics Kicks” filed on Feb. 14, 2023. Each of the above-referenced applications is hereby incorporated by reference as if entirely set forth herein. This application is related to the following U.S. Applications filed on ______: U.S. application Ser. No. ______ (Attorney Docket Number 2888-57201), U.S. application Ser. No. ______ (Attorney Docket Number 2888-58501), and U.S. application Ser. No. ______ (Attorney Docket Number 2888-58601).
| Number | Date | Country | |
|---|---|---|---|
| 63484875 | Feb 2023 | US | |
| 63484888 | Feb 2023 | US | |
| 63484893 | Feb 2023 | US | |
| 63484897 | Feb 2023 | US |
