LOAD-BALANCED TESSELLATION DISTRIBUTION FOR PARALLEL ARCHITECTURES

    公开(公告)号:WO2018052512A3

    公开(公告)日:2018-03-22

    申请号:PCT/US2017/041441

    申请日:2017-07-11

    Abstract: Briefly, in accordance with one or more embodiments, an architecture to load balance tessellation distribution apparatus comprises a memory to store one or more patches representing an object in an image, and a processor, coupled to the memory, to perform one or more tessellation operations on the one or more patches. The one or more tessellation operations including splitting one or more of the patches into one or more subpatches, and load balancing the one or more patches and the one or more subpatches among two or more geometry and setup fixed-function pipelines (GSPs).

    TRIPLE BUFFERED CONSTANT BUFFERS FOR EFFICIENT PROCESSING OF GRAPHICS DATA AT COMPUTING DEVICES
    2.
    发明申请
    TRIPLE BUFFERED CONSTANT BUFFERS FOR EFFICIENT PROCESSING OF GRAPHICS DATA AT COMPUTING DEVICES 审中-公开
    三倍缓冲恒定缓冲器,用于在计算设备上高效处理图形数据

    公开(公告)号:WO2017095478A1

    公开(公告)日:2017-06-08

    申请号:PCT/US2016/043190

    申请日:2016-07-20

    CPC classification number: G06T1/60 G06T1/20 G06T2207/20021

    Abstract: A mechanism is described for facilitating efficient processing of graphics data using triple buffered constant buffers at computing devices. A method of embodiments, as described herein, includes detecting generation of a multi-block buffer by an application to perform data processing at a graphics processor of a computing device, and mapping a first memory block of the multi-block buffer to the graphics processor, where mapping further includes mapping a second memory block and a third memory block of the multi-block buffer to an application processor. The method further includes executing a swap operation to facilitate the graphics processor to process a current data set associated with the application processor.

    Abstract translation: 描述了一种机制,其用于在计算设备处使用三重缓冲常量缓冲器来有效地处理图形数据。 如本文所述的实施例的方法包括检测应用程序由应用程序生成多块缓冲器以在计算设备的图形处理器处执行数据处理,并且将多块缓冲器的第一存储器块映射到图形处理器 其中映射还包括将多块缓冲器的第二存储器块和第三存储器块映射到应用处理器。 该方法还包括执行交换操作以促进图形处理器处理与应用处理器相关联的当前数据集。

    ZERO-COVERAGE RASTERIZATION CULLING
    3.
    发明申请

    公开(公告)号:WO2016073125A1

    公开(公告)日:2016-05-12

    申请号:PCT/US2015/054340

    申请日:2015-10-07

    CPC classification number: G06T15/40 G06T11/40

    Abstract: In accordance with some embodiments, a zero coverage test may determine whether a primitive such as a triangle relies on lanes between rows or columns or lines of samples. If so, the primitive can be culled in a zero coverage culling test.

    Abstract translation: 根据一些实施例,零覆盖测试可以确定诸如三角形的原语是否依赖于行或列或样本行之间的通道。 如果是这样,可以在零覆盖率拣选测试中剔除原语。

    METHOD AND APPARATUS FOR EFFICIENT DEPTH PREPASS
    4.
    发明申请
    METHOD AND APPARATUS FOR EFFICIENT DEPTH PREPASS 审中-公开
    用于有效深度预处理的方法和设备

    公开(公告)号:WO2018052592A1

    公开(公告)日:2018-03-22

    申请号:PCT/US2017/046546

    申请日:2017-08-11

    Abstract: An apparatus and method are described for performing an efficient depth prepass. For example, one embodiment of a method comprising: a method comprising: performing a first pass through a specified portion of a graphics pipeline with only depth rendering active; initializing a coarse depth buffer within the specified portion of the graphics pipeline during the first pass, the coarse depth buffer storing depth data at a level of granularity less than that stored in a per-pixel depth buffer, which is not initialized during the first pass; and performing a second pass through the graphics pipeline following the first pass, the second pass utilizing the full graphics pipeline and using values in the coarse depth buffer initialized by the first pass.

    Abstract translation: 描述了用于执行有效深度准备的装置和方法。 例如,一种方法的一个实施例包括:一种方法,包括:在只有深度渲染活动的情况下执行第一遍通过图形管线的指定部分; 在第一遍期间初始化图形流水线的指定部分内的粗略深度缓冲器,粗略深度缓冲器以比在第一遍期间未初始化的每像素深度缓冲器中存储的粒度水平更低的粒度水平来存储深度数据 ; 以及在第一遍之后通过图形流水线执行第二遍,第二遍使用全图形流水线并且使用由第一遍初始化的粗略深度缓存器中的值。

    MINIMUM/MAXIMUM AND BITWISE AND/OR BASED COARSE STENCIL TEST
    5.
    发明申请
    MINIMUM/MAXIMUM AND BITWISE AND/OR BASED COARSE STENCIL TEST 审中-公开
    最小/最大和最大值和/或基于粗体的测试

    公开(公告)号:WO2018048555A1

    公开(公告)日:2018-03-15

    申请号:PCT/US2017/045961

    申请日:2017-08-08

    Abstract: Methods and apparatus relating to techniques for provision of minimum or maximum and bitwise logic AND or logic OR based coarse stencil tests are described. In an embodiment, metadata (corresponding to a plurality of pixels) is stored in memory. One or more operations are performed on the metadata to generate a stencil result. The one or more operations comprise a bitwise intersection operation or a bitwise union operation and/or a minimum operation or maximum operation. Other embodiments are also disclosed and claimed.

    Abstract translation: 描述与用于提供最小或最大以及按位逻辑AND或逻辑OR基粗略模板测试的技术有关的方法和设备。 在一个实施例中,元数据(对应于多个像素)被存储在存储器中。 对元数据执行一个或多个操作以生成模板结果。 该一个或多个操作包括逐位相交操作或逐位联合操作和/或最小操作或最大操作。 其他实施例也被公开和要求保护。

    INTERPOLATED MINIMUM-MAXIMUM COMPRESSION/DECOMPRESSION FOR EFFICIENT PROCESSING OF GRAPHICS DATA AT COMPUTING DEVICES
    6.
    发明申请
    INTERPOLATED MINIMUM-MAXIMUM COMPRESSION/DECOMPRESSION FOR EFFICIENT PROCESSING OF GRAPHICS DATA AT COMPUTING DEVICES 审中-公开
    内插式最小 - 最大压缩/解压缩用于计算设备图形数据的高效处理

    公开(公告)号:WO2017105612A1

    公开(公告)日:2017-06-22

    申请号:PCT/US2016/057030

    申请日:2016-10-14

    CPC classification number: G06T9/00 G06T9/004 G06T15/005 G06T15/04 G06T15/80

    Abstract: A mechanism is described for facilitating interpolated minimum-maximum compression/decompression for efficient processing of graphics data at computing devices. A method of embodiments, as described herein, includes detecting a tile having pixels representing graphics contents capable of being processed by a graphics processor of a computing device; computing a minimum color value and a maximum color value of the tile. The method may further include splitting the tile into a plurality of interpolation tiles, where each interpolation tile includes a set of pixels of one or more colors. The method may further include computing a plurality of local minimum color values for the plurality of interpolation tiles, computing, based on the plurality of local minimum values, a plurality of residuals for the plurality of interpolation tiles to reduce spreads from the plurality of interpolation tiles, and compressing the reduced plurality of interpolation tiles based on the plurality of residuals.

    Abstract translation: 描述了用于有助于在计算设备处有效处理图形数据的插值最小 - 最大压缩/解压缩的机制。 如本文所述的实施例的方法包括:检测具有表示能够由计算设备的图形处理器处理的图形内容的像素的图块; 计算瓦片的最小颜色值和最大颜色值。 该方法可以进一步包括将瓦片分成多个内插瓦片,其中每个内插瓦片包括一组一个或多个颜色的像素。 该方法可以进一步包括计算多个内插瓦片的多个局部最小颜色值,基于多个局部最小值计算多个内插瓦片的多个残差,以减少来自多个内插瓦片的扩展 ,并且基于所述多个残差来压缩所述缩减的多个内插瓦片。

    OCCLUSION QUERY APPARATUS AND METHOD FOR ACCELERATED RENDERING
    9.
    发明申请
    OCCLUSION QUERY APPARATUS AND METHOD FOR ACCELERATED RENDERING 审中-公开
    闭塞查询装置和用于加速呈现的方法

    公开(公告)号:WO2017204948A1

    公开(公告)日:2017-11-30

    申请号:PCT/US2017/028454

    申请日:2017-04-19

    CPC classification number: G06T15/405 G06T1/20 G06T15/005 G06T2210/12

    Abstract: An apparatus and method are described for occlusion queries for accelerated rendering. For example, one embodiment of a method comprises: performing an occlusion query for a plurality of tiles of an image, the occlusion query to determine whether one or more of the tiles are occluded; generating a bit mask in response to the occlusion query, the bit mask comprising data indicating which of the tiles are occluded; and reading the bit mask when rendering the image to remove work associated with those tiles which are occluded.

    Abstract translation: 描述了用于加速渲染的遮挡查询的装置和方法。 例如,方法的一个实施例包括:对图像的多个图块执行遮挡查询,遮挡查询确定一个或多个图块是否被遮挡; 响应于所述遮挡查询生成位掩码,所述位掩码包括指示哪些所述瓦片被遮挡的数据; 并在渲染图像时读取位掩码以消除与被遮挡的图块关联的工作。

    CLUSTERING AND ENCODING FOR COLOR COMPRESSION
    10.
    发明申请
    CLUSTERING AND ENCODING FOR COLOR COMPRESSION 审中-公开
    聚合和编码色彩压缩

    公开(公告)号:WO2015171310A1

    公开(公告)日:2015-11-12

    申请号:PCT/US2015/026996

    申请日:2015-04-22

    Abstract: First, the colors are partitioned within a tile into distinct groups, such that the variation of color within each group is lowered. Second, each group can be encoded in an efficient manner. The algorithm described herein may give a higher compression ratio than previous algorithms, and therefore may further reduce memory bandwidth at a very low increase in computational cost in some embodiments. The algorithm may be added to a system with existing buffer compression algorithms, handling additional tiles that the existing algorithm fails to compress, thereby increasing the overall compression rate.

    Abstract translation: 首先,将颜色在瓦片内划分成不同的组,使得每组中的颜色变化降低。 第二,每组可以有效地编码。 这里描述的算法可以给出比先前的算法更高的压缩比,并且因此在一些实施例中可以以非常低的计算成本增加进一步减少存储器带宽。 可以将该算法添加到具有现有缓冲器压缩算法的系统中,处理现有算法无法压缩的附加瓦片,从而增加总体压缩率。

Patent Agency Ranking