Abstract: Methods and systems for data compression and decompression in a graphics processing system are provided. For example, in at least one embodiment, a method comprises distributing the graphics data values of a pixel block about zero to minimize redundancy, and the pixel block includes a plurality of quadrants. The method further comprises determining whether to encode the distributed graphics data values, and responsive to a determination to encode the distributed graphics data values, encoding at least one graphics data value of one of the quadrants depending on an encoding indicator. The encoding includes determining an entropy parameter and dividing each positive data value by the entropy parameter yielding an entropy part and a noise part.

Abstract: Methods and systems for data compression and decompression in a graphics processing system are provided. For example, in at least one embodiment, a method comprises distributing the graphics data values of a pixel block about zero to minimize redundancy, and the pixel block includes a plurality of quadrants. The method further comprises determining whether to encode the distributed graphics data values, and responsive to a determination to encode the distributed graphics data values, encoding at least one graphics data value of one of the quadrants depending on an encoding indicator. The encoding includes determining an entropy parameter and dividing each positive data value by the entropy parameter yielding an entropy part and a noise part.

Abstract: Provided are methods for managing texture data. The methods include preloading a first plurality of texture descriptor values from a memory location in a first buffer located in a first logic block, wherein the first buffer is further configured to receive data corresponding to non-texture functions performed in the first logic block and preloading the first plurality of texture descriptor values from a memory location into a second buffer in a second logic block if the first buffer is full. The methods further include utilizing the first plurality of texture descriptor values, within the second logic block, to perform a shader calculation, and loading, dynamically, a second plurality of texture descriptor values from memory into the first buffer, wherein the first logic block requires additional data. Additionally, the methods can include writing, if the first buffer is full, the second plurality of texture descriptor values over a portion of the first plurality of texture descriptor values.

Abstract: Provided are methods for managing texture data in Graphics Processing Units (GPUs). The methods include receiving, into an arbiter, a preload request configured to request processing of texture data in advance of shader processing and receiving, into the arbiter, a dependent read request configured to request processing of texture data after shader processing. The methods also include receiving, into the arbiter, a capacity signal from a texture buffer and determining, utilizing the virtual buffer capacity signal, a selected request corresponding which of the preload request and the dependent read request is granted. The methods further include processing, in a texture processor, texture data corresponding to the selected request.

Abstract: Provided is a system for managing multiple contexts in a decentralized graphics processing unit. The system includes multiple control units that can include a context buffer, a context processor, and a context scheduler. Also included is logic to receive multiple contexts, logic to identify at least one of the contexts, and logic to facilitate communication among the control units.

Abstract: A method for high level synchronization between an application and a graphics pipeline comprises receiving an application instruction in an input stream at a predetermined component, such as a command stream processor (CSP), as sent by a central processing unit. The CSP may have a first portion coupled to a next component in the graphics pipeline and a second portion coupled to a plurality of components of the graphics pipeline. A command associated with the application instruction may be forwarded from the first portion to the next component in the graphics pipeline or some other component coupled thereto. The command may be received and thereafter executed. A response may be communicated on a feedback path to the second portion of the CSP. Nonlimiting exemplary application instructions that may be received and executed by the CSP include check surface fault, trap, wait, signal, stall, flip, and trigger.

Abstract: Systems and method for providing shared attribute evaluation circuits in a graphics processing unit are provided. One embodiment can be described as a system for evaluating attributes in a graphics processing unit having a plurality of processing stages. The system can include an evaluation block, configured to process a plurality of attributes corresponding to a plurality of pixels and a plurality of FIFO buffers, each configured between one of the plurality of processing stages and the evaluation block. An embodiment can further include a shared buffer, configured to store the plurality of attributes or pointers during the attribute processing and processing priority logic, configured to determine a plurality of priorities corresponding to the plurality of attributes.

Abstract: Provided are methods for managing texture data. The methods include preloading a first plurality of texture descriptor values from a memory location in a first buffer located in a first logic block, wherein the first buffer is further configured to receive data corresponding to non-texture functions performed in the first logic block and preloading the first plurality of texture descriptor values from a memory location into a second buffer in a second logic block if the first buffer is full. The methods further include utilizing the first plurality of texture descriptor values, within the second logic block, to perform a shader calculation, and loading, dynamically, a second plurality of texture descriptor values from memory into the first buffer, wherein the first logic block requires additional data. Additionally, the methods can include writing, if the first buffer is full, the second plurality of texture descriptor values over a portion of the first plurality of texture descriptor values.

Abstract: Provided are methods for managing texture data in Graphics Processing Units (GPUs). The methods include receiving, into an arbiter, a preload request configured to request processing of texture data in advance of shader processing and receiving, into the arbiter, a dependent read request configured to request processing of texture data after shader processing. The methods also include receiving, into the arbiter, a capacity signal from a texture buffer and determining, utilizing the virtual buffer capacity signal, a selected request corresponding which of the preload request and the dependent read request is granted. The methods further include processing, in a texture processor, texture data corresponding to the selected request.

Abstract: Provided is a system for managing multiple contexts in a decentralized graphics processing unit. The system includes multiple control units that can include a context buffer, a context processor, and a context scheduler. Also included is logic to receive multiple contexts, logic to identify at least one of the contexts, and logic to facilitate communication among the control units.

Abstract: Systems and method for providing shared attribute evaluation circuits in a graphics processing unit are provided. One embodiment can be described as a system for evaluating attributes in a graphics processing unit having a plurality of processing stages. The system can include an evaluation block, configured to process a plurality of attributes corresponding to a plurality of pixels and a plurality of FIFO buffers, each configured between one of the plurality of processing stages and the evaluation block. An embodiment can further include a shared buffer, configured to store the plurality of attributes or pointers during the attribute processing and processing priority logic, configured to determine a plurality of priorities corresponding to the plurality of attributes.

Abstract: A method of performing anisotropic texture mip-mapping. The method includes determining a region of support for a set of target pixels of the image to be textured, and mapping the region of support to an area in texture map that is generally elliptical. For each axis of the ellipse the number of samples is determined and a filter function is performed on those samples to find the final color value. For four texels, the filter function is a weighted sum of the color values of each texel, where the weights are determined based on the fraction of the Level of Detail (LOD) and the fraction of the U or V coordinate.

Abstract: A method of cubic mapping with texturing is described. Neighboring pixels on an object are mapped to adjacent faces of the cube, but these adjacent faces do not guarantee continuity in the texture mip-map associated with each face. Therefore, the u and v texture map coordinates are adjusted after mapping to adjacent faces to make a continuity adjustment that insures that the LOD for the texture mip-map is the same for each adjacent face. The continuity adjustment includes either switching the u coordinate with the v coordinate or negating one of the coordinates or both. Additionally, if the u and v coordinates are normalized, the normalization may be compensated by adding or subtracting unity from the adjusted coordinate. After the continuity adjustment is made an approximation to the derivative is computed and used to determine the LOD for the mip-map. Texturing can then proceed using the LOD.

Abstract: Z buffer traffic experienced during graphics processing is reduced by using a compression mechanism to reduce the amount of information stored in the z buffer. The compression mechanism may be a delta-based z compression mechanism, which stores deltas in the z buffer rather than actual z values. These deltas may be used at a later time to compute the z values. By storing deltas instead of actual z values, the compression mechanism makes it possible to store significantly less information in the z buffer. By reducing the amount of information stored in the z buffer, less information will be read from and written to the z buffer, which in turn, reduces z buffer traffic. To further reduce z buffer traffic, selected deltas may be stored not in the z buffer but rather in a storage local to a graphics processing mechanism (GPM). Storing selected deltas in local storage obviates the need to read from or write to the z buffer for those deltas. As a result, z buffer traffic is even further reduced.

Abstract: Systems and methods are provided for compressing computer graphics color data in a system utilizing a multi-sample anti-aliasing scheme using multiple planes for storing color data samples. Each of the planes is configured as a block of contiguous memory.

Abstract: Systems and methods are provided for compressing computer graphics color data in a system utilizing a multi-sample anti-aliasing scheme using multiple planes for storing color data samples. Each of the planes is configured as a block of contiguous memory.

Abstract: Z buffer traffic experienced during graphics processing is reduced by using a compression mechanism to reduce the amount of information stored in the z buffer. The compression mechanism may be a delta-based z compression mechanism, which stores deltas in the z buffer rather than actual z values. These deltas may be used at a later time to compute the z values. By storing deltas instead of actual z values, the compression mechanism makes it possible to store significantly less information in the z buffer. By reducing the amount of information stored in the z buffer, less information will be read from and written to the z buffer, which in turn, reduces z buffer traffic. To further reduce z buffer traffic, selected deltas may be stored not in the z buffer but rather in a storage local to a graphics processing mechanism (GPM). Storing selected deltas in local storage obviates the need to read from or write to the z buffer for those deltas. As a result, z buffer traffic is even further reduced.

Abstract: A method of performing anisotropic texture mip-mapping. The method includes determining a region of support for a set of target pixels of the image to be textured, and mapping the region of support to an area in texture map that is generally elliptical. For each axis of the ellipse the number of samples is determined and a filter function is performed on those samples to find the final color value. For four texels, the filter function is a weighted sum of the color values of each texel, where the weights are determined based on the fraction of the Level of Detail (LOD) and the fraction of the U or V coordinate.

Abstract: A token-based buffer system for a geometry pipeline in three-dimensional graphics comprises: a buffer control initialization (BCI) unit, a new token or index module, a geometry control pipeline, a vertex buffer, and a processing engine. The token-based buffer system provides a shared resource environment in which tokens are assigned for blocks of data. Each block of data includes that data necessary for each unit or stage in the geometry pipeline to perform its computation. The use of tokens is advantageous because it optimizes the storage efficiency for storing the blocks of data and ensures the correctness of the data as it is passed between stages.

Abstract: A trilinear texture filtering system and method that improves the locality of texture map accesses in a multum in parvo (MIP) map so as to reduce page breaks and provide improved performance. The present invention includes a texture cache having a unique addressing and accessing scheme that allows localized reads of the texture map from each of four banks in the texture cache. This is coupled with a unique texture-mapping unit that includes a first level generator, a second level generator and an interpolator. In generating the lower-resolution texture map version, the present invention filters neighboring texels from the higher-resolution version. Thus, an n×n (e.g. 2×2) square of texels at the higher-resolution level is reduced to a single texel at the lower-resolution level. This technique permits the lower-resolution level to be derived without requiring additional read operations from texture memory with potentially poor locality.