Systems, methods, and computer-readable media for asynchronous display

The asynchronous display system addresses latency and power consumption issues by updating only changed image areas, enhancing display performance in VR and AR applications.

CN108737722BActive Publication Date: 2024-12-06INTEL CORP
View PDF 15 Cites 0 Cited by

Patent Information

Application Number
CN201810338225.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2017-04-17
Filing Date
2018-04-16
Publication Date
2024-12-06
Estimated Expiration
2038-04-16

AI Technical Summary

Technical Problem

Existing display technologies face challenges in managing latency and power consumption, particularly in virtual reality and augmented reality applications, as they often require updating all pixels at a fixed frame rate, which is insufficient for smooth performance and inefficient in terms of power usage.

Method used

Implementing an asynchronous display system that updates only the areas of the image that have changed by determining pixel differences between frames and sending these updates asynchronously, rather than at a fixed frame rate, using a computing device and an asynchronous display.

Benefits of technology

This approach reduces latency and power consumption by only updating changed areas, providing smoother and more efficient display performance in applications like virtual and augmented reality.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN108737722B_ABST
    Figure CN108737722B_ABST
Patent Text Reader

Abstract

Systems, methods, and computer-readable media provide for asynchronously displaying pixels on a display, block-based camera updates, and event-driven frame updates on an asynchronous display.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] Embodiments relate generally to display technology, and more particularly, to block-based camera updates and asynchronous displays. Background Art

[0002] Raster scanning is a process for displaying an image. The process may require all pixels in a frame to be updated, where the image is updated one pixel at a time for each frame. Each row of pixels may be scanned from left to right, and each row may be scanned from top to bottom. Using a frame rate of 30 frames per second may be good for human perception, but when adding virtual reality, augmented reality, or gaming, 30 frames per second may not be enough to control latency. Higher frame rates may help mitigate latency, but typically utilize a considerable amount of power. Summary of the invention

[0003] The present disclosure provides a system for asynchronous display of frames. The system includes: a computing device for determining changes between a current frame and a previous frame; and an asynchronous display coupled to the computing device for displaying an image; wherein the computing device sends frame updates to the asynchronous display asynchronously rather than at a fixed frame rate to update only the area of ​​the currently displayed image that has changed.

[0004] The present disclosure also provides a method for asynchronously displaying pixels. The method includes: determining, by a computing device, changes to a new frame to be rendered on an asynchronous display, wherein the changes include pixels of an image currently displayed on the asynchronous display that have been changed in the new frame, wherein the changes represent updated pixels; and sending, by the computing device, the updated pixels together with corresponding pixel addresses representing the locations of the updated pixels asynchronously rather than at a fixed frame rate, so that the asynchronous display can update the currently displayed image with the updated pixels based on the pixel addresses.

[0005] The present disclosure also provides a computer-readable medium having instructions stored thereon, which, when executed by a computing device, prompt the computing device to execute the above method.

[0006] The present disclosure also provides an asynchronous system for event-driven updates. The system includes: a computing system; a plurality of input devices, coupled to the computing system in a communicative manner; and at least one output device; wherein when an event occurs, at least in part based on one input device, the one input device causes the at least one output device to be updated asynchronously, wherein the update only contains changes that have occurred since the previous update; wherein the at least one output device includes a display, wherein when an event occurs, the computing system sends the changes to the display asynchronously rather than at a fixed frame rate.

[0007] The present disclosure also provides a system for asynchronous display of frames. The system includes: a component for determining changes between a current frame and a previous frame; and a component for sending the changes to the asynchronous display asynchronously rather than at a fixed frame rate to update only the area of ​​the currently displayed image that has changed. BRIEF DESCRIPTION OF THE DRAWINGS

[0008] Various advantages of the embodiments will become apparent to those skilled in the art by reading the following specification and appended claims, and by referring to the following drawings, in which:

[0009] Figure 1 is a block diagram illustrating a computer system configured to implement one or more aspects of the embodiments described herein;

[0010] Figures 2A-2D illustrates a parallel processor assembly according to an embodiment;

[0011] Figure 3A-3B is a block diagram of a graphics multiprocessor according to an embodiment;

[0012] Figures 4A-4F illustrates an exemplary architecture in which multiple GPUs are communicatively coupled to multiple multi-core processors;

[0013] Figure 5 illustrates a graphics processing pipeline according to an embodiment;

[0014] Fig. 6A is a diagram illustrating a conventional raster scanning process for displaying a frame on a display;

[0015] Figure 6B is a block diagram illustrating an asynchronous process for updating a frame on an asynchronous display according to an embodiment;

[0016] Fig. 7A is an exemplary block diagram for block-based camera updating according to an embodiment;

[0017] Figure 7B is a flow chart of an exemplary method for block-based camera updating according to an embodiment;

[0018] Figure 7C is a flow chart of another exemplary method for block-based camera updating according to an embodiment;

[0019] Fig.7D is a flow chart of an exemplary method for determining an update region for block-based camera updating according to an embodiment;

[0020] Fig. 7E illustrates an update block / area according to an embodiment;

[0021] Figure 8is a block diagram illustrating an exemplary gaming system according to an embodiment;

[0022] Fig. 9 is a table illustrating exemplary events and their weighted values ​​for event-driven updating on an asynchronous display according to an embodiment;

[0023] Fig.10 is a flow chart illustrating an exemplary event-driven process for event-driven updates on an asynchronous display according to an embodiment;

[0024] Fig.11 is a block diagram of an example of a display having localized backlight capability according to an embodiment;

[0025] Fig. 12A is a block diagram of an example of a data processing apparatus according to an embodiment;

[0026] Fig. 12B is an illustration of an example of distance determination according to an embodiment;

[0027] Fig.13 is a block diagram of an example of a layered display architecture according to an embodiment;

[0028] Fig.14 is a block diagram of an example of a display architecture including multiple display units according to an embodiment; and

[0029] Fig.15 is a block diagram of an example of a cloud-assisted media delivery architecture according to an embodiment;

[0030] Figure 16-18 is a block diagram of an example of an overview of a data processing system according to an embodiment;

[0031] Fig.19 is a block diagram of an example of a graphics processing engine according to an embodiment;

[0032] Figure 20-22 is a block diagram of an example of an execution unit according to an embodiment;

[0033] Fig.23 is a block diagram of an example of a graphics pipeline according to an embodiment;

[0034] Figures 24A-24B is a block diagram of an example of graphics pipeline programming according to an embodiment;

[0035] Fig.25 is a block diagram of an example of a graphics software architecture according to an embodiment;

[0036] Fig.26 is a block diagram of an example of an intellectual property (IP) core development system according to an embodiment;

[0037] Fig. 27 is a block diagram of an example of a system on chip integrated circuit according to an embodiment. DETAILED DESCRIPTION

[0038] In the following description, a large number of specific details are set forth to provide a more comprehensive understanding of the present invention. However, it will be appreciated by those skilled in the art that the present invention may be implemented without one or more of these specific details. In other examples, well-known features are not described in order to avoid confusing the present invention.

[0039] System Overview

[0040] Figure 1 1 is a block diagram illustrating a computing system 100 configured to implement one or more aspects of the embodiments described herein. The computing system 100 includes a processing subsystem 101 having one or more processors 102 and a system memory 104, the one or more processors 102 communicating with the system memory 104 via an interconnect path that may include a memory hub 105. The memory hub 105 may be a separate component within a chipset assembly, or may be integrated within the one or more processors 102. The memory hub 105 is coupled to an I / O subsystem 111 via a communication link 106. The I / O subsystem 111 includes an I / O hub 107, which may enable the computing system 100 to receive input from one or more input devices 108. Additionally, the I / O hub 107 may enable a display controller, which may be included in the one or more processors 102, to provide output to one or more display devices 110A. In one embodiment, the one or more display devices 110A coupled to the I / O hub 107 may include local, internal, or embedded display devices.

[0041] In one embodiment, the processing subsystem 101 includes one or more parallel processors 112, which are coupled to the memory hub 105 via a bus or other communication link 113. The communication link 113 can be one of any number of standard-based communication link technologies or protocols (such as, but not limited to, the PCI Express bus), or can be a vendor-specific communication interface or communication structure. In one embodiment, the one or more parallel processors 112 form a computationally focused parallel or vector processing system that includes a large number of processing cores and / or processing clusters (such as, an integrated many-core (MIC) processor). In one embodiment, the one or more parallel processors 112 form a graphics processing subsystem that can output pixels to one of the one or more display devices 110A coupled via the I / O hub 107. The one or more parallel processors 112 may also include a display controller and display interface (not shown) to enable direct connection to one or more display devices 110B.

[0042] Within the I / O subsystem 111, a system storage unit 114 may be connected to the I / O hub 107 to provide a storage mechanism for the computing system 100. An I / O switch 116 may be used to provide an interface mechanism to enable connection between the I / O hub 107 and other components, such as a network adapter 118 and / or a wireless network adapter 119 that may be integrated into the platform, and various other devices that may be added via one or more plug-in devices 120. The network adapter 118 may be an Ethernet adapter or another wired network adapter. The wireless network adapter 119 may include one or more of the following: Wi-Fi, Bluetooth, near field communication (NFC), or other network devices including one or more wireless radios.

[0043] The computing system 100 may include other components not explicitly shown, including USB or other port connections, optical storage drives, video capture devices, and the like, which may also be connected to the I / O hub 107. Figure 1 The communication paths interconnecting the various components in the system may be implemented using any suitable protocol, such as a PCI (Peripheral Component Interconnect) based protocol (e.g., PCI Express bus) or any other bus or point-to-point communication interface and / or protocol (such as, NV-Link high-speed interconnect, or interconnect protocols known in the art).

[0044] In one embodiment, the one or more parallel processors 112 incorporate circuits optimized for graphics and video processing (including, for example, video output circuits) and constitute a graphics processing unit (GPU). In another embodiment, the one or more parallel processors 112 incorporate circuits optimized for general-purpose processing while maintaining the underlying computing architecture described in more detail herein. In yet another embodiment, the components of the computing system 100 may be integrated on a single integrated circuit along with one or more other system elements. For example, the one or more parallel processors 112, the memory hub 105, the processor 102, and the I / O hub 107 may be integrated into a system on a chip (SoC) integrated circuit. Alternatively, the components of the computing system 100 may be integrated into a single package to form a system in package (SIP) configuration. In one embodiment, at least a portion of the components of the computing system 100 may be integrated into a multi-chip module (MCM), which may be interconnected with other multi-chip modules into a modular computing system.

[0045] It will be appreciated that the computing system 100 shown herein is illustrative and that variations and modifications are possible. The connection topology, including the number and arrangement of bridges, the number of processor(s) 102, and the number of parallel processor(s) 112, may be modified as desired. For example, in some embodiments, the system memory 104 is connected to the processor(s) 102 directly rather than through a bridge, while other devices communicate with the processor(s) 102 and the system memory 104 via the memory hub 105. In other alternative topologies, the parallel processor(s) 112 are connected to the I / O hub 107 or directly to one of the processor(s) 102, rather than to the memory hub 105. In other embodiments, the I / O hub 107 and the memory hub 105 may be integrated into a single chip. Some embodiments may include two or more groups of processors 102 attached via multiple sockets, which may be coupled to two or more instances of the parallel processor(s) 112.

[0046] Some of the specific components shown herein are optional and may not be included in all implementations of computing system 100. For example, any number of plug-in cards or peripherals may be supported, or some components may be eliminated. In addition, some architectures may be different from those described above. Figure 1 Different terminology is used for components that are similar to those shown in FIG. 1. For example, in some architectures, memory hub 105 may be referred to as a north bridge, while I / O hub 107 may be referred to as a south bridge.

[0047] Figure 2A200 according to an embodiment. The various components of the parallel processor 200 may be implemented using one or more integrated circuit devices, such as a programmable processor, an application specific integrated circuit (ASIC), or a field programmable gate array (FPGA). Figure 1 A variation of one or more parallel processors 112 is shown in FIG.

[0048] In one embodiment, parallel processor 200 includes parallel processing unit 202. The parallel processing unit includes an I / O unit 204, which is capable of communicating with other devices (including other instances of parallel processing unit 202). I / O unit 204 can be directly connected to other devices. In one embodiment, I / O unit 204 is connected to other devices via the use of a hub or switch interface (such as memory hub 105). The connection between memory hub 105 and I / O unit 204 forms a communication link 113. Within parallel processing unit 202, I / O unit 204 is connected to a host interface 206 and a memory crossbar 216, wherein host interface 206 receives commands for performing processing operations and memory crossbar 216 receives commands for performing memory operations.

[0049] When the host interface 206 receives the command buffer via the I / O unit 204, the host interface 206 can direct the work operations for executing those commands to the front end 208. In one embodiment, the front end 208 is coupled with a scheduler 210, which is configured to distribute commands or other work items to the processing cluster array 212. In one embodiment, the scheduler 210 ensures that the processing cluster array 212 is properly configured and in a valid state before tasks are distributed to the processing clusters of the processing cluster array 212. In one embodiment, the scheduler 210 is implemented via firmware logic executed on a microcontroller. The microcontroller-implemented scheduler 210 can be configured to perform complex scheduling and work distribution operations at coarse and fine granularity, thereby enabling context switching and rapid preemption of threads executing on the processing array 212. In one embodiment, the host software can verify that the workload is scheduled on the processing array 212 via one of a plurality of graphics processing doorbells. The workload may then be automatically distributed across the processing array 212 by the scheduler 210 logic within the scheduler microcontroller.

[0050] The processing cluster array 212 may include up to "N" processing clusters (e.g., cluster 214A, cluster 214B, up to cluster 214N). Each cluster 214A-214N of the processing cluster array 212 may execute a large number of concurrent threads. The scheduler 210 may use various scheduling and / or work distribution algorithms to assign work to the clusters 214A-214N of the processing cluster array 212, which may vary depending on the workload generated for each type of program or calculation. Scheduling may be handled dynamically by the scheduler 210, or may be assisted in part by compiler logic during the compilation of program logic configured for execution by the processing cluster array 212. In one embodiment, different clusters 214A-214N of the processing cluster array 212 may be assigned to process different types of programs, or to perform different types of calculations.

[0051] Processing cluster array 212 may be configured to perform various types of parallel processing operations. In one embodiment, processing cluster array 212 is configured to perform general-purpose parallel computing operations. For example, processing cluster array 212 may include logic for performing processing tasks including filtering video and / or audio data, performing modeling operations (including physics operations), and performing data transformations.

[0052] In one embodiment, processing cluster array 212 is configured to perform parallel graphics processing operations. In embodiments where parallel processor 200 is configured to perform graphics processing operations, processing cluster array 212 may include additional logic for supporting the execution of such graphics processing operations, including but not limited to texture sampling logic for performing texture operations, and tessellation logic and other vertex processing logic. In addition, processing cluster array 212 may be configured to execute graphics processing related shader programs, such as but not limited to vertex shaders, tessellation shaders, geometry shaders, and pixel shaders. Parallel processing unit 202 may transfer data from system memory via I / O unit 204 for processing. During processing, the transferred data may be stored to on-chip memory (e.g., parallel processor memory 222) during processing and then written back to system memory.

[0053] In one embodiment, when parallel processing unit 202 is used to perform graphics processing, scheduler 210 can be configured to divide the processing workload into tasks of approximately equal size to better enable the distribution of graphics processing operations to multiple clusters 214A-214N in processing cluster array 212. In some embodiments, portions of processing cluster array 212 can be configured to perform different types of processing. For example, a first portion can be configured to perform vertex shading and topology generation, a second portion can be configured to perform tessellation and geometry shading, and a third portion can be configured to perform pixel shading or other screen space operations to produce a rendered image for display. Intermediate data generated by one or more of clusters 214A-214N can be stored in a buffer to allow the intermediate data to be transferred between clusters 214A-214N for further processing.

[0054] During operation, the processing cluster array 212 may receive processing tasks to be performed via the scheduler 210, which receives commands defining the processing tasks from the front end 208. For graphics processing operations, the processing tasks may include commands and state parameters defining how data is to be processed (e.g., what program is to be executed) and indices of the data to be processed (e.g., surface (patch) data, primitive data, vertex data, and / or pixel data). The scheduler 210 may be configured to extract the index corresponding to the task, or may receive the index from the front end 208. The front end 208 may be configured to ensure that the processing cluster array 212 is configured to a valid state before initiating a workload specified by an incoming command buffer (e.g., a batch buffer, a push buffer, etc.).

[0055] Each of the one or more instances of the parallel processing unit 202 can be coupled to a parallel processor memory 222. The parallel processor memory 222 can be accessed via a memory crossbar switch 216, which can receive memory requests from the processing cluster array 212 and the I / O unit 204. The memory crossbar switch 216 can access the parallel processor memory 222 via a memory interface 218. The memory interface 218 can include a plurality of partition units (e.g., partition unit 220A, partition unit 220B, up to partition unit 220N), which can each be coupled to a portion (e.g., memory unit) of the parallel processor memory 222. In one implementation, the number of partition units 220A-220N is configured to be equal to the number of memory units, such that the first partition unit 220A has a corresponding first memory unit 224A, the second partition unit 220B has a corresponding memory unit 224B, and the Nth partition unit 220N has a corresponding Nth memory unit 224N. In other embodiments, the number of partition units 220A-220N may not be equal to the number of memory devices.

[0056] In various embodiments, the memory units 224A-224N may include various types of memory devices, including dynamic random access memory (DRAM) or graphics random access memory, such as synchronous graphics random access memory (SGRAM), including graphics double data rate (GDDR) memory. In one embodiment, the memory units 224A-224N may also include 3D stacked memory, including but not limited to high bandwidth memory (HBM). Those skilled in the art will recognize that the specific implementation of the memory units 224A-224N may vary and may be selected from one of various conventional designs. Rendering targets (such as frame buffers or texture maps) may be stored across the memory units 224A-224N, allowing the partition units 220A-220N to write portions of each rendering target in parallel to efficiently use the available bandwidth of the parallel processor memory 222. In some embodiments, local instances of the parallel processor memory 222 may be excluded to facilitate the unified memory design of the system memory to be utilized in conjunction with the local cache memory.

[0057] In one embodiment, any of the clusters 214A-214N of the processing cluster array 212 can process data to be written to any of the memory units 224A-224N within the parallel processor memory 222. The memory crossbar 216 can be configured to transfer the output of each cluster 214A-214N to any partition unit 220A-220N or another cluster 214A-214N, which can perform additional processing operations on the output. Each cluster 214A-214N can communicate with a memory interface 218 through the memory crossbar 216 to read from or write to various external memory devices. In one embodiment, the memory crossbar 216 has a connection to the memory interface 218 to communicate with the I / O unit 204, as well as a connection to a local instance of the parallel processor memory 222, thereby enabling processing units within different processing clusters 214A-214N to communicate with system memory or other memory that is not local to the parallel processing unit 202. In one embodiment, the memory crossbar switch 216 may use virtual channels to separate traffic flows between the clusters 214A-214N and the partition units 220A-220N.

[0058] Although a single instance of parallel processing unit 202 is shown in parallel processor 200, any number of instances of parallel processing unit 202 may be included. For example, multiple instances of parallel processing unit 202 may be provided on a single plug-in card, or multiple plug-in cards may be interconnected. Different instances of parallel processing unit 202 may be configured to interoperate even if the different instances have different numbers of processing cores, different amounts of local parallel processor memory, and / or other configuration differences. For example and in one embodiment, some instances of parallel processing unit 202 may include higher precision floating point units relative to other instances. Systems that incorporate one or more instances of parallel processing unit 202 or parallel processor 200 may be implemented in a variety of configurations and form factors, including but not limited to desktop computers, laptop computers, or handheld personal computers, servers, workstations, game consoles, and / or embedded systems.

[0059] Figure 2B is a block diagram of a partition unit 220 according to an embodiment. In one embodiment, the partition unit 220 is Figure 2AAn example of one of the partition units 220A - 220N. As shown, the partition unit 220 includes an L2 cache 221, a frame buffer interface 225, and a ROP 226 (raster operation unit). The L2 cache 221 is a read / write cache configured to perform load and store operations received from the memory crossbar 216 and the ROP 226. Read misses and urgent writeback requests are output from the L2 cache 221 to the frame buffer interface 225 for processing. Updates can also be sent to the frame buffer via the frame buffer interface 225 for processing. In one embodiment, the frame buffer interface 225 interfaces with one of the memory units in the parallel processor memory (such as the memory units 224A - 224N of FIG. 2 (e.g., within the parallel processor memory 222)).

[0060] In a graphics application, the ROP 226 is a processing unit that performs raster operations such as stencil, z - test, blending, and the like. Subsequently, the ROP 226 outputs the processed graphics data stored in the graphics memory. In some embodiments, the ROP 226 includes compression logic for compressing depth or color data written to the memory and decompressing depth or color data read from the memory. The compression logic can be lossless compression logic that utilizes one or more of a variety of compression algorithms. The type of compression performed by the ROP 226 can vary based on the statistical characteristics of the data to be compressed. For example, in one embodiment, delta - color compression is performed on depth and color data on a per - tile basis.

[0061] In some embodiments, the ROP 226 is included within each processing cluster (such as the clusters 214A - 214N of FIG. 2) rather than within the partition unit 220. In such embodiments, read and write requests for pixel data rather than pixel fragment data are conveyed through the memory crossbar 216. The processed graphics data can be displayed on a display device (such as Figure 1 one of the one or more display devices 110), routed for further processing by the (one or more) processors 102, or routed for further processing by Figure 2A one of the processing entities within the parallel processor 200.

[0062] Figure 2CIt is a block diagram of a processing cluster 214 in a parallel processing unit according to an embodiment. In one embodiment, the processing cluster is an instance of one of the processing clusters 214A-214N of Figure 2. The processing cluster 214 can be configured to execute many threads in parallel, wherein the term "thread" refers to an instance of a specific program executed on a specific set of input data. In some embodiments, without providing multiple independent instruction units, a single instruction multiple data (SIMD) instruction issuance technology is used to support the parallel execution of a large number of threads. In other embodiments, a public instruction unit configured to issue instructions to a group of processing engines in each of the processing clusters is used, and a single instruction multiple thread (SIMT) technology is used to support the parallel execution of a large number of generally synchronized threads. Different from the SIMD execution regime (wherein, all processing engines usually execute the same instruction), SIMT execution allows different threads to more easily follow divergent execution paths and pass through a given thread program. It will be appreciated by those skilled in the art that the SIMD processing regime represents a functional subset of the SIMT processing regime.

[0063] The operation of the processing cluster 214 can be controlled via a pipeline manager 232, which distributes processing tasks to SIMT parallel processors. The pipeline manager 232 receives instructions from the scheduler 210 of Figure 2, and manages the execution of those instructions via a graphics multiprocessor 234 and / or a texture unit 236. The illustrated graphics multiprocessor 234 is an exemplary instance of a SIMT parallel processor. However, various types of SIMT parallel processors of different architectures may be included in the processing cluster 214. One or more instances of the graphics multiprocessor 234 may be included in the processing cluster 214. The graphics multiprocessor 234 may process data, and the data crossbar 240 may be used to distribute the processed data to one of a plurality of possible destinations (including other shader units). The pipeline manager 232 may facilitate the distribution of processed data by specifying the destination of the processed data to be distributed via the data crossbar 240.

[0064] Each graphics multiprocessor 234 within a processing cluster 214 may include the same set of function execution logic (e.g., arithmetic logic units, load-store units, etc.). The function execution logic may be configured in a pipelined manner in which a new instruction may be issued before a previous instruction is completed. The function execution logic supports a wide variety of operations including integer and floating point arithmetic, comparison operations, Boolean operations, bit shifts, and calculation of various algebraic functions. In one embodiment, the same functional unit hardware may be utilized to perform different operations, and any combination of functional units may be present.

[0065] The instructions transmitted to the processing cluster 214 constitute threads. A group of threads executed across a group of parallel processing engines is a thread group. A thread group executes the same program on different input data. Each thread within a thread group can be assigned to a different processing engine within the graphics multiprocessor 234. A thread group can include fewer threads than the number of processing engines within the graphics multiprocessor 234. When a thread group includes fewer threads than the number of processing engines, one or more of the processing engines can be idle during the cycle in which the thread group is being processed. A thread group can also include more threads than the number of processing engines within the graphics multiprocessor 234. When a thread group includes more threads than the number of processing engines within the graphics multiprocessor 234, processing can be performed on consecutive clock cycles. In one embodiment, multiple thread groups can be executed concurrently on the graphics multiprocessor 234.

[0066] In one embodiment, the graphics multiprocessor 234 includes an internal cache memory for performing load and store operations. In one embodiment, the graphics multiprocessor 234 can abandon the internal cache and use the cache memory (e.g., L1 cache 308) within the processing cluster 214. Each graphics multiprocessor 234 also has access to the L2 cache within the partition unit (e.g., partition unit 220A-220N of Figure 2) that can be used to transfer data between threads and shared among all processing clusters 214. The graphics multiprocessor 234 can also access off-chip global memory, which can include one or more of the local parallel processor memory and / or system memory. Any memory outside the parallel processing unit 202 can be used as global memory. Embodiments (wherein the processing cluster 214 includes multiple instances of the graphics multiprocessor 234) can share common instructions and data, which can be stored in the L1 cache 308.

[0067] Each processing cluster 214 may include an MMU 245 (memory management unit) configured to map virtual addresses into physical addresses. In other embodiments, one or more instances of the MMU 245 may reside within the memory interface 218 of FIG. 2 . The MMU 245 includes: a set of page table entries (PTEs) for mapping the virtual addresses of tiles (more on tiling) to their physical addresses; and optionally a cache line index. The MMU 245 may include an address translation lookaside buffer (TLB) or cache that may reside within the graphics multiprocessor 234 or L1 cache or processing cluster 214. Physical addresses are processed to distribute surface data access locality, thereby allowing efficient request interleaving among partition units. The cache line index can be used to determine whether a request for a cache line is a hit or a miss.

[0068] In graphics and computing applications, the processing clusters 214 may be configured such that each graphics multiprocessor 234 is coupled to a texture unit 236 for performing texture mapping operations, such as determining texture sample locations, reading texture data, and filtering texture data. Texture data is read from an internal texture L1 cache (not shown) or in some embodiments from an L1 cache within the graphics multiprocessor 234, and the texture data is retrieved from an L2 cache, local parallel processor memory, or system memory, as needed. Each graphics multiprocessor 234 outputs the processed tasks to a data crossbar 240 to provide the processed tasks to another processing cluster 214 for further processing or to store the processed tasks in an L2 cache, local parallel processor memory, or system memory via a memory crossbar 216. A preROP 242 (e.g., a pre-raster operation unit) is configured to receive data from the graphics multiprocessor 234, direct the data to a ROP unit, which may be located with a partition unit (e.g., partition units 220A-220N of FIG. 2 ) as described herein. The preROP 242 unit may perform optimizations for color blending, organize pixel color data, and perform address translations.

[0069] It will be appreciated that the core architecture described herein is illustrative, and variations and modifications are possible. Any number of processing units (e.g., graphics multiprocessor 234, texture unit 236, preROP 242, etc.) may be included within processing cluster 214. Furthermore, while only one processing cluster 214 is shown, a parallel processing unit as described herein may include any number of instances of processing cluster 214. In one embodiment, each processing cluster 214 may be configured to operate independently of other processing clusters 214 using separate and distinct processing units, L1 caches, etc.

[0070] Figure 2D A graphics multiprocessor 234 is shown according to one embodiment. In such embodiments, the graphics multiprocessor 234 is coupled to a pipeline manager 232 of a processing cluster 214. The graphics multiprocessor 234 has an execution pipeline that includes, but is not limited to, an instruction cache 252, an instruction unit 254, an address mapping unit 256, a register file 258, one or more general purpose graphics processing unit (GPGPU) cores 262, and one or more load / store units 266. The GPGPU cores 262 and the load / store units 266 are coupled to a cache memory 272 and a shared memory 270 via a memory and cache interconnect 268.

[0071] In one embodiment, the instruction cache 252 receives a stream of instructions to be executed from the pipeline manager 232. The instructions are cached in the instruction cache 252 and dispatched by the instruction unit 254 for execution. The instruction unit 254 can dispatch instructions into thread groups (e.g., warps), where each thread of the thread group is assigned to a different execution unit within the GPGPU core 262. Instructions can access any of the local, shared, or global address spaces by specifying an address within the unified address space. The address mapping unit 256 can be used to convert addresses in the unified address space into different memory addresses that can be accessed by the load / store unit 266.

[0072] The register file 258 provides a set of registers for the functional units of the graphics multiprocessor 324. The register file 258 provides temporary storage for operands for the data paths of the functional units (e.g., GPGPU core 262, load / store unit 266) connected to the graphics multiprocessor 324. In one embodiment, the register file 258 is divided between each of the functional units so that each functional unit is allocated a dedicated portion of the register file 258. In one embodiment, the register file 258 is divided between different warps executed by the graphics multiprocessor 324.

[0073] The GPGPU cores 262 may each include a floating point unit (FPU) and / or an integer arithmetic logic unit (ALU), which are used to execute instructions of the graphics multiprocessor 324. Depending on the embodiment, the GPGPU cores 262 may be similar in architecture, or may be different in architecture. For example and in one embodiment, the first portion of the GPGPU core 262 includes a single-precision FPU and an integer ALU, while the second portion of the GPGPU core includes a double-precision FPU. In one embodiment, the FPU may implement the IEEE 754-2008 standard for floating-point arithmetic, or may be capable of variable-precision floating-point arithmetic. The graphics multiprocessor 324 may additionally include one or more fixed-function or special-function units to perform specific functions (such as copying rectangles or pixel blending operations). In one embodiment, one or more of the GPGPU cores may also include fixed or special-function logic.

[0074] In one embodiment, GPGPU core 262 includes SIMD logic capable of executing a single instruction to multiple groups of data. In one embodiment, GPGPU core 262 can physically execute SIMD4, SIMD8 and SIMD16 instructions, and logically execute SIMD1, SIMD2 and SIMD32 instructions. SIMD instructions for GPGPU core can be generated by shader compiler at compile time, or can be automatically generated when executing a program written and compiled for single program multiple data (SPMD) or SIMT architecture. Multiple threads of a program configured for SIMT execution model can be executed via a single SIMD instruction. For example and in one embodiment, eight SIMT threads performing the same or similar operation can be executed in parallel via a single SIMD8 logic unit.

[0075] The memory and cache interconnect 268 is an interconnect network that connects each of the functional units of the graphics multiprocessor 234 to the register file 258 and to the shared memory 270. In one embodiment, the memory and cache interconnect 268 is a crossbar interconnect that allows the load / store unit 266 to implement load and store operations between the shared memory 270 and the register file 258. The register file 258 can operate at the same frequency as the GPGPU core 262, so that data transfer between the GPGPU core 262 and the register file 258 is very low latency. The shared memory 270 can be used to implement communication between threads executing on the functional units within the graphics multiprocessor 234. The cache memory 272 can be used, for example, as a data cache to cache texture data communicated between the functional units and the texture unit 236. The shared memory 270 can also be used as a program-managed cache (cached). Threads executing on the GPGPU core 262 can programmatically store data in the shared memory in addition to the automatically cached data stored in the cache memory 272.

[0076] Figure 3A-3B Additional graphics multiprocessors are shown according to an embodiment. The graphics multiprocessors 325, 350 shown are Figure 2C The illustrated graphics multiprocessors 325, 350 may be configured as streaming multiprocessors (SMs) capable of executing a large number of execution threads simultaneously.

[0077] Figure 3A A graphics multiprocessor 325 is shown according to an additional embodiment. The graphics multiprocessor 325 includes Figure 2DThe graphics multiprocessor 325 may include multiple additional instances of the execution resource unit of the graphics multiprocessor 234. For example, the graphics multiprocessor 325 may include multiple instances of instruction units 332A-332B, register files 334A-334B, and texture units 344A-344B. The graphics multiprocessor 325 also includes multiple groups of graphics or compute execution units (e.g., GPGPU cores 336A-336B, GPGPU cores 337A-337B, GPGPU cores 338A-338B) and multiple groups of load / store units 340A-340B. In one embodiment, the execution resource unit has a common instruction cache 330, texture and / or data cache memory 342, and shared memory 346.

[0078] Various components may communicate via interconnect structure 327. In one embodiment, interconnect structure 327 includes one or more crossbar switches to enable communication between various components of graphics multiprocessor 325. In one embodiment, interconnect structure 327 is a separate high-speed network fabric layer on which each component of graphics multiprocessor 325 is stacked. Components of graphics multiprocessor 325 communicate with remote components via interconnect structure 327. For example, GPGPU cores 336A-336B, 337A-337B, and 3378A-338B may each communicate with shared memory 346 via interconnect structure 327. Interconnect structure 327 may arbitrate communications within graphics multiprocessor 325 to ensure fair bandwidth allocation between components.

[0079] Figure 3B A graphics multiprocessor 350 according to an additional embodiment is shown. The graphics processor includes multiple sets of execution resources 356A-356D, wherein each set of execution resources includes multiple instruction units, register files, GPGPU cores, and load storage units, such as Figure 2D and Figure 3A . Execution resources 356A-356D may work in concert with texture units 360A-360D for texture operations while sharing instruction cache 354 and shared memory 362. In one embodiment, execution resources 356A-356D may share instruction cache 354 and shared memory 362, as well as multiple instances of texture and / or data cache memory 358A-358B. The various components may be communicated via a communication protocol similar to Figure 3A The interconnect structure 327 and the interconnect structure 352 communicate with each other.

[0080] Those skilled in the art will understand that Figure 1 , 2AThe architectures described in Figures 2-2D and 3A-3B are illustrative and non-restrictive with respect to the scope of the present embodiments. Thus, without departing from the scope of the embodiments described herein, the techniques described herein may be implemented on any properly configured processing unit, including but not limited to one or more mobile application processors, one or more desktop or server central processing units (CPUs) (including multi-core CPUs), one or more parallel processing units (such as parallel processing unit 202 of Figure 2), and one or more graphics processors or special processing units.

[0081] In some embodiments, a parallel processor or GPGPU as described herein is communicatively coupled to a host / processor core to accelerate graphics operations, machine learning operations, pattern analysis operations, and various general-purpose GPU (GPGPU) functions. The GPU may be communicatively coupled to a host processor / core via a bus or other interconnect (e.g., a high-speed interconnect such as PCIe or NVLink). In other embodiments, the GPU may be integrated on the same package or chip as the core and communicatively coupled to the core via an internal processor bus / interconnect (i.e., inside the package or chip). Regardless of the manner in which the GPU is connected, the processor core may assign work to the GPU in the form of a sequence of commands / instructions contained in a work descriptor. The GPU then uses dedicated circuits / logic for efficiently processing these commands / instructions.

[0082] Technologies for GPU to host processor interconnect

[0083] Figure 4A An exemplary architecture is shown in which multiple GPUs 410-413 are communicatively coupled to multiple multi-core processors 405-406 via high-speed links 440-443 (e.g., buses, point-to-point interconnects, etc.). In one embodiment, the high-speed links 440-443 support 4GB / s, 30GB / s, 80GB / s, or higher communication throughputs, depending on the implementation. Various interconnect protocols may be used, including but not limited to PCIe 4.0 or 5.0 and NVLink 2.0. However, the underlying principles of the invention are not limited to any specific communication protocol or throughput.

[0084] Additionally, in one embodiment, two or more of the GPUs 410-413 are interconnected via high-speed links 444-445, which may be implemented using the same or different protocols / links as used for high-speed links 440-443. Similarly, two or more of the multi-core processors 405-406 may be connected via high-speed link 433, which may be a symmetric multiprocessor (SMP) bus operating at 20 GB / s, 30 GB / s, 120 GB / s, or higher. Alternatively, Figure 4A All communications between the various system components shown in can be accomplished using the same protocol / links (eg, through a common interconnect structure). However, as mentioned, the underlying principles of the invention are not limited to any particular type of interconnect technology.

[0085] In one embodiment, each multi-core processor 405-406 is communicatively coupled to processor memory 401-402 via memory interconnects 430-431, respectively, and each GPU 410-413 is communicatively coupled to GPU memory 420-423 via GPU memory interconnects 450-453, respectively. Memory interconnects 430-431 and 450-453 may utilize the same or different memory access technologies. By way of example and not limitation, processor memory 401-402 and GPU memory 420-423 may be volatile memory, such as dynamic random access memory (DRAM) (including stacked DRAM), graphics DDR SDRAM (GDDR) (e.g., GDDR5, GDDR6), or high bandwidth memory (HBM), and / or may be non-volatile memory, such as 3DXPoint or Nano-Ram. In one embodiment, a portion of the memory may be volatile memory, and another portion may be non-volatile memory (e.g., using a two-level memory (2LM) hierarchy).

[0086] As described below, although the various processors 405-406 and GPUs 410-413 may be physically coupled to specific memories 401-402, 420-423, respectively, a unified memory architecture may be implemented in which the same virtual system address space (also referred to as an "effective address" space) is distributed across all of the various physical memories. For example, the processor memories 401-402 may each include 64GB of system memory address space, and the GPU memories 420-423 may each include 32GB of system memory address space (yielding a total of 256GB of addressable memory in this example).

[0087] Figure 4B Additional details are shown for the interconnection between the multi-core processor 407 and the graphics acceleration module 446 according to one embodiment. The graphics acceleration module 446 may include one or more GPU chips integrated on a line card that is coupled to the processor 407 via the high-speed link 440. Alternatively, the graphics acceleration module 446 may be integrated on the same package or chip as the processor 407.

[0088] The processor 407 shown includes multiple cores 460A-460D, each of which has a conversion lookaside buffer 461A-461D and one or more caches 462A-462D. The core may include various other components (e.g., instruction fetch unit, branch prediction unit, decoder, execution unit, reorder buffer, etc.) for executing instructions and processing data, which are not shown to avoid confusing the underlying principles of the present invention. Caches 462A-462D may include level 1 (L1) and level 2 (L2) caches. In addition, one or more shared caches 426 may be included in the cache hierarchy and shared by multiple groups of cores 460A-460D. For example, one embodiment of the processor 407 includes 24 cores, each of which has its own L1 cache, twelve shared L2 caches, and twelve shared L3 caches. In this embodiment, one of the L2 and L3 caches is shared by two adjacent cores. The processor 407 and the graphics accelerator integrated module 446 are connected to the system memory 441, which may include the processor memories 401-402.

[0089] Coherence is maintained for data and instructions stored in the various caches 462A-462D, 456, and the system memory 441 via inter-core communications over the coherence bus 464. For example, each cache may have cache coherence logic / circuitry associated therewith to communicate over the coherence bus 464 in response to a detected read or write to a particular cache line. In one implementation, a cache snooping protocol is implemented over the coherence bus 464 to snoop cache accesses. Cache snooping / coherence techniques are well understood by those skilled in the art and will not be described in detail herein to avoid obscuring the underlying principles of the present invention.

[0090] In one embodiment, the proxy circuit 425 communicatively couples the graphics acceleration module 446 to the coherence bus 464, thereby allowing the graphics acceleration module 446 to participate in the cache coherence protocol as a peer of the core. Specifically, the interface 435 provides connectivity to the proxy circuit 425 through a high-speed link 440 (e.g., a PCIe bus, NVLink, etc.), and the interface 437 connects the graphics acceleration module 446 to the link 440.

[0091] In one implementation, the accelerator integrated circuit 436 provides cache management, memory access, context management, and interrupt management services on behalf of the multiple graphics processing engines 431, 432, N of the graphics acceleration module 446. The graphics processing engines 431, 432, N may each include a separate graphics processing unit (GPU). Alternatively, the graphics processing engines 431, 432, N may include different types of graphics processing engines within the GPU, such as a graphics execution unit, a media processing engine (e.g., a video encoder / decoder), a sampler, and a bit block transfer (blit) engine. In other words, the graphics acceleration module can be a GPU with multiple graphics processing engines 431-432, N, or the graphics processing engines 431-432, N can be individual GPUs integrated on a common package, line card, or chip.

[0092] In one embodiment, the accelerator integrated circuit 436 includes a memory management unit (MMU) 439 for performing various memory management functions, such as virtual to physical memory translation (also known as effective to real memory translation) and memory access protocols for accessing the system memory 441. The MMU 439 may also include a translation lookaside buffer (TLB) (not shown) for caching virtual / effective to physical / real address translations. In one implementation, the cache 438 stores commands and data for efficient access by the graphics processing engines 431-432, N. In one embodiment, the data stored in the cache 438 and the graphics memory 433-434, N is kept consistent with the core caches 462A-462D, 456 and the system memory 411. As mentioned, this may be accomplished via proxy circuitry 425, which participates in cache coherence mechanisms on behalf of cache 438 and memories 433-434, N (e.g., sending updates to cache 438 (related to modifications / accesses of cache lines on processor caches 462A-462D, 456) and receiving updates from cache 438).

[0093] A set of registers 445 stores context data for threads executed by the graphics processing engines 431-432, N, and context management circuitry 448 manages thread contexts. For example, context management circuitry 448 may perform save and restore operations during context switches to save and restore contexts for various threads (e.g., where a first thread is saved and a second thread is stored so that the second thread can be executed by the graphics processing engine). For example, upon context switching, context management circuitry 448 may store current register values ​​to a designated area in memory (e.g., identified by a context pointer). It may then restore the register values ​​upon returning to the context. In one embodiment, interrupt management circuitry 447 receives and processes interrupts received from system devices.

[0094] In one implementation, the virtual / effective addresses from the graphics processing engine 431 are translated into real / physical addresses in the system memory 411 by the MMU 439. One embodiment of the accelerator integrated circuit 436 supports multiple (e.g., 4, 8, 16) graphics accelerator modules 446 and / or other accelerator devices. The graphics accelerator module 446 may be dedicated to a single application executing on the processor 407, or may be shared between multiple applications. In one embodiment, a virtualized graphics execution environment is presented in which the resources of the graphics processing engines 431-432, N are shared with multiple applications or virtual machines (VMs). The resources may be subdivided into "slices" that are allocated to different VMs and / or applications (based on the processing requirements and priorities associated with the VMs and / or applications).

[0095] Thus, the accelerator integrated circuit acts as a bridge to the system for the graphics acceleration module 446 and provides address translation and system memory cache services. In addition, the accelerator integrated circuit 436 can provide virtualization facilities for the host processor to manage interrupts, memory management, and virtualization of the graphics processing engine.

[0096] Since the hardware resources of the graphics processing engines 431-432, N are explicitly mapped to the real address space seen by the host processor 407, any host processor can directly address these resources using effective address values. In one embodiment, one function of the accelerator integrated circuit 436 is the physical separation of the graphics processing engines 431-432, N so that they appear to the system as independent units.

[0097] As mentioned, in the illustrated embodiment, one or more graphics memories 433-434, M are respectively coupled to each of the graphics processing engines 431-432, N. The graphics memories 433-434, M store instructions and data being processed by each of the graphics processing engines 431-432, N. The graphics memories 433-434, M may be volatile memory, such as DRAM (including stacked DRAM), GDDR memory (e.g., GDDR5, GDDR6), or HBM, and / or may be non-volatile memory, such as 3D XPoint or Nano-Ram.

[0098] In one embodiment, to reduce data traffic on link 440, biasing techniques are used to ensure that the data stored in graphics memory 433-434, M is data that will be used most frequently by graphics processing engines 431-432, N and preferably not used (at least not frequently) by cores 460A-460D. Similarly, the biasing mechanism attempts to keep data needed by a core (and preferably not graphics processing engines 431-432, N) within system memory 411 and the core's cache 462A-462D, 456.

[0099] Figure 4C Another embodiment is shown in which an accelerator integrated circuit 436 is integrated within the processor 407. In this embodiment, the graphics processing engines 431-432, N communicate directly to the accelerator integrated circuit 436 via the interface 437 and the interface 435 (again, which may utilize any form of bus or interface protocol) through the high-speed link 440. The accelerator integrated circuit 436 may execute the same instructions as those for the graphics processing engines 431-432, N. Figure 4B The same operations as those described, but at potentially higher throughput given their close proximity to the coherency bus 462 and caches 462A-462D, 426.

[0100] One embodiment supports different programming models, including a dedicated process programming model (without graphics acceleration module virtualization) and a shared programming model (with virtualization). The latter may include a programming model controlled by accelerator integrated circuit 436 and a programming model controlled by graphics acceleration module 446.

[0101] In one embodiment of a dedicated process model, the graphics processing engines 431-432, N are dedicated to a single application or process under a single operating system. A single application can funnel other application requests to the graphics engines 431-432, N, thereby providing virtualization within a VM / partition.

[0102] In a dedicated process programming model, graphics processing engines 431-432, N can be shared by multiple VM / application partitions. The shared model requires a hypervisor to virtualize graphics processing engines 431-432, N to allow access by each operating system. For a single partition system without a hypervisor, graphics processing engines 431-432, N are owned by the operating system. In both cases, the operating system can virtualize graphics processing engines 431-432, N to provide access to each process or application.

[0103] For the shared programming model, the graphics acceleration module 446 or the individual graphics processing engines 431-432, N use a process handle to select a process element. In one embodiment, the process element is stored in the system memory 411 and is addressable using the effective address to real address conversion techniques described herein. The process handle can be an implementation-specific value provided to the host process when registering its context with the graphics processing engine 431-432, N (that is, calling the system software to add the process element to the process element linked list). The lower 16 bits of the process handle can be the offset of the process element within the process element linked list.

[0104] Figure 4D An exemplary accelerator integrated slice 490 is shown. As used herein, a "slice" includes a specified portion of the processing resources of the accelerator integrated circuit 436. The application effective address space 482 within the system memory 411 stores process elements 483. In one embodiment, the process element 483 is stored in response to a GPU call (invocation) 481 from an application 480 executed on the processor 407. The process element 483 contains the process state for the corresponding application 480. The work descriptor (WD) 484 contained in the process element 483 can be a single job requested by the application, or can contain a pointer to a job queue. In the latter case, WD 484 is a pointer to a job request queue in the address space 482 of the application.

[0105] Graphics acceleration module 446 and / or individual graphics processing engines 431-432, N may be shared by all processes or a subset of processes in the system. Embodiments of the present invention include infrastructure for setting up process state and sending WD 484 to graphics acceleration module 446 to start a job in a virtualized environment.

[0106] In one implementation, the dedicated process programming model is implementation specific. In this model, a single process owns the graphics acceleration module 446 or individual graphics processing engine 431. Since the graphics acceleration module 446 is owned by a single process, the hypervisor initializes the accelerator integrated circuit 436 for the owning partition, and the operating system initializes the accelerator integrated circuit 436 for the owning process (when assigning the graphics acceleration module 446).

[0107] In operation, the WD extraction unit 491 in the accelerator integrated slice 490 extracts the next WD 484, which includes an indication of the work to be completed by one of the graphics processing engines of the graphics acceleration module 446. The data from the WD 484 can be stored in the register 445 and used by the MMU 439, the interrupt management circuit 447 and / or the context management circuit 446 as shown. For example, one embodiment of the MMU 439 includes a segment / page walk circuitry for accessing the segment / page table 486 within the OS virtual address space 485. The interrupt management circuit 447 can handle the interrupt event 492 received from the graphics acceleration module 446. When performing graphics operations, the effective address 493 generated by the graphics processing engine 431-432, N is converted into a real address by the MMU 439.

[0108] In one embodiment, the same set of registers 445 is replicated for each graphics processing engine 431-432, N, and / or graphics acceleration module 446, and can be initialized by a hypervisor or operating system. Each of these replicated registers can be included in an accelerator integrated slice 490. Example registers that can be initialized by a hypervisor are shown in Table 1.

[0109] Table 1 - Registers initialized by the hypervisor

[0110] 1 Slice Control Register 2 Real address (RA) dispatched process area pointer 3 Permission Mask Override Register 4 Interrupt vector table entry offset 5 Interrupt Vector Table Entry Limits 6 Status Register 7 Logical Partition ID 8 Real Address (RA) Hypervisor Accelerator Utilizing Record Pointers 9 Storage Description Register

[0111] Example registers that may be initialized by the operating system are shown in Table 2.

[0112] Table 2 - Registers initialized by the operating system

[0113] 1 Process and thread identities 2 Effective Address (EA) context save / restore pointer 3 Virtual Address (VA) Accelerator Utilizes Record Pointers 4 Virtual Address (VA) Segment Table Pointer 5 Permission masking 6 Job Descriptor

[0114] In one embodiment, each WD 484 is specific to a particular graphics acceleration module 446 and / or graphics processing engine 431-432, N. It contains all the information required by the graphics processing engine 431-432, N to complete its work, or it may be a pointer to a memory location of a command queue where the application has set up work to be done.

[0115] Figure 4E Additional details for one embodiment of the sharing model are shown. This embodiment includes a hypervisor real address space 498 in which a process element list 499 is stored. The hypervisor real address space 498 is accessible via a hypervisor 496 that virtualizes a graphics acceleration module engine for an operating system 495.

[0116] The shared programming model allows all processes or subsets of processes from all partitions or subsets of partitions in the system to use the graphics acceleration module 446. There are two programming models where the graphics acceleration module 446 is shared by multiple processes and partitions: time-slice shared and graphics directed shared.

[0117] In this model, the hypervisor 496 owns the graphics acceleration module 446 and makes its functionality available to all operating systems 495. In order for the graphics acceleration module 446 to support virtualization by the hypervisor 496, the graphics acceleration module 446 may comply with the following requirements: 1) The application's job requests must be autonomous (that is, there is no need to maintain state between jobs), or the graphics acceleration module 446 must provide a context save and restore mechanism. 2) The application's job requests are guaranteed to be completed within a specified amount of time by the graphics acceleration module 446 (including any translation failures), or the graphics acceleration module 446 provides the ability to preempt the processing of a job. 3) When operating in a directed sharing programming model, the graphics acceleration module 446 must be guaranteed fairness between processes.

[0118] In one embodiment, for the shared model, the application 480 is required to make an operating system 495 system call with a graphics acceleration module 446 type, a work descriptor (WD), an authority mask register (AMR) value, and a context save / restore region pointer (CSRP). The graphics acceleration module 446 type describes the targeted acceleration function for the system call. The graphics acceleration module 446 type can be a system-specific value. The WD is formatted specifically for the graphics acceleration module 446 and can take the form of a graphics acceleration module 446 command, an effective address pointer to a user-defined structure, an effective address pointer to a command queue, or any other data structure for describing the work to be completed by the graphics acceleration module 446. In one embodiment, the AMR value is the AMR state to be used for the current process. The value passed to the operating system is similar to the application of setting the AMR. If the accelerator integrated circuit 436 and the graphics acceleration module 446 implementation do not support the user authority mask override register (UAMOR), the operating system can apply the current UAMOR value to the AMR value (before passing the AMR in the hypervisor call). Optionally, the hypervisor 496 may apply the current privilege mask overwrite register (AMOR) value (before placing the AMR into the process element 483). In one embodiment, the CSRP is one of the registers 445 that contains the effective address of an area in the application's address space 482 for the graphics acceleration module 446 to save and restore context state. This pointer is optional if state is not required to be saved between jobs or when a job is preempted. The context save / restore area may be pinned system memory.

[0119] Upon receiving the system call, the operating system 495 may verify that the application 480 has been registered and has been given permission to use the graphics acceleration module 446. The operating system 495 then calls the hypervisor 496 with the information shown in Table 3.

[0120] Table 3 – OS to Hypervisor call parameters

[0121] 1 Work Descriptor (WD) 2 Authority Mask Register (AMR) value (potentially masked) 3 Effective Address (EA) Context Save / Restore Region Pointer (CSRP) 4 Process ID (PID) and optional thread ID (TID) 5 Virtual Address (VA) Accelerator Utilization Record Pointer (AURP) 6 Virtual address of the storage segment table pointer (SSTP) 7 Logical Interrupt Service Number (LISN)

[0122] Upon receiving the hypervisor call, the hypervisor 496 verifies that the operating system 495 has registered and has been given permission to use the graphics acceleration module 446. The hypervisor 496 then places the process element 483 into a linked list of process elements for the corresponding type of graphics acceleration module 446. The process element may include the information shown in Table 4.

[0123] Table 4 - Process element information

[0124]

[0125]

[0126] In one embodiment, the hypervisor initializes the plurality of accelerator integrated slice 490 registers 445 .

[0127] like Figure 4F As shown in, one embodiment of the present invention employs a unified memory addressable via a common virtual memory address space, which is used to access physical processor memory 401-402 and GPU memory 420-423. In this implementation, operations executed on GPU 410-413 utilize the same virtual / effective memory address space to access processor memory 401-402 and vice versa, thereby simplifying programmability. In one embodiment, a first portion of the virtual / effective address space is allocated to processor memory 401, a second portion is allocated to second processor memory 402, a third portion is allocated to GPU memory 420, and so on. The entire virtual / effective memory space (sometimes referred to as the effective address space) is thereby distributed across each of processor memory 401-402 and GPU memory 420-423, thereby allowing any processor or GPU to access any physical memory (using a virtual address mapped to that memory).

[0128] In one embodiment, bias / coherency management circuits 494A-494E within one or more of MMUs 439A-439E ensure cache coherency between caches of a host processor (e.g., 405) and GPUs 410-413 and implement biasing techniques that indicate physical memory where certain types of data should be stored. Figure 4F Multiple instances of bias / consistency management circuits 494A- 494E are shown in , but bias / consistency circuits may be implemented within an MMU of one or more host processors 405 and / or within an accelerator integrated circuit 436 .

[0129] One embodiment allows the use of shared virtual memory (SVM) technology to access GPU-attached memory 420-423 and map it as part of system memory without experiencing the typical performance drawbacks associated with full system cache coherence. The ability of GPU-attached memory 420-423 to be accessed as system memory without heavy cache coherence overhead provides a beneficial operating environment for GPU offloading. This arrangement allows the host processor 405 software to set operands and access calculation results without the overhead of traditional I / O DMA data copying. Such traditional copies involve driver calls, interrupts, and memory-mapped I / O (MMIO) accesses, which are all inefficient relative to simple memory accesses. At the same time, the ability to access GPU-attached memory 420-423 without cache coherence overhead can be critical to the execution time of offloaded calculations. In the case of having a substantial stream transfer write memory business, for example, the cache coherence overhead can significantly reduce the effective write bandwidth seen by GPU 410-413. The efficiency of operand setting, the efficiency of result access, and the efficiency of GPU calculation all play a role in determining the effectiveness of GPU offloading.

[0130] In one implementation, the selection between GPU bias and host processor bias is driven by a bias tracker data structure. For example, a bias table may be used, which may be a page granular structure comprising 1 or 2 bits per GPU attached memory page (i.e., controlled at the granularity of a memory page). The bias table may be implemented in a stolen memory range of one or more GPU attached memories 420-423, with or without a bias cache in the GPUs 410-413 (e.g., to cache frequently / recently used entries of the bias table). Alternatively, the entire bias table may be maintained within the GPU.

[0131] In one implementation, the bias table entry associated with each access to GPU-attached memory 420-423 is accessed before actually accessing the GPU memory, thereby causing the following operations. First, local requests from GPUs 410-413 to find their pages in the GPU bias are forwarded directly to the corresponding GPU memory 420-423. Local requests from the GPU to find their pages in the host bias are forwarded to the processor 405 (e.g., via a high-speed link as discussed above). In one embodiment, the request from the processor 405 to find the requested page in the host processor bias completes a request similar to a normal memory read. Alternatively, the request for a page of the GPU bias can be forwarded to the GPU 410-413. Then, if the GPU is not currently using the page, the GPU can transfer the page to the host processor bias.

[0132] The bias state of a page may be changed by a software-based mechanism, a hardware-assisted software-based mechanism, or, for a limited set of situations, a purely hardware-based mechanism.

[0133] One mechanism for changing the bias state employs an API call (e.g., OpenCL), which in turn calls the GPU's device driver, which in turn sends a message (or enqueues a command descriptor) to the GPU, instructing it to change the bias state and perform a cache flushing operation in the host for some transitions. The cache flushing operation is required for transitions from host processor 405 bias to GPU bias, but not for the reverse transition.

[0134] In one embodiment, cache coherency is maintained by temporarily rendering GPU biased pages uncacheable by host processor 405. To access these pages, processor 405 may request access from GPU 410, which may or may not immediately grant access (depending on the implementation). Therefore, to reduce communication between processor 405 and GPU 410, it is advantageous to ensure that GPU biased pages are those pages that are required by the GPU but not by host processor 405 (and vice versa).

[0135] Graphics processing pipeline

[0136] Figure 5 2. A graphics processing pipeline 500 is shown according to an embodiment. In one embodiment, a graphics processor may implement the illustrated graphics processing pipeline 500. The graphics processor may be included in a parallel processing subsystem as described herein (such as parallel processor 200 of FIG. 2), which in one embodiment is Figure 12 . Various parallel processing systems may implement the graphics processing pipeline 500 via one or more instances of a parallel processing unit (e.g., parallel processing unit 202 of FIG. 2 ) as described herein. For example, a shader unit (e.g., graphics multiprocessor 234 of FIG. 3 ) may be configured to perform the functions of one or more of a vertex processing unit 504, a tessellation control processing unit 508, a tessellation evaluation processing unit 512, a geometry processing unit 516, and a fragment / pixel processing unit 524. The functions of the data assembler 502, primitive assemblers 506, 514, 518, tessellation unit 510, rasterizer 522, and raster operations unit 526 may also be performed by other processing engines within a processing cluster (e.g., processing cluster 214 of FIG. 3 ) and corresponding partition units (e.g., partition units 220A-220N of FIG. 2 ). The graphics processing pipeline 500 may also be implemented using dedicated processing units for one or more functions. In one embodiment, one or more portions of the graphics processing pipeline 500 may be executed by parallel processing logic within a general purpose processor (e.g., a CPU). In one embodiment, one or more portions of the graphics processing pipeline 500 may access on-chip memory (e.g., such as parallel processor memory 222 in FIG. 2 ) via a memory interface 528, which may be an example of the memory interface 218 of FIG. 2 .

[0137] In one embodiment, data assembler 502 is a processing unit that collects vertex data for surfaces and primitives. Data assembler 502 then outputs the vertex data, including vertex attributes, to vertex processing unit 504. Vertex processing unit 504 is a programmable execution unit that executes vertex shader programs, lighting and transforming vertex data as specified by the vertex shader programs. Vertex processing unit 504 reads data stored in cache, local or system memory for use in processing vertex data, and vertex processing unit 504 can be programmed to transform vertex data from an object-based coordinate representation to a world space coordinate space or a normalized device coordinate space.

[0138] A first instance of primitive assembler 506 receives vertex attributes from vertex processing unit 504. Primitive assembler 506 reads the stored vertex attributes as needed and builds graphics primitives for processing by tessellation control processing unit 508. Graphics primitives include triangles, line segments, points, patches, etc. as supported by various graphics processing application programming interfaces (APIs).

[0139] The tessellation control processing unit 508 treats the input vertices as control points for the geometric patch. The control points are transformed from the input representation from the patch (e.g., the basis of the patch) to a representation suitable for use in surface evaluation by the tessellation evaluation processing unit 512. The tessellation control processing unit 508 can also calculate tessellation factors for the edges of the geometric patch. The tessellation factors are applied to a single edge and quantize the view-dependent detail level associated with the edge. The tessellation unit 510 is configured to receive the tessellation factors for the edges of the patch and tessellate the patch into a plurality of geometric primitives such as lines, triangles, or quadrilateral primitives, which are transmitted to the tessellation evaluation processing unit 512. The tessellation evaluation processing unit 512 operates on the parameterized coordinates of the subdivided patch to generate a surface representation and vertex attributes for each vertex associated with the geometric primitive.

[0140] A second instance of primitive assembler 514 receives vertex attributes from tessellation evaluation processing unit 512 (which reads stored vertex attributes as needed) and builds graphics primitives for processing by geometry processing unit 516. Geometry processing unit 516 is a programmable execution unit that executes geometry shader programs to transform graphics primitives received from primitive assembler 514 as specified by the geometry shader programs. In one embodiment, geometry processing unit 516 is programmed to subdivide the graphics primitive into one or more new graphics primitives and to compute parameters for rasterizing the new graphics primitives.

[0141] In some embodiments, the geometry processing unit 516 may add or delete elements in the geometry stream. The geometry processing unit 516 outputs parameters and vertices specifying new graphics primitives to the primitive assembler 518. The primitive assembler 518 receives the parameters and vertices from the geometry processing unit 516 and constructs the graphics primitives for processing by the viewport scaling, picking, and clipping unit 520. The geometry processing unit 516 reads data stored in the parallel processor memory or the system memory for use in processing the geometry data. The viewport scaling, picking, and clipping unit 520 performs clipping, picking, and viewport scaling, and outputs the processed graphics primitives to the rasterizer 522.

[0142] The rasterizer 522 may perform depth sorting and other depth-based optimizations. The rasterizer 522 also performs scan conversion on new graphics primitives to generate fragments, and outputs those fragments and associated coverage data to the fragment / pixel processing unit 524. The fragment / pixel processing unit 524 is a programmable execution unit configured to execute a fragment shader program or a pixel shader program. The fragment / pixel processing unit 524 transforms the fragments or pixels received from the rasterizer 522 as specified by the fragment or pixel shader program. For example, the fragment / pixel processing unit 524 may be programmed to perform the following operations to generate shaded fragments or pixels output to the raster operation unit 526, including but not limited to texture mapping, shading, blending, texture correction, and perspective correction. The fragment / pixel processing unit 524 may read data stored in a parallel processor memory or system memory for use in processing fragment data. The fragment or pixel shader program may be configured to shade in samples, pixels, tiles, or other granularities (depending on the sampling rate configured for the processing unit).

[0143] Raster operations unit 526 is a processing unit that performs raster operations including, but not limited to, stenciling, z-testing, blending, and the like, and outputs pixel data as processed graphics data for storage in graphics memory (e.g., parallel processor memory 222 in FIG. 2 and / or as Figure 1 The raster operations unit 526 may be configured to compress the z or color data written to the memory and to decompress the z or color data read from the memory.

[0144] Asynchronous display

[0145] Fig. 6A6 is a block diagram 600 illustrating a conventional raster scanning process for displaying an image on a display. The block diagram 600 includes a computing device 602 coupled to a 4x4 raster scan display 604 in a communicative manner. It is noted that the 4x4 raster scan display 604 is for illustrative purposes only. Those skilled in the art will appreciate that the small number of pixels in the display 604 is greatly minimized. In a real-world display, such as, for example, an HD (high definition) display, there may be 1920x1080 pixels. The computing device 602 may further include a central processing unit (CPU), a graphics processing unit (GPU), and a memory, such as, but not limited to, a random access memory. The computing device 602 may be any device that outputs an image, a picture, a video, or other visual data to be displayed. For example, the computing device 602 may be, but is not limited to, a camera, a DVD player, a gaming system, a graphics adapter, a mobile phone, a tablet, a wearable device, etc. The computing device 602 outputs an image to be displayed on the display 604. In one embodiment, the display 604 may be a built-in component of the computing device 602 (such as, but not limited to, a tablet, a phone, or a wearable device). In another embodiment, the display 604 may be externally connected to the computing device 602 .

[0146] The process of displaying an image on the display 604 is called raster scanning. Raster scanning updates each pixel on the display 604 one pixel at a time on a per-frame basis. It updates each row of pixels from left to right and from top to bottom. Fig. 6A The lines and arrows depicted in illustrative examples illustrate the order in which pixels are updated on display 604.

[0147] As indicated previously, a frame rate of 30 frames per second is good for human perception, but when virtual reality, augmented reality, or gaming is added, 30 frames per second is not enough to control latency. Systems today attempt to address latency issues by increasing the frames per second to 90 or 120 frames per second. This helps keep latency down, but requires more computing power. The following is an embodiment that helps reduce latency while optimizing power.

[0148] In one embodiment, the data to be displayed is sent asynchronously. Instead of having to refresh every pixel at a certain rate, only the pixels that change from one frame to the next are sent. For example, if you are watching a scene where the background remains the same and the only thing that changes from frame to frame is the expression on the character's face, only the pixels on the display that represent the changing facial expression are refreshed. The background pixels remain the same and therefore do not need to be refreshed.

[0149] Figure 6B 6 is a block diagram 610 illustrating that the computing device 602 updates only the pixels on the display 604 that have changed. Figure 6B As shown in FIG. , instead of having a circular shape (such as Fig. 6A ), pixel 606 now represents the shape of an octagon. Computing device 602, when refreshing display 604, only sends one pixel, namely pixel 606 (the pixel that changed). The remaining pixels are not changed, and therefore are not updated or refreshed. Since pixel 606 is updated asynchronously when it changes from a circle to an octagon instead of being updated in the next frame, the latency for the update is reduced. Much less power is consumed to update one pixel (pixel 606) versus updating all 16 pixels on display 604.

[0150] Block-based camera updates

[0151] In one embodiment, the camera provides a mechanism for capturing images on the camera and determining pixel-based blocks that have been updated from one image to the next. After determining the updated block or region, the camera sends the updated block / region along with metadata containing the corresponding pixel block address (x,y) coordinates to the SOC (System on Chip) or memory panel display to composite the updated block / region with the previous frame for display on the memory panel display.

[0152] Fig. 7A 7 is an exemplary block diagram 700 for block-based camera update according to an embodiment. Block diagram 700 includes a camera 702, a system on chip 706, a memory 708, and a display 710. Camera 702 is connected to system on chip 706, and system on chip 706 is connected to memory 708 and display 710. The SOC further includes one or more memories, an ISP (image signal processor) for processing images, a CPU, and a GPU. Fig. 7A As shown, camera 702 determines update block / region 704. Update block / region 704 represents the changes between previous image n-1 and current image n.

[0153] Fig. 7E An update block / region according to an embodiment is illustrated. Frame 0 represents image n-1, and frame 1 represents image n. Frame 1 is the same as frame 0, except for a small block / region of frame 1, which is indicated as update block / region 704. Instead of processing the entire frame 1, only the update block / region 704 is processed from camera 702 to display 710. Update block / region 704 is determined by camera 702.

[0154] Back to Fig. 7A, the update block 704 is passed to the SOC along with metadata containing pixel block address coordinates (X, Y) defining the location of the update block 704 in the image. In one embodiment, the SOC 706 fuses the update block 704 with the previous image n-1 stored in the memory 708. The SOC 706 uses the pixel block address coordinates (X, Y) to fuse the update block 704 at the appropriate location on the previous image n-1. The SOC 706 then stores the image with the update block 704 in the memory 708 and sends the image containing the update block 704 to the display 710. The display 710 is updated with the image containing the update block 704 (as shown in the display 710).

[0155] Figure 7B is an exemplary flow chart describing a method for a camera to determine an update block according to an embodiment. The process begins at block 718 where the process continues to block 720.

[0156] Immediately after the process starts, at block 720 , the camera sets the first image bit to 1. The first image bit, when set, indicates that the camera is about to acquire a first image. The process continues to block 722 .

[0157] At block 722, the camera acquires an image, referred to as image n. Image n is stored in the camera memory. The process then proceeds to decision block 723.

[0158] At decision block 723 , it is determined whether the first image bit is set. If it is determined that the first image bit is set, then image n is to be sent to the SOC. The process then continues to block 725 .

[0159] At block 725 , image n is sent to the SOC along with the first image bit to indicate that image n is the first image and should be displayed. The process continues to decision block 727 .

[0160] Returning to decision block 723 , if it is determined that the first image bit is 0, the process continues to block 724 .

[0161] At block 724, the camera determines what regions have changed from the previous image n-1. In one embodiment, the camera divides the image into multiple small regions when determining what regions have changed (i.e., updating block 704). For each region, a CRC (cyclic redundancy check) value is determined. The CRC value is used to determine whether a region has changed from one image to the next. Fig.7D A more detailed description of the process for determining what regions have changed from the previous image n-1 is provided. In another embodiment, the camera may use a different algorithm to determine what regions have changed from image n-1 to image n, such as, for example, a histogram algorithm. Histograms and other algorithms are well known in the art. The process then continues to block 726.

[0162] At block 726 , each updated region is sent to the SOC 706 along with metadata containing corresponding X, Y coordinates indicating the location of the region in image n that has changed from the previous image n−1. The process then proceeds to decision block 727 .

[0163] At decision block 727, the SOC 706 will check to determine if this is the first image. If this is the first image, i.e., the first image bit is set to 1, then the first image is to be displayed, and the process continues to block 729. If the image is not the first image, the SOC will merge the updated region with the previous image n-1 to create a new image to be displayed (block 728). The new image, referred to as image n, is stored in memory 708. The process then continues to block 729.

[0164] In block 729 , the format of image n is modified to match the display format. The process then continues to block 731 .

[0165] At block 731, the formatted image is sent to the display. The process then continues to block 734.

[0166] At block 734, the formatted image is displayed on display 710. The first image bit is set to zero (0). This is an indication that the next captured image will not be the first image. The process then proceeds back to block 722 to capture the next image.

[0167] In one embodiment, display 710 may include a memory panel. The memory panel allows the fusion of update regions to occur on display 710 instead of on the SOC. Figure 7C is a flow chart illustrating an exemplary method for block-based camera updates using a display with a memory panel, according to an embodiment. The process begins at block 718 where the process continues to block 720.

[0168] Immediately after the process starts, at block 720 , the camera sets the first image bit to 1. This first image bit, when set, indicates that the camera is about to acquire a first image. The process then proceeds to block 722 .

[0169] At block 722, the camera acquires an image, referred to as image n. Image n is stored in the camera memory. The process then proceeds to decision block 723.

[0170] At decision block 723 , it is determined whether the first image bit is set. If it is determined that the first image bit is set, then image n is to be sent to the SOC. The process then continues to block 725 .

[0171] At block 725 , image n is sent to the SOC along with the first image bit to indicate that image n is the first image and should be displayed. The process continues to block 727 .

[0172] Returning to decision block 723 , if it is determined that the first image bit is 0, the process continues to block 724 .

[0173] At block 724, the camera determines what regions have changed from the previous image n-1. Fig.7D A more detailed description of the process for determining what regions have changed from the previous image n-1 is provided. The process then continues to block 726.

[0174] At block 726, each updated region is sent to SOC 706 along with metadata containing corresponding X, Y coordinates indicating the location of the region in image n. The first bit of the image is also sent to the SOC. The process then continues to decision block 727.

[0175] At decision block 727 , a determination is made as to whether the first image bit is set. If the first image bit is set, the process continues to block 729 .

[0176] At block 729 , the image format for image n is modified to match the display format. The process then continues to block 731 .

[0177] At block 731 , the formatted image is sent to the display. The process then continues to block 734 .

[0178] Returning to decision block 727, if the first image bit is 0, then at block 730, the image format for each update region is modified to match the display format. The process then continues to block 732.

[0179] At block 732, the formatted update regions and their corresponding X and Y values ​​are sent to the display. The process then continues to block 733.

[0180] As indicated previously, the display 710 includes a memory panel. The memory panel allows the display to store a previous image n-1. At block 733, the display retrieves the previous image n-1 from the display memory panel and merges the update region with the previous image n-1 to create a new image n. The new image n is stored in the display memory panel. The process continues to block 734.

[0181] At block 734, image n is displayed on display 710. The first image bit is set to zero (0). This is an indication that the next captured image will not be the first image. The process then proceeds back to block 722 to capture the next image.

[0182] Fig.7D is a flow chart of an exemplary method for determining an update region for block-based camera updating according to an embodiment. The process begins at block 740 , where the process continues to block 742 .

[0183] At block 742, the image is divided into small regions. The process then continues to block 744.

[0184] At block 744, a CRC value is determined for each region and stored in the camera memory. The process then continues to blocks 746 to 752.

[0185] In blocks 746 through 752, the following process occurs for each region: (1) the CRC value for the current image (image n) is compared with the CRC value for the previous image (image n-1) (block 748); (2) if the CRC values ​​are different (decision block 750), the region is selected as the update region and the corresponding X, Y coordinates for the update region are marked (block 752); and (3) return to block 748 until all regions have been compared.

[0186] The process then continues to block 754. At block 754, the process ends.

[0187] Asynchronous Game System

[0188] Figure 8 An asynchronous, event-driven exemplary game system 800 is shown in FIG. Game system 800 is a dedicated computer system for interactive video game play and display. Game system 800 further includes a CPU, a GPU, random access memory (RAM), speakers, etc. Game system 800 processes the video game and renders interactive video from the game via an asynchronous display 814. Figure 8 As shown, the gaming system 800 includes input devices such as, but not limited to, an eye tracker 802, a differential video camera 804, a 6DOF (6 degrees of freedom) tracker 806, a gesture tracker 808, and a game controller 810. The gaming system 800 may also receive input data / actions from a remote player via the Internet 812. The gaming system 800 outputs audio signals via a speaker (not explicitly shown) and sends updated video content (addresses and colored pixel content) to an asynchronous display 814 to update the display with content that has changed based on one or more events that have occurred during game play.

[0189] The eye tracker 802 monitors the changing position of the player's eyes. It tracks how the eyes move relative to the player's head. The eye tracker 802 outputs the changes in eye position and the time in which the changes occurred.

[0190] The differential video camera 804 tracks the amount of light falling on each pixel, and when the light fluctuates up or down, it sends an event indicating that the brightness has fluctuated up or down. The differential video camera 804 outputs the brightness change for the pixel and the corresponding address of the pixel.

[0191] The 6DOF tracker 806 tracks the player's head position with 6 degrees of freedom (ie, roll, pitch, yaw, x, y, and z). The 6DOF tracker 806 outputs the direction in which the head position moves and the time in which the head position changes.

[0192] The gesture tracker 808 tracks the player's hand activity to detect whether the player makes some kind of symbol with their hands, or whether they make some kind of motion with their hands that has some kind of relevance to the game being played. In other words, the gesture tracker 808 detects whether the player makes some kind of gesture with their hands. The gesture tracker 808 outputs the gesture made and the location where the gesture is made relative to the image on the display 814.

[0193] The game controller 810 is a device used with the game system 800 to provide input to the video game being played. The game controller 810 may include buttons and knobs. The buttons and knobs are typically used to control objects or characters in the video game. The game controller 810 outputs signals representing the buttons and knobs used by the game player.

[0194] The gaming system 800 may also receive actions from one or more remote players of the game as input via the Internet 812. Actions may range from controller buttons and knobs to hand gestures, head movements, eye movements, pixel changes along with corresponding addresses, and the like.

[0195] In one embodiment, an asynchronous, event-driven system uses event-driven cameras and sensors to drive an asynchronous gaming system 800, which in turn drives an asynchronous display 814. In an embodiment, instead of updating each pixel on the display 814 at a fixed frame rate, the interface to the display 814 is modified to only send changes to the display when an event occurs. For example, an event can be, but is not limited to: a change in head and / or eye position, a new gesture, a controller change, a camera change, a change in action from a remote player over the Internet, etc. At the time any of these events occurs, the gaming system 800 will send the address and pixel change to the display. The display then updates the location of the change using the pixel address with the pixel representing the change.

[0196] Frame / update scheduler based on prioritized input

[0197] Local sensors 802, 804, 806, and 808, game controller 810, and actions from remote players over the Internet are all asynchronous inputs into the game system 800. With so many asynchronous inputs into the game system 800, a method is needed to listen to the asynchronous inputs and determine when enough things have changed to cause a scene change that requires a new frame or block update to be rendered. In an embodiment, a scheduler can be used with an asynchronous display to determine when to listen to the asynchronous inputs and determine when enough things have changed to render a new frame or block update. The scheduler uses the addition of event inputs and relative weights to each event input to determine when to render a new frame or block.

[0198] Fig. 9 An example score table based on event inputs to the gaming system 800 is shown. The values ​​in the score table may be application specific and, therefore, may be different for different gaming situations. For example, the events that drive the display may depend on the type of game being played. If the game being played requires intensive use of a headset, then events based on the headset may be weighted more heavily than other inputs.

[0199] like Fig. 9 As shown in the example of , example events that may occur that cause the scheduler to determine that a frame or block should be rendered and displayed on an asynchronous display include: smooth eye tracking events, glance eye tracking events, controller events, head position change events, camera events, network events, and gesture events. Each event has an initial score to be applied at time t=0. For example, smooth eye tracking at time t=0 is a score of 50 points, while network events at t=0 are a score of 5 points. According to the table, the score is updated every millisecond. For example, smooth eye tracking increases by 20 points per millisecond, while network events increase by 10 points per millisecond. The table also includes an update limit for each event. For example, smooth eye tracking has an update limit of 10msec, while network events have an update limit of 300msec.

[0200] Fig.10 1000 is a flow chart illustrating an exemplary event driven process for event driven frame or block updates on an asynchronous display according to an embodiment. The process begins at block 1002 where the process immediately proceeds to block 1004.

[0201] At block 1004 , the scheduler waits for an event input or a timeout. The process then continues to block 1006 .

[0202] At block 1006 , the corresponding weight associated with the occurring event is added to the score. The process then proceeds to decision block 1008 .

[0203] At decision block 1008, determine whether the limit has been exceeded. If the limit has not been exceeded, the process returns to block 1004 where it waits for an event input or a timeout.

[0204] Returning to decision block 1008, if the limit has been exceeded, the process proceeds to block 1010. At block 1010, the frame or block is updated based on the event. The process then proceeds to block 1012.

[0205] At block 1012, the score is cleared. The process then proceeds back to block 1004 where it waits for an event input or a timeout.

[0206] Using a simple case where only smooth eye tracking events occur, the limit is set to 200 points, and at block 1004, an event input for smooth eye tracking is received. At block 1006, the score is updated to 50 points, the score for smooth eye tracking at t0. At decision block 1008, it is determined that the limit has not been exceeded (t0) (the current score of 50 points does not exceed the limit of 200 points), so the process continues back to block 1004. At block 1004, no new events have occurred, but at t=1 msec, a timeout occurs, and the process continues to block 1006, where the score is increased by 20 points. So at time t1=1 msec, the score is now 70. If no new events occur, this process will repeat itself every msec until the score exceeds the limit. In other words, at t=8 msec, the score will be 210 points, which exceeds the 200 point limit used in this example. The process then continues to block 1010, where the frame or block is rendered and displayed. At block 1012, the score is then cleared, and the process proceeds back to block 1004 where it waits for another event input.

[0207] Display Technology

[0208] Now go to Fig.11, a performance-enhanced computing system 1100 is shown. In the illustrated example, a processor 1110 is coupled to a display 1120. The processor 1110 may generally generate an image to be displayed on an LCD panel 1150 of the display 1120. In one example, the processor 1110 includes a communication interface, such as, for example, a video graphics array (VGA), a display port (DP) interface, an embedded display port (eDP) interface, a high-definition multimedia interface (HDMI), a digital visual interface (DVI), and the like. The processor 1110 may be a graphics processor (e.g., a graphics processing unit / GPU) that processes graphics data and generates an image (e.g., a video frame, a still image) displayed on the LCD panel 1150. Moreover, the processor 1110 may include one or more image processing pipelines that generate pixel data. The image processing pipeline may conform to an OPENGL architecture or other suitable architecture. In addition, the processor 1110 may be connected to a host processor (e.g., a central processing unit / CPU), wherein the host processor executes one or more device drivers that control the processor 1110 and / or interact with it.

[0209] The illustrated display 1120 includes a timing controller (TCON) 1130 that can individually address different pixels in the LCD panel 1150 and update each individual pixel in the LCD panel 1150 per refresh cycle. In this regard, the LCD panel 1150 can include a plurality of liquid crystal elements, such as, for example, liquid crystals and integrated color filters. Each pixel of the LCD panel 1150 can include a group of three liquid crystal elements having red, green, and blue color filters, respectively. The LCD panel 1150 can arrange these pixels in a two-dimensional (2D) array, which is controlled via a row driver 1152 and a column driver 1154 to update the image being displayed by the LCD panel 1150. Thus, the TCON 1130 can drive the row driver 1152 and the column driver 1154 to address specific pixels of the LCD panel 1150. The TCON 1130 can also adjust the voltage provided to the liquid crystal element in the pixel to change the light intensity that penetrates each of the three liquid crystal elements, and thus change the color of the pixel displayed on the surface of the LCD panel 1150.

[0210] The backlight 1160 may include a plurality of light emitting elements, such as, for example, light emitting diodes (LEDs), arranged at the edges of the LCD panel 1150. Accordingly, the light generated by the LEDs may be dispersed by a diffuser (not shown) through the LCD panel 1150. In another example, the LEDs are arranged in a 2D array directly behind the LCD panel 1150, in a configuration sometimes referred to as direct backlighting because each LED disperses light through one or more corresponding pixels of the LCD panel 1150 positioned in front of the LED. The light emitting elements may also include compact fluorescent lamps (CFLs) arranged along one or more edges of the LCD panel 1150. To eliminate multiple edges, the combination of edges may be modified to achieve selective illumination of an area, where fewer lighting elements than a full set of lighting elements are used with less power.

[0211] The light emitting element may also include one or more sheets of electroluminescent material placed behind the LCD panel 1150. In such cases, light from the surface of the sheet may be dispersed through the pixels of the LCD panel 1150. In addition, the sheet may be divided into multiple regions, such as, for example, one divided into four. In one example, each region is individually controlled to illuminate only a portion of the LCD panel 1150. Other backlight solutions may also be used.

[0212] The illustrated display 1120 also includes a backlight controller (BLC) 1140 that provides voltage to the light emitting elements of the backlight 1160. For example, the BLC 1140 may include a pulse width modulation (PWM) driver (not shown) to generate a PWM signal that activates at least some of the light emitting elements of the backlight 1160. The duty cycle and frequency of the PWM signal may cause the light generated by the light emitting elements to dim. For example, a 100% duty cycle may correspond to the light emitting elements being fully powered on, and a 0% duty cycle may correspond to the light emitting elements being fully powered off. Thus, intermediate duty cycles (e.g., 25%, 50%) typically cause the light emitting elements to be turned on for a portion of the cycle period that is proportional to the percentage of the duty cycle. The cycle period may be fast enough so that the flickering of the light emitting elements is not noticeable to the human eye. In addition, the effect on the user may be that the degree of light emitted by the backlight 1160 is lower than when the backlight 1160 is fully activated. The BLC 1140 may be separate from or incorporated into the TCON 1130.

[0213] Alternatively, an emissive display system may be used, where the LCD panel 1150 would be replaced by an emissive display panel (eg, organic light emitting diode / OLED), the backlight 1160 would be omitted, and pixel color and brightness could be modulated directly using row and column drivers 1152, 1154, respectively.

[0214] Display resolution based on distance

[0215] Fig. 12A A situation is shown in which a user 1218 interacts with a data processing device 1200 that includes a display unit 1228. The display processing device 1200 may include, for example, a notebook computer, a desktop computer, a tablet computer, a convertible tablet, a mobile Internet device (MID), a personal digital assistant (PDA), a wearable device (e.g., a head mounted display / HMD), a media player, etc., or any combination thereof. The illustrated data processing device 1200 includes a processor 1224 (e.g., an embedded controller, a microcontroller, a host processor, a graphics processor) coupled to a memory 1222, which may include storage locations addressable by the processor 1224. As will be discussed in more detail, the distance sensor 1210 may enable a distance-based display resolution for the display unit 1228.

[0216] The illustrated memory 1222 contains display data 1226 to be rendered on the display unit 1228. In one example, the processor 1224 performs data conversion on the display data 1226 before presenting the display data 1226 on the display unit 1228. The post-processing engine 1214 may be executed on the processor 1224 to receive the display data 1226 and the output of the distance sensor 1210. The post-processing engine 1214 may modify the display data 1226 to enhance the readability of the screen content on the display unit 1228, reduce power consumption in the data processing device 1200, etc., or any combination thereof.

[0217] In addition to the operating system 1212 and the applications 1220, the illustrated memory 1222 stores a display resolution setting 1216. The display resolution setting 1216 may specify a number of pixels of the display data 1226 to be presented on the display unit 1228 along the length dimension and the width dimension. If the display data 1226 generated by the application 1220 is not compatible with the format of the display unit 1228, the processor 1224 may configure the scale of the display data 1226 to match the format of the display unit 1228. In this regard, the display resolution setting 1216 may be associated with and / or incorporated into configuration data defining other settings for the display unit 1228. Furthermore, the display resolution setting 1216 may be defined in terms of unit distance or area (e.g., pixels per inch / PPI) or other suitable parameters.

[0218] The application 1220 can generate a user interface, where the user 1218 can interact with the user interface to select a display resolution setting 1216 from one or more options provided through the user interface, enter the display resolution setting 1216 as a requested value, etc. Thus, the display data 1226 can be resized to fit the display resolution setting 1216 before being rendered on the display unit 1228.

[0219] The distance sensor 1210 may track the distance between the user 1218 and the display unit 1228, wherein the distance sensing may be triggered by a physical button associated with the data processing device 1200 / display unit 1228, by a user interface provided by the application 1220 and / or the loading of the operating system 1220, etc. For example, during booting of the data processing device 1200, the operating system 1212 may perform an automatic process for triggering distance sensing in the background or foreground. The distance sensing may be performed periodically or continuously.

[0220] Fig. 12B An example of a distance sensing scenario is shown. In the illustrated example, the distance sensor 1210 uses a transceiver 1208 to transmit an electromagnetic beam 1202 in the direction of a user 1218. Thus, the transceiver 1202 may be located at a data processing device 1200 ( Fig. 12A ). Electromagnetic beam 1202 may impact user 1218 and be reflected / scattered from user 1218 as return electromagnetic beam 1204. Return electromagnetic beam 1204 may be processed by processor 1224 ( Fig. 12A ) and / or post-processing engine 1214 ( Fig. 12A ) analysis to determine whether the user 1218 and the display unit 1228 ( Fig. 12A ) between the two images 1206. The distance 1206 can be used to adjust the display resolution setting 1216.

[0221] Display Layer

[0222] Now go to Fig.13 , a display system 1300 is shown in which cascaded display layers 1361, 1362, and 1363 are used to achieve spatial / temporal super-resolution in a display assembly 1360. In the illustrated example, the processor 1310 provides initial graphics data 1334 (e.g., video frames, still images) to the system 1300 via a bus 1320. The cascaded display program 1331 can be stored in a memory 1330, where the cascaded display program 1331 can be part of a display driver associated with the display assembly 1360. The illustrated memory 1330 also includes the initial graphics data 1334 and the factorized graphics data 1335. In one example, the cascaded display program 1331 includes a temporal factorization component 1332 and a spatial factorization component 1333. The temporal factorization component 1332 can perform temporal factorization calculations, and the spatial factorization component can perform spatial factorization calculations. The cascaded display program 1331 may derive factorized graphics data 1335 for presentation on each display layer 1361 , 1362 , and 1363 based on the user configuration and the initial graphics data 1334 .

[0223] Display assembly 1360 may be implemented as an LCD (liquid crystal display) such as used in head mounted display (HMD) applications. More specifically, display assembly 1360 may include a stack of LCD panels, an interface board, lens attachments, and the like. Each panel may, for example, operate at a native resolution of 1280x800 pixels and at a 60 Hz refresh rate. Other native resolutions, refresh rates, display panel technologies, and / or layer configurations may be used.

[0224] Multiple display units

[0225] Fig.14 A graphical display system 1400 is shown that includes a set of display units 1430 (1430a-1430n) that are generally operable to output a widescreen (e.g., panoramic) presentation 1440 that includes coordinated content in a cohesive and structured topology. In the illustrated example, a data processing device 1418 includes a processor 1415 that applies a logic function 1424 to hardware profile data 1402 received from the set of display units 1430 over a network 1420. When the hardware profile data is not found to match a set of settings in a hardware profile lookup table 1412, the application of the logic function 1424 to the hardware profile data 1402 may create a set of automatic topology settings 1406. The illustrated set of automatic topology settings 1406 is transmitted from the display processing device 1418 to the display units 1430 over the network 1420.

[0226] The processor 1415 may execute and run the logic function 1424 upon receiving the logic function 1424 from the display driver 1410. In this regard, the display driver 1410 may include an automatic topology module 1408 that automatically configures and constructs the topology of the display unit 1432 to create the presentation 1440. In one example, the display driver 1410 is a set of instructions that, when executed by the processor 1415, causes the data processing device 1418 to communicate with the display unit 1430, a video card, etc., and perform an automatic topology generation operation.

[0227] Data processing device 1418 may include, for example, a server, a desktop computer, a notebook computer, a tablet computer, a convertible tablet, a MID, a PDA, a wearable device, a media player, and the like. Thus, display processing device 1418 may include hardware control module 1416, storage device 1414, random access memory (RAM, not shown), a controller card including one or more video controller cards, and the like. In one example, display unit 1430 is a flat panel display (e.g., liquid crystal, active matrix, plasma, etc.), HMD, video projection device, and the like that coordinate with each other to produce presentation 1440. In addition, presentation 1440 may be generated based on media files stored in storage device 1414, where the media files may include, for example, movies, video clips, animations, advertisements, and the like, or any combination thereof.

[0228] The term "topology" may be considered as the number, scaling, shape, and / or other configuration parameters of the first display unit 1430a, the second display unit 1430b, the third display unit 1430n, and the like. Accordingly, the topology of the display unit 1430 may enable the presentation 1440 to be visually consistent, such that the individual portions of the presentation 1440 are proportional to and compatible with the original dimensions and extent of the media being played through the display unit 1430. Thus, the topology may constitute geometric properties and / or spatial relationships that are not affected by continuous changes in the size or shape of the content rendered in the presentation 1440. In one example, the automatic topology module 1408 includes a timing module 1426, a control module 1428, a signal monitor module 1432, and a signal display module 1434. The timing module 1426 may designate a specific display unit in the set of display units 1430 as a sample display unit. In such a case, the timing module 1426 may designate the remaining display units 1430 as additional display units. In one example, the timing module 1426 can automatically set the form factor to be compatible with the hardware profile data 1402 , where the presentation 1440 is automatically initiated by a sequence of graphic signals 1422 .

[0229] In one example, the control module 1428 modifies the set of automatic topology settings 1406. In addition, the signal monitor module 1432 can automatically monitor the sequence graphic signal 1422 and trigger the storage device 1414 to associate the set of automatic topology settings 1406 with the hardware profile lookup table 1412. Moreover, the signal monitor module 1432 can automatically detect changes in the set of display units 1430 according to a set of change criteria and automatically generate a new topology profile corresponding to the changes in the set of display units 1430. Thus, the new topology profile can be applied to the set of display units 1430. If the sequence graphic signal 1422 fails to meet a set of criteria, the signal monitor module 1432 can also trigger the signal display module 1434 to reapply the set of automatic topology settings 1406. If the hardware profile data 1402 does not support the automatic topology display of the sequence graphic signal 1422, the data processing device 1418 can report an error and record the error in the error log 1413.

[0230] Cloud-assisted media delivery

[0231] Now go to Fig.15 , the cloud gaming system 1500 includes a client 1540 coupled to a server 1520 via a network 1510. The client 1540 may generally be a consumer of graphics (e.g., games, virtual reality / VR, augmented reality / AR) content stored, processed, and rendered on the server 1520. The illustrated server 1520 (which may be scalable) has the capacity to provide graphics content to multiple clients simultaneously (e.g., by utilizing parallel and shared processing and rendering resources). In one example, the scalability of the server 1520 is limited by the capacity of the network 1510. Accordingly, there may be a certain threshold number of clients above which the service to all clients may be degraded.

[0232] In one embodiment, server 1520 includes a graphics processor (e.g., GPU) 1530, a host processor (e.g., CPU) 1524, and a network interface card (NIC) 1522. NIC 1522 can receive requests for graphics content from clients 1540. Requests from clients 1540 can cause graphics content to be retrieved from memory via applications executed on host processor 1524. Host processor 1524 can perform high-level operations such as, for example, determining the position, collision, and motion of objects in a given scene. Based on the high-level operations, host processor 1524 can generate rendering commands, which can be combined with scene data and executed by graphics processor 1530. Rendering commands can cause graphics processor 1530 to define scene geometry, shading, lighting, motion, textures, camera parameters, etc. for a scene to be rendered via client 1540.

[0233] More specifically, the illustrated graphics processor 1530 includes a graphics renderer 1532 that executes rendering procedures according to rendering commands generated by the host processor 1524. The output of the graphics renderer 1532 may be a raw video frame stream that is provided to a frame capturer 1534. The illustrated frame capturer 1534 is coupled to an encoder 1536, which may compress / format the raw video stream for transmission over the network 1510. The encoder 1536 may use a variety of video compression algorithms, such as, for example, the H.246 standard from the International Telecommunication Union Telecommunication Standardization Sector (ITUT), the MPEG4 Advanced Video Coding (AVC) standard from the International Organization for Standardization / International Electrotechnical Commission (ISO / IEC), and the like.

[0234] The illustrated client 1540 (which may be a desktop computer, notebook computer, tablet computer, convertible tablet, wearable device, MID, PDA, media player, etc.) includes a NIC 1542 for receiving a transmitted video stream from the server 1520. The NIC 1522 may include the base and physical layers of the software layer for the network interface in the client 1540 to facilitate communication over the network 1510. The client 1540 may also include a decoder 1544 that employs the same formatting / compression scheme of the encoder 1536. Thus, the decompressed video stream may be provided from the decoder 1544 to a video renderer 1546. The illustrated video renderer 1546 is coupled to a display 1548 that visually presents graphical content.

[0235] As already noted, the graphical content may include gaming content. In this regard, the client 1540 may perform real-time interactive streaming, which involves collecting user input from the input device 1550 and delivering the user input to the server 1520 via the network 1510. This real-time interactive component of cloud gaming may pose challenges with respect to latency.

[0236] Additional System Overview Examples

[0237] Fig.16 16 is a block diagram of a processing system 1600 according to an embodiment. In various embodiments, the system 1600 includes one or more processors 1602 and one or more graphics processors 1608, and may be a single-processor desktop system, a multi-processor workstation system, or a server system with a large number of processors 1602 or processor cores 1607. In one embodiment, the system 1600 is a processing platform incorporated within a system-on-chip (SoC) integrated circuit for use in a mobile device, a handheld device, or an embedded device.

[0238] Embodiments of system 1600 may include or be incorporated into the following: a server-based gaming platform, a gaming console (including gaming and media consoles, mobile gaming consoles, handheld gaming consoles, or online gaming consoles). In some embodiments, system 1600 is a mobile phone, a smart phone, a tablet computing device, or a mobile Internet device. Data processing system 1600 may also include, be coupled to, or be integrated into the following: a wearable device, such as a smart watch wearable device, a smart glasses (eyewear) device, an augmented reality device, or a virtual reality device. In some embodiments, data processing system 1600 is a television or set-top box device having one or more processors 1602 and a graphical interface generated by one or more graphics processors 1608.

[0239] In some embodiments, one or more processors 1602 each include one or more processor cores 1607 for processing instructions, which when executed perform operations for system and user software. In some embodiments, each of the one or more processor cores 1607 is configured to process a specific instruction set 1609. In some embodiments, the instruction set 1609 can facilitate complex instruction set computing (CISC), reduced instruction set computing (RISC), or computing via very long instruction words (VLIW). Multiple processor cores 1607 can each process different instruction sets 1609, and the instruction set may include instructions for facilitating emulation of other instruction sets. The processor core 1607 may also include other processing devices, such as a digital signal processor (DSP).

[0240] In some embodiments, the processor 1602 includes a cache memory 1604. Depending on the architecture, the processor 1602 may have a single internal cache or multiple levels of internal cache. In some embodiments, the cache memory is shared among various components of the processor 1602. In some embodiments, the processor 1602 also uses an external cache (e.g., a level 3 (L3) cache or a last level cache (LLC)) (not shown), which may be shared among the processor core 1607 using known cache coherence techniques. A register file 1606 is additionally included in the processor 1602, and the register file may include different types of registers (e.g., integer registers, floating point registers, status registers, and instruction pointer registers) for storing different types of data. Some registers may be general purpose registers, while other registers may be specific to the design of the processor 1602.

[0241] In some embodiments, processor 1602 is coupled to processor bus 1610 to transmit communication signals (such as address, data or control signals) between processor 1602 and other components in system 1600. In one embodiment, system 1600 uses an exemplary 'hub' system architecture, including a memory controller hub 1616 and an input output (I / O) controller hub 1630. Memory controller hub 1616 facilitates communication between memory devices and other components of system 1600, while I / O controller hub (ICH) 1630 provides connections to I / O devices via a local I / O bus. In one embodiment, the logic of memory controller hub 1616 is integrated within the processor.

[0242] The memory device 1620 may be a dynamic random access memory (DRAM) device, a static random access memory (SRAM) device, a flash memory device, a phase change memory device, or some other memory device having suitable properties to act as process memory. In one embodiment, the memory device 1620 may operate as system memory for the system 1600 to store data 1622 and instructions 1621 for use when the one or more processors 1602 execute applications or processes. The memory controller hub 1616 is also coupled to an optional external graphics processor 1612, which may communicate with one or more graphics processors 1608 in the processor 1602 to perform graphics and media operations.

[0243] In some embodiments, the ICH 1630 enables peripherals to connect to the memory device 1620 and the processor 1602 via a high-speed I / O bus. The I / O peripherals include, but are not limited to, an audio controller 1646, a firmware interface 1628, a wireless transceiver 1626 (e.g., Wi-Fi, Bluetooth), a data storage device 1624 (e.g., a hard drive, flash memory, etc.), and a legacy I / O controller 1640 for coupling legacy (e.g., Personal System 2 (PS / 2)) devices to the system. One or more Universal Serial Bus (USB) controllers 1642 connect input devices (such as a keyboard and mouse 1644 combination). A network controller 1634 may also be coupled to the ICH 1630. In some embodiments, a high-performance network controller (not shown) is coupled to the processor bus 1610. It will be appreciated that the system 1600 shown is exemplary and not limiting, as other types of data processing systems configured in different ways may also be used. For example, the I / O controller hub 1630 may be integrated within the one or more processors 1602 , or the memory controller hub 1616 and the I / O controller hub 1630 may be integrated within a discrete external graphics processor (such as the external graphics processor 1612 ).

[0244] Fig.17 is a block diagram of an embodiment of a processor 1700 having one or more processor cores 1702A- 1702N, an integrated memory controller 1714 , and an integrated graphics processor 1708 . Fig.17 Those elements in the figure having the same reference numbers (or names) as those of any other figure herein may operate or function in any manner similar to that described elsewhere herein, but are not limited thereto. Processor 1700 may include additional cores up to and including additional core 1702N represented by a dashed box. Each of processor cores 1702A-1702N includes one or more internal cache units 1704A-1704N. In some embodiments, each processor core is also capable of accessing one or more shared cache units 1706.

[0245] Internal cache units 1704A-1704N and shared cache unit 1706 represent a cache memory hierarchy within processor 1700. The cache memory hierarchy may include at least one level of instruction and data cache within each processor core and one or more levels of shared intermediate level caches (such as level 2 (L2), level 3 (L3), level 4 (L4), or other level caches), where the highest level cache in front of external memory is classified as LLC. In some embodiments, cache coherence logic maintains coherence between the various cache units 1706 and 1704A-1704N.

[0246] In some embodiments, the processor 1700 may also include a set of one or more bus controller units 1716 and a system agent core 1710. The one or more bus controller units 1716 manage a set of peripheral buses, such as one or more peripheral component interconnect buses (e.g., PCI, PCI Express buses). The system agent core 1710 provides management functionality for various processor components. In some embodiments, the system agent core 1710 includes one or more integrated memory controllers 1714 to manage access to various external memory devices (not shown).

[0247] In some embodiments, one or more of the processor cores 1702A-1702N include support for simultaneous multithreading. In such embodiments, the system agent core 1710 includes components for coordinating and operating the cores 1702A-1702N during multithreaded processing. The system agent core 1710 may additionally include a power control unit (PCU) that includes logic and components for regulating the power state of the processor cores 1702A-1702N and the graphics processor 1708.

[0248] In some embodiments, the processor 1700 additionally includes a graphics processor 1708 for performing graphics processing operations. In some embodiments, the graphics processor 1708 is coupled to a set of shared cache units 1706 and a system agent core 1710 (including one or more integrated memory controllers 1714). In some embodiments, a display controller 1711 is coupled to the graphics processor 1708 to drive the graphics processor output to one or more coupled displays. In some embodiments, the display controller 1711 can be a separate module coupled to the graphics processor via at least one interconnect, or can be integrated within the graphics processor 1708 or the system agent core 1710.

[0249] In some embodiments, a ring-based interconnect unit 1712 is used to couple the internal components of the processor 1700. However, alternative interconnect units may be used, such as point-to-point interconnects, switched interconnects, or other technologies, including those well known in the art. In some embodiments, the graphics processor 1708 is coupled to the ring interconnect 1712 via an I / O link 1713.

[0250] Exemplary I / O links 1713 represent at least one of a variety of I / O interconnects, including an on-package I / O interconnect that facilitates communication between various processor components and high-performance embedded memory modules 1718 (such as eDRAM modules). In some embodiments, each of processor cores 1702-1702N and graphics processor 1708 use embedded memory modules 1718 as a shared last-level cache.

[0251] In some embodiments, processor cores 1702A-1702N are homogeneous cores that execute the same instruction set architecture. In another embodiment, processor cores 1702A-1702N are heterogeneous in terms of instruction set architecture (ISA), wherein one or more of processor cores 1702A-N execute a first instruction set, while at least one of the other cores executes a subset of the first instruction set or a different instruction set. In one embodiment, processor cores 1702A-1702N are heterogeneous in terms of microarchitecture, wherein one or more cores with relatively higher power consumption are coupled with one or more power cores with lower power consumption. In addition, processor 1700 can be implemented on one or more chips or as a SoC integrated circuit having the components shown in addition to other components.

[0252] Fig.181 is a block diagram of a graphics processor 1800, which may be a discrete graphics processing unit, or may be a graphics processor integrated with multiple processing cores. In some embodiments, the graphics processor communicates via a mapped I / O interface to registers on the graphics processor and using commands placed in processor memory. In some embodiments, the graphics processor 1800 includes a memory interface 1814 for accessing memory. The memory interface 1814 may be an interface to local memory, one or more internal caches, one or more shared external caches, and / or to system memory.

[0253] In some embodiments, the graphics processor 1800 also includes a display controller 1802 for driving display output data to a display device 1820. The display controller 1802 includes hardware for the composition of multiple layers of video or user interface elements and one or more overlapping planes for the display. In some embodiments, the graphics processor 1800 includes a video codec engine 1806 for encoding, decoding, or transcoding media to, from, or between one or more media encoding formats, including but not limited to: Moving Picture Experts Group (MPEG) formats (such as MPEG-2), Advanced Video Coding (AVC) formats (such as H.264 / MPEG-4 AVC), and Society of Motion Picture & Television Engineers (SMPTE) 421M / VC-1, and Joint Photographic Experts Group (JPEG) formats (such as JPEG, and Motion JPEG (MJPEG) formats).

[0254] In some embodiments, graphics processor 1800 includes a block image transfer (BLIT) engine 1804 for performing two-dimensional (2D) rasterizer operations, including, for example, bit boundary block transfers. However, in one embodiment, 2D graphics operations are performed using one or more components of a graphics processing engine (GPE) 1810. In some embodiments, graphics processing engine 1810 is a compute engine for performing graphics operations, including three-dimensional (3D) graphics operations and media operations.

[0255] In some embodiments, GPE 1810 includes a 3D pipeline 1812 for performing 3D operations, such as rendering three-dimensional images and scenes using processing functions that act on 3D primitive shapes (e.g., rectangles, triangles, etc.). 3D pipeline 1812 contains programmable and fixed function elements that perform various tasks within the elements and / or generate execution threads to 3D / media subsystem 1815. Although 3D pipeline 1812 can be used to perform media operations, embodiments of GPE 1810 also include a media pipeline 1816 that is specifically used to perform media operations, such as video post-processing and image enhancement.

[0256] In some embodiments, the media pipeline 1816 includes fixed function or programmable logic units for performing one or more specialized media operations (such as video decoding acceleration, video deinterlacing, and video encoding acceleration) instead of or on behalf of the video codec engine 1806. In some embodiments, the media pipeline 1816 additionally includes a thread generation unit to generate threads for execution on the 3D / media subsystem 1815. The generated threads perform calculations for the media operations on one or more graphics execution units included in the 3D / media subsystem 1815.

[0257] In some embodiments, the 3D / media subsystem 1815 includes logic for executing threads generated by the 3D pipeline 1812 and the media pipeline 1816. In one embodiment, the pipeline sends thread execution requests to the 3D / media subsystem 1815, which includes thread dispatch logic for arbitrating and dispatching various requests for available thread execution resources. The execution resources include an array of graphics execution units for processing 3D and media threads. In some embodiments, the 3D / media subsystem 1815 includes one or more internal caches for thread instructions and data. In some embodiments, the subsystem also includes shared memory (including registers and addressable memory) to share data between threads and store output data.

[0258] 3D / Media Processing

[0259] Fig.19 is a block diagram of a graphics processing engine 1910 of a graphics processor according to some embodiments. In one embodiment, GPE 1910 is Fig.18 The version of GPE 1810 shown in . Fig.19 Elements in the drawings having the same reference numbers (or names) as elements of any other figure herein may operate or function in any manner similar to that described elsewhere herein, but are not limited thereto.

[0260] In some embodiments, the GPE 1910 is coupled to a command streamer 1903 that transmits command streams to the GPE 3D and media pipelines 1912, 1916. In some embodiments, the command streamer 1903 is coupled to a memory, which may be a system memory, or may be one or more of an internal cache memory and a shared cache memory. In some embodiments, the command streamer 1903 receives commands from the memory and sends the commands to the 3D pipeline 1912 and / or the media pipeline 1916. The commands are instructions extracted from a ring buffer storing commands for the 3D pipeline 1912 and the media pipeline 1916. In one embodiment, the ring buffer may additionally include a batch command buffer storing multiple batches of multiple commands. The 3D pipeline 1912 and the media pipeline 1916 process the commands by performing operations via logic within the respective pipelines or by dispatching one or more execution threads to the execution unit array 1914. In some embodiments, execution unit array 1914 is scalable such that the array includes a variable number of execution units based on the target power and performance level of GPE 1910 .

[0261] In some embodiments, sampling engine 1930 is coupled to memory (e.g., cache memory or system memory) and execution unit array 1914. In some embodiments, sampling engine 1930 provides a memory access mechanism for execution unit array 1914 that allows execution array 1914 to read graphics and media data from memory. In some embodiments, sampling engine 1930 includes logic for performing specialized image sampling operations for media.

[0262] In some embodiments, the specialized media sampling logic in the sampling engine 1930 includes a denoising / de-interlacing module 1932, a motion estimation module 1934, and an image scaling and filtering module 1936. In some embodiments, the denoising / de-interlacing module 1932 includes logic for performing one or more of a denoising or de-interlacing algorithm on the decoded video data. The de-interlacing logic combines the alternating fields of the interlaced video content into a single frame of video. The denoising logic reduces or removes data noise from the video and image data. In some embodiments, the denoising logic and the de-interlacing logic are motion adaptive and use spatial or temporal filtering based on the amount of motion detected in the video data. In some embodiments, the denoising / de-interlacing module 1932 includes specialized motion detection logic (e.g., within the motion estimation engine 1934).

[0263] In some embodiments, the motion estimation engine 1934 provides hardware acceleration of video operations by performing video acceleration functions (such as motion vector estimation and prediction) on video data. The motion estimation engine determines motion vectors that describe transformations of image data between consecutive video frames. In some embodiments, the graphics processor media codec uses the video motion estimation engine 1934 to perform operations on macroblock-level video that otherwise may be too computationally intensive to perform using a general-purpose processor. In some embodiments, the motion estimation engine 1934 may be generally available to the graphics processor component to assist in video decoding and processing functions that are sensitive or adaptive to the direction or magnitude of motion within the video data.

[0264] In some embodiments, the image scaling and filtering module 1936 performs image processing operations to enhance the visual quality of the generated images and videos. In some embodiments, the scaling and filtering module 1936 processes the image and video data during a sampling operation before providing the data to the execution unit array 1914.

[0265] In some embodiments, GPE 1910 includes a data port 1944 that provides an additional mechanism for enabling the graphics subsystem to access memory. In some embodiments, data port 1944 facilitates memory access for operations including render target writes, constant buffer reads, scratch memory space reads / writes, and media surface accesses. In some embodiments, data port 1944 includes a cache memory space for caching accesses to memory. The cache memory can be a single data cache, or separated into multiple caches (e.g., render buffer caches, constant buffer caches, etc.) for multiple subsystems that access memory via data ports. In some embodiments, threads executing on execution units in execution unit array 1914 communicate with the data port by exchanging messages via a data distribution interconnect that couples each subsystem of GPE 1910.

[0266] Execution Unit

[0267] Fig. 20 is a block diagram of another embodiment of a graphics processor 2000 . Fig. 20 Elements in the drawings having the same reference numbers (or names) as elements of any other figure herein may operate or function in any manner similar to that described elsewhere herein, but are not limited thereto.

[0268] In some embodiments, graphics processor 2000 includes ring interconnect 2002, pipeline front end 2004, media engine 2037, and graphics cores 2080A-2080N. In some embodiments, ring interconnect 2002 couples the graphics processor to other processing units, including other graphics processors or one or more general-purpose processor cores. In some embodiments, the graphics processor is one of many processors integrated into a multi-core processing system.

[0269] In some embodiments, the graphics processor 2000 receives batches of commands via the ring interconnect 2002. The incoming commands are interpreted by the command streamer 2003 in the pipeline front end 2004. In some embodiments, the graphics processor 2000 includes scalable execution logic for performing 3D geometry processing and media processing via the graphics cores 2080A-2080N. For 3D geometry processing commands, the command streamer 2003 supplies the commands to the geometry pipeline 2036. For at least some media processing commands, the command streamer 2003 supplies the commands to the video front end 2034, which is coupled to the media engine 2037. In some embodiments, the media engine 2037 includes a video quality engine (VQE) 2030 for video and image post-processing and a multi-format encoding / decoding (MFX) 2033 engine for providing hardware accelerated media data encoding and decoding. In some embodiments, the geometry pipeline 2036 and the media engine 2037 each generate an execution thread, which is used for thread execution resources provided by at least one graphics core 2080A.

[0270] In some embodiments, the graphics processor 2000 includes scalable thread execution resources featuring modular cores 2080A-2080N (sometimes referred to as core slices), each modular core having multiple sub-cores 2050A-2050N, 2060A-2060N (sometimes referred to as core sub-slices). In some embodiments, the graphics processor 2000 can have any number of graphics cores 2080A to 2080N. In some embodiments, the graphics processor 2000 includes a graphics core 2080A, which has at least a first sub-core 2050A and a second sub-core 2060A. In other embodiments, the graphics processor is a low-power processor with a single sub-core (e.g., 2050A). In some embodiments, the graphics processor 2000 includes multiple graphics cores 2080A-2080N, each graphics core including a group of first sub-cores 2050A-2050N and a group of second sub-cores 2060A-2060N. Each of the group of first sub-cores 2050A-2050N includes at least a first group of execution units 2052A-2052N and a media / texture sampler 2054A-2054N. Each of the group of second sub-cores 2060A-2060N includes at least a second group of execution units 2062A-2062N and a sampler 2064A-2064N. In some embodiments, each sub-core 2050A-2050N, 2060A-2060N shares a group of shared resources 2070A-2070N. In some embodiments, these shared resources include shared cache memory and pixel operation logic. Other shared resources may also be included in various embodiments of the graphics processor.

[0271] Fig.21 Thread execution logic 2100 is shown, including an array of processing elements employed in some embodiments of a GPE. Fig.21 Those elements in the EMBODIMENTS having the same reference numbers (or names) as elements of any other figure herein may operate or function in any manner similar to that described elsewhere herein, but are not limited thereto.

[0272] In some embodiments, the thread execution logic 2100 includes a pixel shader 2102, a thread dispatcher 2104, an instruction cache 2106, a scalable execution unit array (including multiple execution units 2108A-2108N), a sampler 2110, a data cache 2112, and a data port 2114. In one embodiment, these included components are interconnected via an interconnect structure that is linked to each of these components. In some embodiments, the thread execution logic 2100 includes one or more connections to a memory (such as a system memory or a cache memory) through one or more of the instruction cache 2106, the data port 2114, the sampler 2110, and the execution unit array 2108A-2108N. In some embodiments, each execution unit (e.g., 2108A) is a separate vector processor that is capable of executing multiple simultaneous threads and processing multiple data elements in parallel for each thread. In some embodiments, the execution unit array 2108A-2108N includes any number of separate execution units.

[0273] In some embodiments, execution unit arrays 2108A-2108N are primarily used to execute "shader" programs. In some embodiments, the execution units in arrays 2108A-2108N execute an instruction set that includes native support for many standard 3D graphics shader instructions, so that shader programs from graphics libraries (e.g., Direct 3D and OpenGL) are executed with minimal conversion. The execution units support vertex and geometry processing (e.g., vertex programs, geometry programs, vertex shaders), pixel processing (e.g., pixel shaders, fragment shaders), and general processing (e.g., compute and media shaders).

[0274] Each execution unit in the execution unit array 2108A-2108N operates on an array of data elements. The number of data elements is the "execution size" or the number of lanes for the instruction. An execution lane is a logical unit used for execution of flow control, data element access, and masking within an instruction. The number of lanes may be independent of the number of physical arithmetic logic units (ALUs) or floating point units (FPUs) for a particular graphics processor. In some embodiments, the execution units 2108A-2108N support integer and floating point data types.

[0275] The execution unit instruction set includes single instruction multiple data (SIMD) instructions. Various data elements can be stored in registers as compact data types, and the execution unit will process various elements based on the data size of the element. For example, when operating on a 256-bit wide vector, the 256-bit vector is stored in a register, and the execution unit operates on the vector as four independent 64-bit compact data elements (data elements of quadruple word length (QW) size), eight independent 32-bit compact data elements (data elements of double word length (DW) size), sixteen independent 16-bit compact data elements (data elements of word length (W) size), or thirty-two independent 8-bit data elements (data elements of byte (B) size). However, different vector widths and register sizes are possible.

[0276] One or more internal instruction caches (e.g., 2106) are included in the thread execution logic 2100 to cache thread instructions for the execution unit. In some embodiments, one or more data caches (e.g., 2112) are included to cache thread data during thread execution. In some embodiments, a sampler 2110 is included to provide texture sampling for 3D operations and media sampling for media operations. In some embodiments, the sampler 2110 includes specialized texture or media sampling functionality to process texture or media data during the sampling process before providing the sampled data to the execution unit.

[0277] During execution, the graphics pipeline and the media pipeline send thread initiation requests to the thread execution logic 2100 via the thread generation and dispatch logic. In some embodiments, the thread execution logic 2100 includes a local thread dispatcher 2104 that arbitrates thread initiation requests from the graphics pipeline and the media pipeline and instantiates the requested threads on one or more execution units 2108A-2108N. For example, the geometry pipeline (e.g., Fig. 20 2036) dispatches vertex processing, tessellation or geometry processing threads to thread execution logic 2100 ( Fig.21 ). In some embodiments, thread dispatcher 2104 may also process runtime thread generation requests from executing shader programs.

[0278] Once the group of geometric objects has been processed and rasterized into pixel data, the pixel shader 2102 is called to further calculate output information and cause the results to be written to output surfaces (e.g., color buffers, depth buffers, stencil buffers, etc.). In some embodiments, the pixel shader 2102 calculates the values ​​of various vertex attributes, which are interpolated across rasterized objects. In some embodiments, the pixel shader 2102 then executes a pixel shader program supplied by an application programming interface (API). To execute the pixel shader program, the pixel shader 2102 dispatches threads to execution units (e.g., 2108A) via a thread dispatcher 2104. In some embodiments, the pixel shader 2102 uses texture sampling logic in a sampler 2110 to access texture data in a texture map stored in memory. Arithmetic operations performed on the texture data and the input geometric data calculate pixel color data for each geometric fragment, or discard one or more pixels for further processing.

[0279] In some embodiments, data port 2114 provides a memory access mechanism for thread execution logic 2100 to output processed data to memory for processing on the graphics processor output pipeline. In some embodiments, data port 2114 includes or is coupled to one or more cache memories (e.g., data cache 2112) to cache data for memory access via the data port.

[0280] Fig. 22 is a block diagram illustrating a graphics processor instruction format 2200 according to some embodiments. In one or more embodiments, a graphics processor execution unit supports an instruction set having instructions in multiple formats. Solid line boxes show components that are typically included in an execution unit instruction, while dashed lines include components that are optional or included only in a subset of instructions. In some embodiments, the instruction format 2200 described and illustrated are macroinstructions in that they are instructions supplied to the execution unit, as opposed to micro-operations derived from instruction decoding (once the instruction is processed).

[0281] In some embodiments, the graphics processor execution unit natively supports instructions in 128-bit format 2210. A 64-bit compact instruction format 2230 is available for some instructions based on the selected instruction, instruction options, and the number of operands. Native 128-bit format 2210 provides access to all instruction options, while some options and operations are restricted to 64-bit format 2230. The native instructions available in 64-bit format 2230 vary according to the embodiment. In some embodiments, instructions are partially compacted using a set of index values ​​in index field 2213. The execution unit hardware references a set of compact tables based on these index values, and uses the compact table output to reconstruct native instructions in 128-bit format 2210.

[0282] For each format, the instruction opcode 2212 defines the operation to be performed by the execution unit. The execution unit executes each instruction in parallel across multiple data elements of each operand. For example, in response to an addition instruction, the execution unit performs a simultaneous addition operation across each color channel representing a texture element or a picture element. By default, the execution unit executes each instruction across all data channels of the operand. In some embodiments, the instruction control field 2214 enables control of certain execution options such as channel selection (e.g., prediction) and data channel ordering (e.g., swizzling). For 128-bit instructions 2210, the execution size field 2216 limits the number of data channels that will be executed in parallel. In some embodiments, the execution size field 2216 is not available for use in the 64-bit compact instruction format 2230.

[0283] Some execution unit instructions have up to three operands, including two source operands src0 2220, src1 2222, and one destination 2218. In some embodiments, the execution unit supports dual destination instructions, where one of the destinations is implicit. Data manipulation instructions may have a third source operand (e.g., SRC2 2224), where the instruction opcode 2212 determines the number of source operands. The last source operand of an instruction may be an immediate (e.g., hard-coded) value passed by the instruction.

[0284] In some embodiments, the 128-bit instruction format 2210 includes access / addressing mode information 2226, which specifies, for example, whether direct register addressing mode or indirect register addressing mode is used. When direct register addressing mode is used, the register address of one or more operands is provided directly by bits in the instruction 2210.

[0285] In some embodiments, the 128-bit instruction format 2210 includes an access / addressing mode field 2226, which specifies an addressing mode and / or access mode for the instruction. In one embodiment, the access mode is used to define the data access alignment for the instruction. Some embodiments support access modes including 16-byte aligned access modes and 1-byte aligned access modes, wherein the byte alignment of the access mode determines the access alignment of the instruction operands. For example, when in a first mode, the instruction 2210 may use byte-aligned addressing for source operands and destination operands, and when in a second mode, the instruction 2210 may use 16-byte aligned addressing for all source operands and destination operands.

[0286] In one embodiment, the addressing mode portion of the access / addressing mode field 2226 determines whether the instruction will use direct addressing or indirect addressing. When direct register addressing mode is used, the bits in the instruction 2210 directly provide the register address of one or more operands. When indirect register addressing mode is used, the register address of one or more operands can be calculated based on the address immediate field and the address register value in the instruction.

[0287] In some embodiments, instructions are grouped based on the opcode 2212 bit field to simplify opcode decoding 2240. For 8-bit opcodes, positions 4, 5 and 6 allow execution units to determine the type of opcode. The precise opcode grouping shown is only an example. In some embodiments, move and logic opcode groups 2242 include data movement and logic instructions (e.g., move (mov), compare (cmp)). In some embodiments, move and logic groups 2242 share five most significant bits (MSB), wherein the move (mov) instruction adopts the form of 0000xxxxb, and the logic instruction adopts the form of 0001xxxxb. Flow control instruction groups 2244 (e.g., call, jump (jmp)) include instructions using 0010xxxxb form (e.g., 0x20). Miscellaneous instruction groups 2246 include a mixture of instructions, which include synchronization instructions (e.g., wait, send) using 0011xxxxb form (e.g., 0x30). The parallel math instruction group 2248 includes component-wise arithmetic instructions (e.g., add, multiply (mul)) in the form of 0100xxxxb (e.g., 0x40). The parallel math group 2248 performs arithmetic operations in parallel across data lanes. The vector math group 2250 includes arithmetic instructions (e.g., dp4) in the form of 0101xxxxb (e.g., 0x50). The vector math group performs arithmetic such as dot production calculations on vector operands.

[0288] Graphics Pipeline

[0289] Fig.23 is a block diagram of another embodiment of a graphics processor 2300 . Fig.23 Elements in the drawings having the same reference numbers (or names) as elements of any other figure herein may operate or function in any manner similar to that described elsewhere herein, but are not limited thereto.

[0290] In some embodiments, the graphics processor 2300 includes a graphics pipeline 2320, a media pipeline 2330, a display engine 2340, a thread execution logic 2350, and a rendering output pipeline 2370. In some embodiments, the graphics processor 2300 is a graphics processor within a multi-core processing system that includes one or more general-purpose processing cores. The graphics processor is controlled by register writes to one or more control registers (not shown) or by commands issued to the graphics processor 2300 via the ring interconnect 2302. In some embodiments, the ring interconnect 2302 couples the graphics processor 2300 to other processing components, such as other graphics processors or general-purpose processors. Commands from the ring interconnect 2302 are interpreted by a command stream transmitter 2303, which supplies instructions to individual components of the graphics pipeline 2320 or the media pipeline 2330.

[0291] In some embodiments, the command streamer 2303 directs the operation of the vertex extractor 2305, which reads vertex data from memory and executes vertex processing commands provided by the command streamer 2303. In some embodiments, the vertex extractor 2305 provides the vertex data to the vertex shader 2307, which performs coordinate space transformation and lighting operations on each vertex. In some embodiments, the vertex extractor 2305 and the vertex shader 2307 execute the vertex processing instructions by dispatching execution threads to the execution units 2352A, 2352B via the thread dispatcher 2331.

[0292] In some embodiments, execution units 2352A, 2352B are arrays of vector processors with instruction sets for performing graphics and media operations. In some embodiments, execution units 2352A, 2352B have an attached L1 cache 2351 specific for each array or shared between arrays. The cache can be configured as a data cache, an instruction cache, or a single cache that is partitioned to contain data and instructions in different partitions.

[0293] In some embodiments, the graphics pipeline 2320 includes a tessellation component for performing hardware accelerated tessellation of 3D objects. In some embodiments, a programmable hull shader 2311 configures the tessellation operation. A programmable domain shader 2317 provides back-end evaluation of the tessellation output. The tessellation 2313 operates at the direction of the hull shader 2311 and contains dedicated logic for generating a set of detailed geometric objects based on a coarse geometric model that is provided as input to the graphics pipeline 2320. In some embodiments, if tessellation is not used, the tessellation components 2311, 2313, 2317 can be bypassed.

[0294] In some embodiments, the complete geometric object may be processed by the geometry shader 2319 via one or more threads dispatched to the execution units 2352A, 2352B, or may proceed directly to the clipper 2329. In some embodiments, the geometry shader operates on entire geometric objects (rather than patches or vertices of vertices as in previous stages of the graphics pipeline). If tessellation is disabled, the geometry shader 2319 receives input from the vertex shader 2307. In some embodiments, if the tessellation unit is disabled, the geometry shader 2319 may be programmed by a geometry shader program to perform geometry tessellation.

[0295] Prior to rasterization, the clipper 2329 processes the vertex data. The clipper 2329 can be a fixed function clipper or a programmable clipper with clipping and geometry shader functions. In some embodiments, a rasterizer 2373 (e.g., a depth test component) in the render output pipeline 2370 dispatches a pixel shader to convert geometric objects into their pixel-by-pixel representations. In some embodiments, the pixel shader logic is included in the thread execution logic 2350. In some embodiments, the application can bypass the rasterizer 2373 and access the unrasterized vertex data via the streaming out unit 2323.

[0296] The graphics processor 2300 has an interconnect bus, interconnect structure, or some other interconnect mechanism that allows data and messages to be passed among the major components of the processor. In some embodiments, the execution units 2352A, 2352B and associated cache(s) 2351, texture and media samplers 2354, and texture / sampler cache 2358 are interconnected via data ports 2356 to perform memory accesses and communicate with the processor's rendering output pipeline components. In some embodiments, the samplers 2354, caches 2351, 2358, and execution units 2352A, 2352B each have separate memory access paths.

[0297] In some embodiments, the rendering output pipeline 2370 includes a rasterizer 2373 that converts vertex-based objects into associated pixel-based representations. In some embodiments, the rasterizer logic includes a windower / masker unit for performing fixed-function triangle and line rasterization. An associated rendering cache 2378 and depth cache 2379 are also available in some embodiments. The pixel operation component 2377 performs pixel-based operations on data, although in some examples, pixel operations associated with 2D operations (e.g., bit block images are transmitted using blending) are performed by the 2D engine 2341, or replaced by a display controller 2343 using overlapping display planes at display time. In some embodiments, a shared L3 cache 2375 can be used for all graphics components, allowing data to be shared without using main system memory.

[0298] In some embodiments, the graphics processor media pipeline 2330 includes a media engine 2337 and a video front end 2334. In some embodiments, the video front end 2334 receives pipeline commands from the command streamer 2303. In some embodiments, the media pipeline 2330 includes a separate command streamer. In some embodiments, the video front end 2334 processes the media commands before sending them to the media engine 2337. In some embodiments, the media engine 2337 includes thread generation functionality for generating threads for dispatching to the thread execution logic 2350 via the thread dispatcher 2331.

[0299] In some embodiments, the graphics processor 2300 includes a display engine 2340. In some embodiments, the display engine 2340 is external to the processor 2300 and is coupled to the graphics processor via the ring interconnect 2302, or some other interconnect bus or structure. In some embodiments, the display engine 2340 includes a 2D engine 2341 and a display controller 2343. In some embodiments, the display engine 2340 includes dedicated logic that can operate independently of the 3D pipeline. In some embodiments, the display controller 2343 is coupled to a display device (not shown), which can be a system integrated display device (such as in a laptop computer), or can be an external display device attached via a display device connector.

[0300] In some embodiments, graphics pipeline 2320 and media pipeline 2330 can be configured to perform operations based on multiple graphics and media programming interfaces, and are not specific to any one application programming interface (API). In some embodiments, the driver software for the graphics processor converts the API calls specific to the specific graphics or media library into commands that can be processed by the graphics processor. In some embodiments, the open graphics library (OpenGL) and open computing language (OpenCL) from Khronos Group, the Direct 3D library from Microsoft Corporation provide support, or both OpenGL and D3D can be provided. It is also possible to provide support for the open source computer vision library (OpenCV). If it is possible to map the pipeline from the future API to the pipeline of the graphics processor, the future API with a compatible 3D pipeline will also be supported.

[0301] Graphics pipeline programming

[0302] Fig.24A is a block diagram of a graphics processor command format 2400 according to some embodiments. Fig. 24B is a block diagram of a graphics processor command sequence 2410 according to an embodiment. Fig.24A The solid-line boxes in show components that are generally included in a graphics command, while the dashed lines include components that are optional or included only in a subset of the graphics commands. Fig.24A The exemplary graphics processor command format 2400 includes a data field for identifying the target client 2402 of the command, a command operation code (opcode) 2404, and associated data 2406 for the command. In some commands, a sub-opcode 2405 and a command size 2408 are also included.

[0303] In some embodiments, client 2402 specifies the client unit of the graphics device that processes the command data. In some embodiments, the graphics processor command parser checks the client field of each command to adjust the further processing of the command and routes the command data to the appropriate client unit. In some embodiments, the graphics processor client unit includes a memory interface unit, a rendering unit, a 2D unit, a 3D unit, and a media unit. Each client unit has a corresponding processing pipeline for processing commands. Once the command is received by the client unit, the client unit reads the opcode 2404 and (if present) the sub-opcode 2405 to determine the operation to be performed. The client unit uses the information in the data field 2406 to execute the command. For some commands, an explicit command size 2408 is expected to specify the size of the command. In some embodiments, the command parser automatically determines the size of at least some of the commands in the command based on the command opcode. In some embodiments, the commands are aligned via multiples of the double word length.

[0304] Fig. 24B An exemplary graphics processor command sequence 2410 is shown in the flowchart of FIG. In some embodiments, software or firmware of a data processing system featuring an embodiment of a graphics processor uses a version of the command sequence shown to set up, execute, and terminate a set of graphics operations. The sample command sequence is shown and described for exemplary purposes only, as embodiments are not limited to these particular commands or this command sequence. In addition, the commands may be issued as a batch of commands in a command sequence so that the graphics processor will process the command sequence in an at least partially simultaneous manner.

[0305] In some embodiments, the graphics processor command sequence 2410 may begin with a pipeline dump clear command 2412 to cause any active graphics pipeline to complete currently pending commands for the pipeline. In some embodiments, the 3D pipeline 2422 and the media pipeline 2424 do not operate simultaneously. The pipeline dump clear is performed to cause the active graphics pipeline to complete any pending commands. In response to the pipeline dump clear, the command parser for the graphics processor will suspend command processing until the active drawing engine completes the pending operation and the associated read cache is invalidated. Optionally, any data marked as 'dirty' in the rendering cache can be dumped to memory. In some embodiments, the pipeline dump clear command 2412 can be used for pipeline synchronization or before placing the graphics processor in a low power state.

[0306] In some embodiments, when a command sequence requires the graphics processor to explicitly switch between pipelines, a pipeline select command 2413 is used. In some embodiments, a pipeline select command 2413 is only required once within an execution context before issuing pipeline commands unless the context is to issue commands for both pipelines. In some embodiments, a pipeline flush command 2412 is required immediately prior to a pipeline switch via a pipeline select command 2413.

[0307] In some embodiments, pipeline control commands 2414 configure the graphics pipeline for operation and are used to program 3D pipeline 2422 and media pipeline 2424. In some embodiments, pipeline control commands 2414 configure the pipeline state for the active pipeline. In one embodiment, pipeline control commands 2414 are used for pipeline synchronization and for clearing data from one or more cache memories within the active pipeline before processing a batch of commands.

[0308] In some embodiments, a set of return buffers for the corresponding pipeline to write data is configured using return buffer state commands 2416. Some pipeline operations require the allocation, selection, or configuration of one or more return buffers into which these operations write intermediate data during processing. In some embodiments, the graphics processor also uses one or more return buffers to store output data and perform cross-thread communication. In some embodiments, return buffer state 2416 includes selecting the size and number of return buffers to use for a set of pipeline operations.

[0309] The remaining commands in the command sequence differ based on the active pipeline for operation. Based on pipeline determination 2420 , the command sequence is tailored for either a 3D pipeline 2422 , which starts at 3D pipeline state 2430 , or a media pipeline 2424 , which starts at media pipeline state 2440 .

[0310] The commands for 3D pipeline state 2430 include 3D state setting commands for the following: vertex buffer state, vertex element state, constant color state, depth buffer state, and other state variables that will be configured before processing 3D primitive commands. The values ​​of these commands are determined at least in part based on the specific 3D API in use. In some embodiments, the 3D pipeline state 2430 commands can also selectively disable or bypass certain pipeline elements (if those elements will not be used).

[0311] In some embodiments, 3D primitive 2432 commands are used to submit 3D primitives processed by 3D pipeline. Commands and associated parameters passed to the graphics processor via 3D primitive 2432 are forwarded to the vertex extraction function in the graphics pipeline. The vertex extraction function uses 3D primitive 2432 command data to generate vertex data structure. The vertex data structure is stored in one or more return buffers. In some embodiments, 3D primitive 2432 commands are used to perform vertex operations on 3D primitives via vertex shaders. In order to process vertex shaders, 3D pipeline 2422 dispatches shader execution threads to graphics processor execution units.

[0312] In some embodiments, the 3D pipeline 2422 is triggered via an execution 2434 command or event. In some embodiments, a register write triggers the command execution. In some embodiments, the execution is triggered via a 'go' or 'kick' command in a command sequence. In one embodiment, the command execution is triggered using a pipeline synchronization command to dump and clear the command sequence through the graphics pipeline. The 3D pipeline will perform geometry processing for 3D primitives. Once the operation is completed, the resulting geometric object is rasterized, and the pixel engine colors the resulting pixels. Additional commands for controlling pixel shading and pixel backend operations may also be included for those operations.

[0313] In some embodiments, when performing media operations, the graphics processor command sequence 2410 follows the media pipeline 2424 path. Generally, the manner and specific use of programming for the media pipeline 2424 depends on the media or computing operation to be performed. During media decoding, specific media decoding operations can be offloaded to the media pipeline. In some embodiments, the media pipeline can also be bypassed and media decoding can be performed in whole or in part (using resources provided by one or more general processing cores). In one embodiment, the media pipeline also includes elements for general purpose graphics processor unit (GPGPU) operations, wherein the graphics processor is used to perform SIMD vector operations using compute shader programs, and the compute shader programs are not explicitly related to the rendering of graphics primitives.

[0314] In some embodiments, the media pipeline 2424 is configured in a similar manner to the 3D pipeline 2422. A set of media pipeline state commands 2440 are dispatched or placed into the command queue before the media object commands 2442. In some embodiments, the media pipeline state commands 2440 include data for configuring the media pipeline elements that will be used to process the media objects. This includes data (such as encoding or decoding formats) for configuring the video decoding and video encoding logic within the media pipeline. In some embodiments, the media pipeline state commands 2440 also support the use of one or more pointers to "indirect" state elements that contain a batch of state settings.

[0315] In some embodiments, media object commands 2442 supply pointers to media objects for processing by the media pipeline. The media object includes a memory buffer containing video data to be processed. In some embodiments, all media pipeline states must be valid before issuing media object commands 2442. Once the pipeline state is configured and media object commands 2442 are queued, media pipeline 2424 is triggered via an execution command 2444 or an equivalent execution event (e.g., a register write). The output from media pipeline 2424 can then be post-processed by operations provided by 3D pipeline 2422 or media pipeline 2424. In some embodiments, GPGPU operations are configured and executed in a manner similar to media operations.

[0316] Graphics software architecture

[0317] Fig.25 An exemplary graphics software architecture for data processing system 2500 is shown in accordance with some embodiments. In some embodiments, the software architecture includes 3D graphics application 2510, operating system 2520, and at least one processor 2530. In some embodiments, processor 2530 includes graphics processor 2532 and one or more general purpose processor cores 2534. Graphics application 2510 and operating system 2520 are each executed in system memory 2550 of the data processing system.

[0318] In some embodiments, the 3D graphics application 2510 includes one or more shader programs that include shader instructions 2512. The shader language instructions may be in a high-level shader language, such as a high-level shader language (HLSL) or an OpenGL shader language (GLSL). The application also includes executable instructions 2514 in a machine language suitable for execution by a general purpose processor core 2534. The application also includes graphics objects 2516 defined by vertex data.

[0319] In some embodiments, operating system 2520 is from Microsoft Corporation Operating system, proprietary UNIX-like operating system or open source UNIX-like operating system (using a variation of the Linux kernel). When the Direct3D API is in use, the operating system 2520 uses a front-end shader compiler 2524 to compile any shader instructions 2512 in HLSL into a lower-order shader language. The compilation can be a just-in-time (JIT) compilation, or the application can execute shader pre-compilation. In some embodiments, during the compilation of the 3D graphics application 2510, high-order shaders are compiled into low-order shaders.

[0320] In some embodiments, the user mode graphics driver 2526 includes a backend shader compiler 2527 that converts shader instructions 2512 into hardware specific representations. When the OpenGL API is in use, shader instructions 2512 in the GLSL high-level language are passed to the user mode graphics driver 2526 for compilation. In some embodiments, the user mode graphics driver 2526 uses the operating system kernel mode function 2528 to communicate with the kernel mode graphics driver 2529. In some embodiments, the kernel mode graphics driver 2529 communicates with the graphics processor 2532 to dispatch commands and instructions.

[0321] IP Core Implementation

[0322] One or more aspects of at least one embodiment may be implemented by representative code stored on a machine-readable medium, which represents and / or defines logic within an integrated circuit such as a processor. For example, a machine-readable medium may include instructions representing various logics within a processor. When read by a machine, the instructions may cause the machine to manufacture logic for performing the techniques described herein. Such representations (referred to as "IP cores") are reusable units of logic for an integrated circuit, which may be stored on a tangible, machine-readable medium as a hardware model describing the structure of the integrated circuit. The hardware model may be supplied to various consumers or manufacturing facilities, which load the hardware model on a manufacturing machine that manufactures the integrated circuit. The integrated circuit may be manufactured so that the circuit performs the operations described in association with any embodiment described herein.

[0323] Fig.26 2600 is a block diagram showing an IP core development system according to an embodiment, and the IP core development system can be used to manufacture an integrated circuit to perform operations. The IP core development system 2600 can be used to generate a modular, reusable design that can be incorporated into a larger design or used to build an entire integrated circuit (e.g., a SOC integrated circuit). The design facility 2630 can use a high-level programming language (e.g., C / C++) to generate a software simulation 2610 for the IP core design. The software simulation 2610 can be used to design, test and verify the behavior of the IP core. Then a register transfer level (RTL) design can be created or synthesized according to the simulation model 2600. The RTL design 2615 is an abstraction of the behavior of an integrated circuit (including associated logic executed using the modeled digital signals) that models the flow of digital signals between hardware registers. In addition to the RTL design 2615, a lower level design at a logic level or transistor level can also be created, designed or synthesized. Therefore, the specific details of the initial design and simulation can vary.

[0324] The RTL design 2615 or equivalent may be further synthesized into a hardware model 2620 by the design facility, which may be in a hardware description language (HDL) or some other representation of physical design data. The HDL may be further simulated or tested to verify the IP core design. The IP core design may be stored using a non-volatile memory 2640 (e.g., a hard disk, a flash memory, or any non-volatile storage medium) for delivery to a third-party manufacturing facility 2665. Alternatively, the IP core design may be transmitted (e.g., via the Internet) via a wired connection 2650 or a wireless connection 2660. The manufacturing facility 2665 may then manufacture an integrated circuit based at least in part on the IP core design. The manufactured integrated circuit may be configured to perform operations according to at least one embodiment described herein.

[0325] Fig. 27 2700, which can be manufactured using one or more IP cores. The exemplary integrated circuit includes one or more application processors 2705 (e.g., CPUs), at least one graphics processor 2710, and may additionally include an image processor 2715 and / or a video processor 2720, any of which may be modular IP cores from the same or multiple different design facilities. The integrated circuit includes peripherals or bus logic, including a USB controller 2725, a UART controller 2730, an SPI / SDIO controller 2735, an I 2 S / I 2 The integrated circuit may include a display device 2745 coupled to a high-definition multimedia interface (HDMI) controller 2750 and a mobile industry processor interface (MIPI) display interface 2755. Storage may be provided by a flash memory subsystem 2760 (including flash memory and a flash memory controller). A memory interface may be provided via a memory controller 2765 for accessing SDRAM or SRAM memory devices. Some integrated circuits additionally include an embedded security engine 2770.

[0326] Additionally, other logic and circuitry may be included in the processor of integrated circuit 2700 , including additional graphics processors / cores, peripheral interface controllers, or general purpose processor cores.

[0327] The present invention provides a set of technical solutions, as follows:

[0328] 1. A system for asynchronous display of frames, comprising:

[0329] computing means for determining changes between a current frame and a previous frame; and

[0330] an asynchronous display coupled to the computing device to display an image;

[0331] Wherein the computing device asynchronously sends frame updates to the asynchronous display to update only areas of a currently displayed image that have changed.

[0332] 2. A system as described in technical solution 1, wherein each area of ​​a new frame that is different from a corresponding area in the displayed image is sent to the asynchronous display as a frame update together with a corresponding pixel address to identify the position of the area that has changed.

[0333] 3. A system as described in technical solution 1, wherein the area of ​​the displayed image whose status is maintained in the new frame is not updated or refreshed.

[0334] 4. A system as described in technical solution 1, wherein the computing device determines the frame update by comparing a new frame to be rendered with the image currently displayed on the asynchronous display, and if an area has changed, the computing device sends the changed area as a frame update together with the corresponding pixel address of the area to identify the position of the area in the currently displayed image that has changed.

[0335] 5. A system as described in technical solution 1, wherein the computing device sends the updated frames to the display asynchronously rather than at a fixed frame rate.

[0336] 6. A method for asynchronously displaying pixels, comprising:

[0337] determining, by a computing device, changes to a new frame to be rendered on the asynchronous display, wherein the changes include pixels of an image currently displayed on the asynchronous display that have been changed in the new frame, wherein the changes represent updated pixels; and

[0338] The updated pixels are asynchronously sent by the computing device along with corresponding pixel addresses representing locations of the updated pixels to enable the asynchronous display to update the currently displayed image with the updated pixels based on the pixel addresses.

[0339] 7. At least one computer readable medium comprising a set of instructions,

[0340] The instructions, when executed by a computing device, cause the computing device to:

[0341] determining changes to a new frame to be rendered on the asynchronous display, wherein the changes include pixels of an image currently displayed on the asynchronous display that have been changed in the new frame, wherein the changes represent updated pixels; and

[0342] The updated pixels are sent asynchronously along with corresponding pixel addresses representing the locations of the updated pixels to enable the asynchronous display to update the currently displayed image with the updated pixels based on the pixel addresses.

[0343] 8. A system for block-based camera updating, comprising:

[0344] a camera for capturing an image n and determining pixel-based blocks for said image n that are different from an image n-1 previously captured by said camera;

[0345] A system on a chip (SOC) coupled to the memory device and to the camera, the SOC being configured to:

[0346] receiving the updated pixel-based block;

[0347] retrieving said image n-1 from said memory device;

[0348] fusing the updated pixel-based block with the image n-1 to obtain a fused image; and

[0349] The format of the fused image is modified into a display format.

[0350] 9. The system as described in technical solution 8 further includes a display coupled to the SOC, wherein the display is used to receive the fused image and display the fused image.

[0351] 10. A system for block-based camera updating, comprising:

[0352] a camera for capturing an image n and determining pixel-based blocks and corresponding pixel addresses for the image n that is different from an image n-1 previously captured by the camera;

[0353] A system on a chip (SOC) coupled to the memory device and to the camera, the SOC being configured to:

[0354] receiving the updated pixel-based block and corresponding pixel addresses;

[0355] The format of the updated pixel-based block is modified to a display format.

[0356] 11. The system of technical solution 10 further comprises a memory panel display coupled to the SOC, wherein the memory panel display is used to:

[0357] receiving the updated pixel-based blocks and the corresponding pixel addresses in a display format from the SOC;

[0358] retrieving said image n-1 from said memory panel display;

[0359] blending the updated pixel-based block in a display format with the image n-1 using the corresponding pixel addresses to obtain a fused image; and

[0360] The fused image is displayed.

[0361] 12. The system of claim 10, wherein the camera for determining pixel-based blocks for the image n is further configured to:

[0362] Dividing the image n into small areas;

[0363] Determine the CRC for each small area;

[0364] comparing the CRC for each region of image n with the corresponding CRC for each region of image n-1;

[0365] If the CRC for a region is different, the region is selected as the update region and the x, y coordinates for the region are marked.

[0366] 13. A method for block-based camera updating, comprising:

[0367] Capture an image using a camera n;

[0368] Determine what regions of image n have changed from previous image n-1;

[0369] Merging the changed region with the previous image n-1 to obtain a new image n; and

[0370] The new image n is displayed.

[0371] 14. The method of claim 13, wherein determining what area of ​​image n has changed from the previous image n-1 comprises:

[0372] Dividing the image n into small areas;

[0373] Determine the CRC (cyclic redundancy check) for each small area;

[0374] comparing the CRC for each region of image n with the corresponding CRC for each region of image n-1;

[0375] If the CRC for a region is different, the region is selected as the update region and the x, y coordinates for the region are marked.

[0376] 15. A method as described in technical solution 14, wherein the x and y coordinates define the position layout of the update area in image n-1.

[0377] 16. One or more computer readable media comprising a set of instructions,

[0378] The instructions, when executed by one or more processors, cause the processors to:

[0379] Capture image n;

[0380] determining what regions of image n have changed from said previous image n-1;

[0381] Merging the changed region with the previous image n-1 to obtain a new image n; and

[0382] The new image n is displayed.

[0383] 17. An asynchronous system for event-driven updates, comprising:

[0384] Computing systems;

[0385] a plurality of input devices communicatively coupled to the computing system; and

[0386] at least one output device;

[0387] Wherein upon occurrence of an event, based at least in part on an input device, the one input device causes the at least one output device to be asynchronously updated, wherein the update contains only changes that have occurred since the previous update.

[0388] 18. An asynchronous system as described in technical solution 17, wherein the output device to be updated at a time determined by the computing system includes at least one display, and wherein the computing system uses a score table including relative weights for each input device to determine when to render a new frame to the display.

[0389] 19. An asynchronous system as described in technical solution 17, wherein the computing system includes a gaming system, and the multiple inputs include event-driven cameras and sensors to asynchronously drive the gaming system.

[0390] 20. A method for event-driven frame updating on a display, the method comprising:

[0391] Waiting for an event or timeout caused by one or more input devices to the computing system;

[0392] upon receiving the event or the timeout, adding a corresponding weight associated with the event or the timeout to the score;

[0393] determining whether the score exceeds a predefined limit for the event;

[0394] If the score exceeds the predefined limit, updating the frame;

[0395] asynchronously displaying the updated frame;

[0396] clearing the score; and

[0397] Returns to wait for said event or timeout;

[0398] If the score does not exceed the predefined limit, return to wait for the event or timeout.

[0399] 21. A method as described in technical solution 20, wherein the one or more input devices include one or more event-driven cameras and sensors to drive an asynchronous gaming system.

[0400] 22. A method as described in technical solution 20, wherein a timeout occurs periodically when an event requires a score update.

[0401] 23. A method as described in technical solution 20, wherein the predefined limit includes a maximum limit based on the event.

[0402] 24. At least one computer readable medium comprising a set of instructions,

[0403] The instructions, when executed by a computing device, cause the computing device to:

[0404] Waiting for an event or timeout prompted by one or more input devices to the computing system;

[0405] upon receiving the event or the timeout, adding a corresponding weight associated with the event or the timeout to the score;

[0406] determining whether the score exceeds a predefined limit for the event;

[0407] If the score exceeds the predefined limit, updating the frame;

[0408] asynchronously displaying the updated frame;

[0409] clearing the score; and

[0410] Returns to wait for said event or timeout;

[0411] If the score does not exceed the predefined limit, return to wait for the event or timeout.

[0412] 25. At least one computer-readable medium as described in technical solution 28, wherein a timeout occurs periodically when an event requires a score update.

[0413] Additional Notes and Examples

[0414] Example 1 may include a system for asynchronous display of frames, the system comprising a computing device that determines changes between a current frame and a previous frame and an asynchronous display coupled to the computing device to display an image, wherein the computing device asynchronously sends frame updates to the asynchronous display to update only areas of the currently displayed image that have changed.

[0415] Example 2 may include the system of Example 1, wherein each region of a new frame that is different from a corresponding region in the displayed image is sent as a frame update to the asynchronous display along with a corresponding pixel address to identify the location of the region that has changed.

[0416] Example 3 may include the system of Example 1, wherein each region of the new frame that remains identical to the corresponding region in the displayed image is not sent to the asynchronous display.

[0417] Example 4 may include the system of Example 1, wherein the area of ​​the displayed image that maintains its status in the new frame is not updated or refreshed.

[0418] Example 5 may include the system of Example 1, wherein the computing device determines the frame update by comparing a new frame to be rendered with an image currently displayed on the asynchronous display, and if a region has changed, the computing device sends the changed region as a frame update along with a corresponding pixel address of the region to identify the location of the region in the currently displayed image that has changed.

[0419] Example 6 may include the system of Example 5, wherein the asynchronous display updates the currently displayed image with the frame update received from the computing device in the location identified by the corresponding pixel address.

[0420] Example 7 may include the system of Example 1, wherein the computing device sends the updated frames to the display asynchronously rather than at a fixed frame rate.

[0421] Example 8 may include the system of Example 1, wherein the computing device includes at least one graphics processing unit (GPU), at least one central processing unit (CPU), and a random access memory.

[0422] Example 9 may include a method for asynchronously displaying pixels, the method comprising: determining, by a computing device, changes to a new frame to be rendered on an asynchronous display, wherein the changes include pixels of an image currently displayed on the asynchronous display that have been changed in the new frame, wherein the changes represent updated pixels; wherein the changes represent updated pixels, and sending, by the computing device, the updated pixels together with corresponding pixel addresses representing locations of the updated pixels to enable the asynchronous display to update the currently displayed image with the updated pixels based on the pixel addresses.

[0423] Example 10 may include the system of Example 9, wherein the updated pixels and corresponding pixel addresses are sent to the asynchronous display as they occur rather than at a fixed frame rate.

[0424] Example 11 may include the system of Example 9, wherein the updated pixels and corresponding pixel addresses are sent asynchronously to the asynchronous display.

[0425] Example 12 may include at least one computer-readable medium, comprising a set of instructions that, when executed by a computing device, cause the computing device to: determine changes to a new frame to be rendered on an asynchronous display, wherein the changes include pixels of an image currently displayed on the asynchronous display that have been changed in the new frame, wherein the changes represent updated pixels; and send the updated pixels together with corresponding pixel addresses representing locations of the updated pixels to enable the asynchronous display to update the currently displayed image with the updated pixels based on the pixel addresses.

[0426] Example 13 may include the at least one computer-readable medium of Example 12, wherein the updated pixels and corresponding pixel addresses are sent to the asynchronous display as they occur rather than at a fixed frame rate.

[0427] Example 14 may include the at least one computer-readable medium of Example 12, wherein the updated pixels and corresponding pixel addresses are sent asynchronously to the asynchronous display.

[0428] Example 15 may include a system for block-based camera updating, the system comprising: a camera to capture an image n and determine a pixel-based block of the image n that is different from an image n-1 previously captured by the camera; a system on a chip (SOC) coupled to a memory device and the camera, the SOC to: receive the updated pixel-based block; retrieve the image n-1 from the memory device; fuse the updated pixel-based block with the image n-1 to obtain a fused image; and modify a format of the fused image to a display format.

[0429] Example 16 may include the system of Example 15, further comprising a display coupled to the SOC, the display receiving the fused image and displaying the fused image.

[0430] Example 17 may include the system of Example 15, wherein the camera for determining pixel-based blocks for the image n is further used to: divide the image n into small regions; determine a CRC for each small region; compare the CRC for each region of image n with the corresponding CRC for each region of image n-1; if the CRC for a region is different, select the region as an update region and mark the x, y coordinates for the region.

[0431] Example 18 may include a system for block-based camera updating, the system comprising: a camera to capture an image n and determine a pixel-based block and corresponding pixel address of the image n that is different from an image n-1 previously captured by the camera; a system on a chip (SOC) coupled to a memory device and the camera, the SOC to: receive the updated pixel-based block and the corresponding pixel address; and modify a format of the updated pixel-based block to a display format.

[0432] Example 19 may include the system of Example 18, further comprising a memory panel display coupled to the SOC, the memory panel display being used to: receive the updated pixel-based block in a display format and the corresponding pixel address from the SOC; retrieve the image n-1 from the memory panel display; fuse the updated pixel-based block in a display format with the image n-1 using the corresponding pixel address to obtain a fused image; and display the fused image.

[0433] Example 20 may include the system of Example 18, wherein the camera for determining pixel-based blocks for the image n is further used to: divide the image n into small regions; determine a CRC for each small region; compare the CRC for each region of image n with the corresponding CRC for each region of image n-1; if the CRC for a region is different, select the region as an update region and mark the x, y coordinates for the region.

[0434] Example 21 may include a method for block-based camera update, the method comprising: capturing an image n using a camera; determining what region of image n has changed from a previous image n-1; merging the changed region with the previous image n-1 to obtain a new image n; and displaying the new image n.

[0435] Example 22 may include the system of Example 21, wherein determining what area of ​​image n has changed from the previous image n-1 includes: dividing the image n into small areas; determining a CRC for each small area; comparing the CRC for each area of ​​image n with the corresponding CRC for each area of ​​image n-1; if the CRC for a certain area is different, selecting the area as an update area and marking the x, y coordinates of the area.

[0436] Example 23 may include the system of Example 22, wherein the x, y coordinates define a positional layout of the update region in image n-1.

[0437] Example 24 may include one or more computer-readable media, comprising a set of instructions that, when executed by one or more processors, cause the processors to: capture image n; determine what region of image n has changed from the previous image n-1; merge the changed region with the previous image n-1 to obtain a new image n; and display the new image n.

[0438] Example 25 may include one or more computer-readable media of Example 23, wherein instructions for determining what areas of image n have changed from previous image n-1 cause the processor to: divide the image n into small areas; determine a CRC for each small area; compare the CRC for each area of ​​image n with the corresponding CRC for each area of ​​image n-1; and if the CRC for a region is different, select the region as an update region and mark the x, y coordinates of the region.

[0439] Example 26 may include the one or more computer-readable media of Example 24, wherein the x, y coordinates define a positional layout of the update region in image n-1.

[0440] Example 27 may include an asynchronous system for event-driven updates, the system comprising: a computing system; a plurality of input devices communicatively coupled to the computing system; and at least one output device; wherein upon occurrence of an event, based at least in part on one of the input devices, the one input device causes the at least one output device to be asynchronously updated, wherein the update includes only changes that have occurred since the previous update.

[0441] Example 28 may include the asynchronous system of Example 26, wherein at least one of the plurality of input devices comprises an eye tracker to track eye and head movement of a user of the computing system, wherein events occurring based on the eye tracker cause the output device to update at a time determined by the computing system.

[0442] Example 29 may include the asynchronous system of Example 26, wherein at least one of the plurality of input devices includes a differential video camera for tracking the amount of light falling on each pixel in the image, and when the light floats up or down, the differential video camera sends an event indicating the change in brightness to the computing system to cause the output device to update at a time determined by the computing system.

[0443] Example 30 may include the asynchronous system of Example 26, wherein at least one of the plurality of input devices comprises a 6DOF tracker for tracking a user's head position with six degrees of freedom, the 6DOF tracker sending an event indicating a change in the head position with six degrees of freedom to the computing system to cause the output device to update at a time determined by the computing system.

[0444] Example 31 may include the asynchronous system of Example 26, wherein at least one of the plurality of input devices includes a gesture tracker for tracking hand activity of a user to detect whether a symbol or motion related to an action being performed on the computing system is made, the gesture tracker sending an event indicative of the gesture to the computing system to cause the output device to be updated at a time determined by the computing system.

[0445] Example 32 may include the asynchronous system of claim 26, wherein at least one of the plurality of input devices comprises a game controller for tracking user inputs selected via knobs and buttons, the game controller sending events indicative of the user's inputs to the computing system to cause the output device to update at a time determined by the computing system.

[0446] Example 33 may include the asynchronous system of any of Examples 26-32, wherein the output device comprises a display.

[0447] Example 34 may include the asynchronous system of any of Examples 26-32, wherein the output device to be updated at a time determined by the computing system includes at least one display, wherein the computing system uses a score table including a relative weight for each input device to determine when to render a new frame or block change to the display.

[0448] Example 35 may include the asynchronous system of Example 34, wherein each input device is prioritized based on their relative weight assigned from the score table.

[0449] Example 36 may include the asynchronous system of Example 26, wherein the computing system includes a gaming system, and the plurality of inputs includes event-driven cameras and sensors to asynchronously drive the gaming system.

[0450] Example 37 may include the asynchronous system of Example 26, wherein the at least one output device comprises a display, wherein the computing system asynchronously sends changes to the display when an event occurs.

[0451] Example 38 may include the asynchronous system of Example 37, wherein the change represents a change of a pixel from a region of an image being displayed and a pixel address associated with the change of the pixel.

[0452] Example 39 may include a method for event-driven frame updates on a display, the method comprising: waiting for an event or timeout caused by one or more input devices to a computing system; upon receiving the event or the timeout, adding a corresponding weight associated with the event or timeout to a score; determining whether the score exceeds a predefined limit for the event; if the score exceeds the predefined limit, updating a frame; asynchronously displaying the updated frame; clearing the score; and returning to wait for the event or timeout; if the score does not exceed the predefined limit, returning to wait for the event or timeout.

[0453] Example 40 may include the system of Example 39, wherein the one or more input devices include one or more of an event-driven camera and a sensor to drive an asynchronous gaming system.

[0454] Example 41 may include the system of Example 39, wherein the one or more input devices include one or more of an eye tracker, a differential video camera, a 6DOF tracker, a gesture tracker, a game controller, and motion from one or more remote players over a network.

[0455] Example 42 may include the system of Example 39, wherein the timeout occurs periodically when an event requires a score update.

[0456] Example 43 may include the system of Example 39, wherein the predefined limit comprises a maximum limit based on the event.

[0457] Example 44 may include at least one computer-readable medium, comprising a set of instructions that, when executed by a computing device, cause the computing device to: wait for an event or timeout caused by one or more input devices to a computing system; upon receiving the event or the timeout, add a corresponding weight associated with the event or timeout to a score; determine whether the score exceeds a predefined limit for the event; if the score exceeds the predefined limit, update a frame; asynchronously display the updated frame; clear the score; and return to wait for the event or timeout; if the score does not exceed the predefined limit, return to wait for the event or timeout.

[0458] Example 45 may include the at least one computer-readable medium of Example 44, wherein the one or more input devices include one or more of an event-driven camera and a sensor to drive an asynchronous gaming system.

[0459] Example 46 may include at least one computer-readable medium of Example 44, wherein the one or more input devices include one or more of an eye tracker, a differential video camera, a 6DOF tracker, a gesture tracker, a game controller, and motion from one or more remote players over a network.

[0460] Example 47 may include the at least one computer-readable medium of Example 44, wherein the timeout occurs periodically when the event requires a score update.

[0461] Example 48 may include the at least one computer-readable medium of Example 44, wherein the predefined limit comprises a maximum limit based on the event.

[0462] Example 49 may include a system for asynchronous display of frames, the system comprising: means for determining changes between a current frame and a previous frame; and means for asynchronously sending the changes to the asynchronous display to update only areas of a currently displayed image that have changed.

[0463] Example 50 may include the system of Example 49, wherein each region of a new frame that is different from a corresponding region in the displayed image is sent as a frame update to the asynchronous display along with a corresponding pixel address to identify the location of the region that has changed.

[0464] Example 51 may include the system of Example 49, wherein each region of the new frame that remains identical to the corresponding region in the displayed image is not sent to the asynchronous display.

[0465] Example 52 may include the system of Example 49, wherein the area of ​​the displayed image that maintains its status in the new frame is not updated or refreshed.

[0466] Example 53 may include a system for block-based camera updating, the system comprising: means for capturing an image n; means for determining an updated pixel-based block for the image n that is different from a previously captured image n-1; means for fusing the updated pixel-based block with the image n-1 to obtain a fused image; and means for modifying a format of the fused image to a display format.

[0467] Example 54 may include the system of Example 53, further comprising means for displaying the fused image.

[0468] Example 55 may include the system of Example 53, wherein the means for determining the updated pixel-based blocks further includes: means for dividing the image n into small regions; means for determining a CRC for each small region; means for comparing the CRC for each region of image n with the corresponding CRC for each region of image n-1; means for selecting a region as an update region if the CRC for the region is different, and means for marking the x, y coordinates for the region.

[0469] Example 56 may include at least one computer readable medium comprising a set of instructions that, when executed by a computing system, cause the computing system to perform a method according to any of Examples 9-11.

[0470] Example 57 may include at least one computer-readable medium comprising a set of instructions that, when executed by a computing system, cause the computing system to perform a method according to any of Examples 21-23.

[0471] Example 58 may include at least one computer readable medium comprising a set of instructions that, when executed by a computing system, cause the computing system to perform a method according to any of Examples 39-43.

[0472] The term "coupled" may be used herein to refer to any type of relationship (direct or indirect) between the components in question, and may apply to electrical, mechanical, fluid, optical, electromagnetic, electromechanical or other connections. Furthermore, the terms "first," "second," etc. may be used herein merely to facilitate discussion, and do not convey a particular temporal or chronological importance unless otherwise indicated. Additionally, it is understood that the indefinite article "a" or "an" conveys the meaning of "one or more" or "at least one."

[0473] As used in this application and in the claims, a list of items linked by the term "one or more of" may mean any combination of the listed items. For example, the phrase "one or more of A, B, or C" may mean A; B; C; A and B; A and C; B and C; or A, B, and C.

[0474] The embodiments have been described above with reference to specific embodiments. However, it will be appreciated by those skilled in the art that various modifications and changes may be made thereto without departing from the broader spirit and scope of the embodiments as set forth in the appended claims. The foregoing description and drawings are therefore to be considered in an illustrative rather than a restrictive sense.

Claims

1. A system for asynchronous display of frames, comprising: computing means for determining changes between a current frame and a previous frame; as well as an asynchronous display coupled to the computing device to display an image; a plurality of input devices coupled to the computing device to cause asynchronous updating of the asynchronous display; wherein the computing device sends frame updates to the asynchronous display asynchronously rather than at a fixed frame rate to update only areas of a currently displayed image that have changed, Wherein the computing device uses a score table including relative weights for each input device to determine when to render the frame update to the asynchronous display.

2. The system of claim 1, wherein each region of a new frame that is different from a corresponding region in the displayed image is sent to the asynchronous display as a frame update along with a corresponding pixel address to identify the location of the region that has changed.

3. The system of claim 1, wherein each region of the new frame that remains identical to a corresponding region in the displayed image is not sent to the asynchronous display.

4. The system of claim 1, wherein areas of the displayed image that retain their status in a new frame are not updated or refreshed.

5. The system of claim 1 , wherein the computing device determines the frame update by comparing a new frame to be rendered with the currently displayed image on the asynchronous display, and if a region has changed, the computing device sends the changed region as a frame update along with a corresponding pixel address of the region to identify a location of the region in the currently displayed image that has changed.

6. The system of claim 5, wherein the asynchronous display is to update the currently displayed image with the frame updates received from the computing device in the location identified by the corresponding pixel address.

7. A method for asynchronously displaying pixels, comprising: determining, by a computing device, changes to a new frame to be rendered on an asynchronous display caused by a plurality of input devices, wherein the changes include pixels of an image currently displayed on the asynchronous display that have been changed in the new frame, wherein the changes represent updated pixels; as well as sending, by the computing device asynchronously and not at a fixed frame rate, the updated pixels together with corresponding pixel addresses representing the locations of the updated pixels to enable the asynchronous display to update the currently displayed image with the updated pixels based on the pixel addresses, Wherein a score table including relative weights for each input device is used by the computing device to determine when to render the updated pixels to the asynchronous display.

8. The method of claim 7, wherein the updated pixels and corresponding pixel addresses are sent to the asynchronous display as they occur rather than at a fixed frame rate.

9. A computer-readable medium having instructions stored thereon, which, when executed by a computing device, cause the computing device to perform the method according to any one of claims 7 to 8.

10. An asynchronous system for event-driven updates, comprising: Computing systems; a plurality of input devices communicatively coupled to the computing system; as well as at least one output device; wherein upon occurrence of an event, based at least in part on an input device, the one input device causes the at least one output device to be asynchronously updated, wherein the update contains only changes that have occurred since a previous update, wherein the at least one output device comprises a display, wherein when an event occurs, the computing system sends changes to the display asynchronously rather than at a fixed frame rate, Wherein a score table including relative weights for each input device is used by the computing system to determine when to render a new frame or block change to the display.

11. The asynchronous system of claim 10, wherein each input device is prioritized based on their relative weights assigned from the score table.

12. The asynchronous system of claim 10, wherein the computing system comprises a gaming system and the plurality of inputs comprises event-driven cameras and sensors to asynchronously drive the gaming system.

13. A system for asynchronous display of frames, comprising: means for determining changes between a current frame and a previous frame caused by a plurality of input devices; Means for sending said changes to said asynchronous display asynchronously rather than at a fixed frame rate to update only areas of a currently displayed image that have changed, wherein a score table including relative weights for each input device is used to determine when said changes are rendered to said asynchronous display.

14. The system of claim 13, wherein each region of a new frame that is different from a corresponding region in the displayed image is sent to the asynchronous display as a frame update along with a corresponding pixel address to identify the location of the region that has changed.

Citation Information

Patent Citations

  • System for asynchronous update of screen, method for asynchronous update of screen, and program for asynchronous update of screen

    JP2005063340A

  • Image processing apparatus, imaging apparatus, image processing method, imaging method, and image processing program

    JP2014082745A

  • Information processing device and program

    JP2016045762A

  • Asynchronous data transmission

    US20080114896A1

  • Synchronization of User Interactive Events with On-Screen Events During Playback of Multimedia Stream

    US20110081965A1