会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 13. 发明授权
    • Distributed stream output in a parallel processing unit
    • 分布式流输出并行处理单元
    • US08817031B2
    • 2014-08-26
    • US12894001
    • 2010-09-29
    • Ziyad S. HakuraRohit GuptaMichael C. ShebanowEmmett M. Kilgariff
    • Ziyad S. HakuraRohit GuptaMichael C. ShebanowEmmett M. Kilgariff
    • G06F15/80
    • G06T1/00
    • A technique for performing stream output operations in a parallel processing system is disclosed. A stream synchronization unit is provided that enables the parallel processing unit to track batches of vertices being processed in a graphics processing pipeline. A plurality of stream output units is also provided, where each stream output unit writes vertex attribute data to one or more stream output buffers for a portion of the batches of vertices. A messaging protocol is implemented between the stream synchronization unit and the plurality of stream output units that ensures that each of the stream output units writes vertex attribute data for the particular batch of vertices distributed to that particular stream output unit in the same order in the stream output buffers as the order in which the batch of vertices was received from a device driver by the parallel processing unit.
    • 公开了一种用于在并行处理系统中执行流输出操作的技术。 提供流同步单元,其使并行处理单元能够跟踪在图形处理流水线中正在处理的顶点的批次。 还提供了多个流输出单元,其中每个流输出单元将顶点属性数据写入一批或多个顶点的一部分的流输出缓冲器。 在流同步单元和多个流输出单元之间实现消息传递协议,确保每个流输出单元以流中相同的顺序写入分配给该特定流输出单元的特定批次的顶点的顶点属性数据 输出缓冲器作为由并行处理单元从设备驱动器接收到顶点批次的顺序。
    • 15. 发明授权
    • Calculation of plane equations after determination of Z-buffer visibility
    • 确定Z缓冲区可见性后的平面方程的计算
    • US08692829B2
    • 2014-04-08
    • US12876827
    • 2010-09-07
    • Ziyad S. HakuraEmmett M. Kilgariff
    • Ziyad S. HakuraEmmett M. Kilgariff
    • G06T15/40G06T15/50G06T15/60
    • G06T15/50
    • One embodiment of the present invention sets forth a technique for computing plane equations for primitive shading after non-visible pixels are removed by z culling operations and pixel coverage has been determined. The z plane equations are computed before the plane equations for non-z primitive attributes are computed. The z plane equations are then used to perform screen-space z culling of primitives during and following rasterization. Culling of primitives is also performed based on pixel sample coverage. Consequently, primitives that have visible pixels after z culling operations reach the primitive shading unit. The non-z plane equations are only computed for geometry that is visible after the z culling operations. The primitive shading unit does not need to fetch vertex attributes from memory and does not need to compute non-z plane equations for the culled primitives.
    • 本发明的一个实施例提出了一种用于在通过z剔除操作去除不可见像素之后计算原始着色的平面方程的技术,并且已经确定了像素覆盖。 在计算非z原始属性的平面方程之前计算z平面方程。 然后,Z平面方程用于在光栅化期间和之后执行基元的屏幕空间z剔除。 基于像素样本覆盖也执行基元的剔除。 因此,在z剔除操作之后具有可见像素的原语到达原始着色单元。 只有在z剔除操作之后可见的几何形状才计算非z平面方程。 原始着色单元不需要从存储器获取顶点属性,并且不需要计算被剔除的图元的非z平面方程。
    • 17. 发明授权
    • Block linear memory ordering of texture data techniques
    • 阻止纹理数据技术的线性存储器排序
    • US08456481B2
    • 2013-06-04
    • US13422498
    • 2012-03-16
    • Walter E. DonovanEmmett M. KilgariffKarim M. AbdallaJoel J. McCormack
    • Walter E. DonovanEmmett M. KilgariffKarim M. AbdallaJoel J. McCormack
    • G06F12/00
    • G06T15/04G06T1/60
    • A method of organizing memory for storage of texture data, in accordance with one embodiment of the invention, includes accessing a size of a mipmap level of a texture map. A block dimension may be determined based on the size of the mipmap level. A memory space (e.g., computer-readable medium) may be logically divided into a plurality of whole number of blocks of variable dimension. The dimension of the blocks is measured in units of gobs and each gob is of a fixed dimension of bytes. A mipmap level of a texture map may be stored in the memory space. A texel coordinate of said mipmap level may be converted into a byte address of the memory space by determining a gob address of a gob in which the texel coordinate resides and determining a byte address within the particular gob.
    • 根据本发明的一个实施例的组织用于存储纹理数据的存储器的方法包括访问纹理映射的mipmap级别的大小。 可以基于mipmap级别的大小来确定块维度。 存储器空间(例如,计算机可读介质)可以在逻辑上被划分为多个整数个可变维度的块。 块的尺寸以料滴为单位进行测量,每个料滴的固定尺寸为字节。 纹理映射的mipmap级别可以存储在存储器空间中。 所述mipmap级别的纹理坐标可以通过确定纹理坐标所驻留的料滴的料滴地址并确定特定料滴中的字节地址来转换为存储器空间的字节地址。
    • 20. 发明申请
    • BLOCK LINEAR MEMORY ORDERING OF TEXTURE DATA
    • 块状数据的线性记忆命令
    • US20110169850A1
    • 2011-07-14
    • US13073020
    • 2011-03-28
    • Walter E. DonovanEmmett M. KilgariffKarim M. AbdallaJoel J. McCormack
    • Walter E. DonovanEmmett M. KilgariffKarim M. AbdallaJoel J. McCormack
    • G06T11/40
    • G06T15/04G06T1/60
    • A method of organizing memory for storage of texture data, in accordance with one embodiment of the invention, includes accessing a size of a mipmap level of a texture map. A block dimension may be determined based on the size the mipmap level. A memory space (e.g., computer-readable medium) may be logically divided into a plurality of whole number of blocks of variable dimension. The dimension of the blocks is measured in units of gobs and each gob is of a fixed dimension of bytes. A mipmap level of a texture map may be stored in the memory space. A texel coordinate of said mipmap level may be converted into a byte address of the memory space by determining a gob address of a gob in which the texel coordinate resides and determining a byte address within the particular gob.
    • 根据本发明的一个实施例的组织用于存储纹理数据的存储器的方法包括访问纹理映射的mipmap级别的大小。 可以基于mipmap级别的大小来确定块维度。 存储器空间(例如,计算机可读介质)可以在逻辑上被划分为多个整数个可变维度的块。 块的尺寸以料滴为单位进行测量,每个料滴的固定尺寸为字节。 纹理映射的mipmap级别可以存储在存储器空间中。 所述mipmap级别的纹理坐标可以通过确定纹理坐标所驻留的料滴的料滴地址并确定特定料滴中的字节地址来转换为存储器空间的字节地址。