专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08427495B1 Coalescing to avoid read-modify-write during compressed data operations 有权
标题翻译：聚合以避免压缩数据操作期间的读 - 修改 - 写
公开(公告)号：US08427495B1
公开(公告)日：2013-04-23
申请号：US11954722
申请日：2007-12-12
申请人： John H. Edmondson , Robert A. Alfieri , Michael F. Harris , Steven E. Molnar
发明人： John H. Edmondson , Robert A. Alfieri , Michael F. Harris , Steven E. Molnar
IPC分类号： G06F12/02
CPC分类号： G06T1/60 , H04N19/423
摘要： Write operations to a unit of compressible memory, known as a compression tile, are examined to see if data blocks to be written completely cover a single compression tile. If the data blocks completely cover a single compression tile, the write operations are coalesced into a single write operation and the single compression tile is overwritten with the data blocks. Coalescing multiple write operations into a single write operation improves performance, because it avoids the read-modify-write operations that would otherwise be needed.
摘要翻译：对可压缩存储器（称为压缩片）的单位进行写操作，以查看要写入的数据块是否完全覆盖单个压缩片。如果数据块完全覆盖单个压缩块，则写入操作合并为单个写入操作，并且单个压缩块被数据块覆盖。将多个写入操作合并为单个写入操作会提高性能，因为它避免了否则需要的读取 - 修改 - 写入操作。

2. 发明授权

US09058792B1 Coalescing to avoid read-modify-write during compressed data operations 有权
公开(公告)号：US09058792B1
公开(公告)日：2015-06-16
申请号：US11555639
申请日：2006-11-01
申请人： John H. Edmondson , Robert A. Alfieri , Michael F. Harris , Steven E. Molnar
发明人： John H. Edmondson , Robert A. Alfieri , Michael F. Harris , Steven E. Molnar
IPC分类号： G09G5/36 , G09G5/393 , G06T1/20 , G09G5/395 , G09G5/14
CPC分类号： G09G5/393 , G06T1/20 , G09G5/14 , G09G5/363 , G09G5/395 , G09G2340/02 , G09G2340/125 , G09G2360/18
摘要： Sequential write operations to a unit of compressed memory, known as a compression tile, are examined to see if the same compression tile is being written. If the same compression tile is being written, the sequential write operations are coalesced into a single write operation and the entire compression tile is overwritten with the new data. Coalescing multiple write operations into a single write operation improves performance, because it avoids the read-modify-write operations that would otherwise be needed.

3. 发明授权

US08928681B1 Coalescing to avoid read-modify-write during compressed data operations 有权
标题翻译：聚合以避免压缩数据操作期间的读 - 修改 - 写
公开(公告)号：US08928681B1
公开(公告)日：2015-01-06
申请号：US12649204
申请日：2009-12-29
申请人： John H. Edmondson , Robert A. Alfieri , Michael F. Harris , Steven E. Molnar
发明人： John H. Edmondson , Robert A. Alfieri , Michael F. Harris , Steven E. Molnar
IPC分类号： G09G5/36
CPC分类号： G09G5/393 , G06T1/20 , G09G5/14 , G09G5/363 , G09G5/395 , G09G2340/02 , G09G2340/125 , G09G2360/18
摘要： Sequential write operations to a unit of compressed memory, known as a compression tile, are examined to see if the same compression tile is being written. If the same compression tile is being written, the sequential write operations are coalesced into a single write operation and the entire compression tile is overwritten with the new data. Coalescing multiple write operations into a single write operation improves performance, because it avoids the read-modify-write operations that would otherwise be needed.
摘要翻译：检查压缩存储器单元（称为压缩片）的顺序写入操作，以查看是否正在写入相同的压缩片。如果正在写入相同的压缩瓦片，则顺序写入操作被合并为单个写入操作，并且用新的数据覆盖整个压缩瓦片。将多个写入操作合并为单个写入操作会提高性能，因为它避免了否则需要的读取 - 修改 - 写入操作。

4. 发明授权

US07685371B1 Hierarchical flush barrier mechanism with deadlock avoidance 有权
标题翻译：具有死锁避免的分层冲洗障碍机制
公开(公告)号：US07685371B1
公开(公告)日：2010-03-23
申请号：US11406550
申请日：2006-04-19
申请人： Samuel Hammond Duncan , Robert A. Alfieri , John H. Edmondson , David William Nuechterlein , Michael A. Woodmansee
发明人： Samuel Hammond Duncan , Robert A. Alfieri , John H. Edmondson , David William Nuechterlein , Michael A. Woodmansee
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28
CPC分类号： G06F13/1642
摘要： A data processing system can establish or maintain data coherency by issuing a data flush operation. The data processing system can be configured as a host executing one or more independent processes using one or more lower level devices. The lower level devices can be viewed as peer devices. Any of the host or the plurality of peer devices can be configured to initiate the flush operation. A device can determine whether the initiator of a flush operation is the host or a peer device. The device can perform a flush limited to local memory, or a subset of all available memory, if a peer device initiates the flush operation.
摘要翻译：数据处理系统可以通过发出数据刷新操作来建立或维护数据一致性。数据处理系统可以被配置为使用一个或多个下级设备执行一个或多个独立进程的主机。下层设备可以看作是对等设备。可以将主机或多个对等设备中的任一个配置为启动刷新操作。设备可以确定刷新操作的发起者是主机还是对等设备。如果对等设备发起冲洗操作，则设备可以执行限制到本地内存或所有可用内存的子集的刷新。

5. 发明授权

US07868901B1 Method and system for reducing memory bandwidth requirements in an anti-aliasing operation 有权
标题翻译：在抗锯齿操作中减少内存带宽要求的方法和系统
公开(公告)号：US07868901B1
公开(公告)日：2011-01-11
申请号：US11557085
申请日：2006-11-06
申请人： John H. Edmondson , Steven E. Molnar , Bengt-Olaf Schneider , Gary C. King , Michael J. M. Toksvig , Peter B. Holmqvist , James M. O'Connor
发明人： John H. Edmondson , Steven E. Molnar , Bengt-Olaf Schneider , Gary C. King , Michael J. M. Toksvig , Peter B. Holmqvist , James M. O'Connor
IPC分类号： G09G5/00
CPC分类号： G06T11/40 , G09G5/363 , G09G2320/02 , G09G2360/18
摘要： Embodiments of the present invention sets forth a method and system for reducing memory bandwidth requirements for an anti-aliasing operation. The first virtual coverage information for a pixel involved in an anti-aliasing operation is maintained in memory. If a certain operating condition of the anti-aliasing operation deterministically implies the second virtual coverage information for this pixel, the second virtual coverage information, as opposed to the first virtual coverage information, is used in the anti-aliasing operation. In such situations, since the virtual coverage information is implied, it does not have to be accessed from memory, thereby improving overall system performance.
摘要翻译：本发明的实施例提出了一种用于减少抗混叠操作的存储器带宽要求的方法和系统。涉及抗混叠操作的像素的第一虚拟覆盖信息被保持在存储器中。如果抗混叠操作的某个操作条件确定地意味着该像素的第二虚拟覆盖信息，则与抗第一虚拟覆盖信息相反的第二虚拟覆盖信息被用于抗锯齿操作。在这种情况下，由于隐含虚拟覆盖信息，因此不必从存储器访问，从而提高系统的整体性能。

6. 发明授权

US07830392B1 Connecting multiple pixel shaders to a frame buffer without a crossbar 有权
标题翻译：将多个像素着色器连接到没有交叉开关的帧缓冲区
公开(公告)号：US07830392B1
公开(公告)日：2010-11-09
申请号：US11612415
申请日：2006-12-18
申请人： John M. Danskin , Steven E. Molnar , John S. Montrym , Mark French , John H. Edmondson
发明人： John M. Danskin , Steven E. Molnar , John S. Montrym , Mark French , John H. Edmondson
IPC分类号： G06F12/02 , G06F15/80 , G06F15/50 , G09G5/00
CPC分类号： G06T15/005 , G06T2210/52 , G09G5/363 , G09G5/393 , G09G2360/06 , G09G2360/122
摘要： The number of crossbars in a graphics processing unit is reduced by assigning each of a plurality of pixels to one of a plurality of pixel shaders based at least in part on a location of each of the plurality of pixels within an image area, generating an attribute value for each of the plurality of pixels using the plurality of pixel shaders, mapping the attribute value of each of the plurality of pixels to one of a plurality of memory partitions, and storing the attribute values in the memory partitions according to the mapping. The attribute value generated by a particular one of the pixel shaders is mapped to the same one of the plurality of memory partitions.
摘要翻译：至少部分地基于图像区域内的多个像素中的每一个的位置，将多个像素中的每一个分配给多个像素着色器中的每一个来减少图形处理单元中的交叉条的数量，生成属性使用所述多个像素着色器对所述多个像素中的每一个使用所述多个像素的值，将所述多个像素中的每一个的属性值映射到多个存储器分区中的一个，并且根据所述映射将所述属性值存储在所述存储器分区中。由特定的像素着色器生成的属性值被映射到多个存储器分区中的相同的一个。

7. 发明授权

US08139073B1 Early compression tag lookup for memory accesses 有权
标题翻译：用于内存访问的早期压缩标签查找
公开(公告)号：US08139073B1
公开(公告)日：2012-03-20
申请号：US11532854
申请日：2006-09-18
申请人： James M. Van Dyke , John H. Edmondson , Brian D. Hutsell , Michael F. Harris
发明人： James M. Van Dyke , John H. Edmondson , Brian D. Hutsell , Michael F. Harris
IPC分类号： G06F13/18
CPC分类号： G06F13/1626 , H03M7/30 , H03M7/3066
摘要： Systems and methods for determining a compression tag state prior to memory client arbitration may reduce the latency for memory accesses. A compression tag is associated with each portion of a surface stored in memory and indicates whether or not the data stored in each portion is compressed or not. A client uses the compression tags to construct memory access requests and the size of each request is based on whether or not the portion of the surface to be accessed is compressed or not. When multiple clients access the same surface the compression tag reads are interlocked with the pending memory access requests to ensure that the compression tags provided to each client are accurate. This mechanism allows for memory bandwidth optimizations including reordering memory access requests for efficient access.
摘要翻译：用于在存储器客户端仲裁之前确定压缩标签状态的系统和方法可以减少存储器访问的延迟。压缩标签与存储在存储器中的表面的每个部分相关联，并指示存储在每个部分中的数据是否被压缩。客户端使用压缩标签来构造存储器访问请求，并且每个请求的大小基于被访问的表面的部分是否被压缩。当多个客户端访问相同的表面时，压缩标签读取与待处理的存储器访问请求互锁，以确保提供给每个客户端的压缩标签是准确的。这种机制允许内存带宽优化，包括重新排序存储器访问请求以进行有效的访问。

8. 发明授权

US07808507B1 Compression tag state interlock 有权
标题翻译：压缩标签状态互锁
公开(公告)号：US07808507B1
公开(公告)日：2010-10-05
申请号：US11532868
申请日：2006-09-18
申请人： James M. Van Dyke , John H. Edmondson , Brian D. Hutsell , Michael F. Harris
发明人： James M. Van Dyke , John H. Edmondson , Brian D. Hutsell , Michael F. Harris
IPC分类号： G09G5/36
CPC分类号： G09G5/001 , G09G5/39 , G09G2340/02
摘要： Systems and methods for determining a compression tag state prior to memory client arbitration may reduce the latency for memory accesses. A compression tag is associated with each portion of a surface stored in memory and indicates whether or not the data stored in each portion is compressed or not. A client uses the compression tags to construct memory access requests and the size of each request is based on whether or not the portion of the surface to be accessed is compressed or not. When multiple clients access the same surface the compression tag reads are interlocked with the pending memory access requests to ensure that the compression tags provided to each client are accurate. This mechanism allows for memory bandwidth optimizations including reordering memory access requests for efficient access.
摘要翻译：用于在存储器客户端仲裁之前确定压缩标签状态的系统和方法可以减少存储器访问的延迟。压缩标签与存储在存储器中的表面的每个部分相关联，并指示存储在每个部分中的数据是否被压缩。客户端使用压缩标签来构造存储器访问请求，并且每个请求的大小基于被访问的表面的部分是否被压缩。当多个客户端访问相同的表面时，压缩标签读取与待处理的存储器访问请求互锁，以确保提供给每个客户端的压缩标签是准确的。这种机制允许内存带宽优化，包括重新排序存储器访问请求以进行有效的访问。

9. 发明授权

US08441495B1 Compression tag state interlock 有权
标题翻译：压缩标签状态互锁
公开(公告)号：US08441495B1
公开(公告)日：2013-05-14
申请号：US12649196
申请日：2009-12-29
申请人： James M. Van Dyke , John H. Edmondson , Brian D. Hutsell , Michael F. Harris
发明人： James M. Van Dyke , John H. Edmondson , Brian D. Hutsell , Michael F. Harris
IPC分类号： G09G5/36 , G06T1/60
CPC分类号： G09G5/001 , G09G5/39 , G09G2340/02
摘要： Systems and methods for determining a compression tag state prior to memory client arbitration may reduce the latency for memory accesses. A compression tag is associated with each portion of a surface stored in memory and indicates whether or not the data stored in each portion is compressed or not. A client uses the compression tags to construct memory access requests and the size of each request is based on whether or not the portion of the surface to be accessed is compressed or not. When multiple clients access the same surface the compression tag reads are interlocked with the pending memory access requests to ensure that the compression tags provided to each client are accurate. This mechanism allows for memory bandwidth optimizations including reordering memory access requests for efficient access.
摘要翻译：用于在存储器客户端仲裁之前确定压缩标签状态的系统和方法可以减少存储器访问的延迟。压缩标签与存储在存储器中的表面的每个部分相关联，并指示存储在每个部分中的数据是否被压缩。客户端使用压缩标签来构造存储器访问请求，并且每个请求的大小基于被访问的表面的部分是否被压缩。当多个客户端访问相同的表面时，压缩标签读取与待处理的存储器访问请求互锁，以确保提供给每个客户端的压缩标签是准确的。这种机制允许内存带宽优化，包括重新排序存储器访问请求以进行有效的访问。

10. 发明申请

US20130311999A1 RESOURCE MANAGEMENT SUBSYSTEM THAT MAINTAINS FAIRNESS AND ORDER 有权
标题翻译：资源管理子系统维护公平和秩序
公开(公告)号：US20130311999A1
公开(公告)日：2013-11-21
申请号：US13476791
申请日：2012-05-21
申请人： Michael FETTERMAN , Shirish Gadre , John H. Edmondson , Omkar Paranjape , Anjana Rajendran , Eric Lyell Hill , Rajeshwaran Selvanesan , Charles McCarver , Kevin Mitchell , Steven James Heinrich
发明人： Michael FETTERMAN , Shirish Gadre , John H. Edmondson , Omkar Paranjape , Anjana Rajendran , Eric Lyell Hill , Rajeshwaran Selvanesan , Charles McCarver , Kevin Mitchell , Steven James Heinrich
IPC分类号： G06F9/50
CPC分类号： G06F9/5011 , G06F2209/507
摘要： One embodiment of the present disclosure sets forth an effective way to maintain fairness and order in the scheduling of common resource access requests related to replay operations. Specifically, a streaming multiprocessor (SM) includes a total order queue (TOQ) configured to schedule the access requests over one or more execution cycles. Access requests are allowed to make forward progress when needed common resources have been allocated to the request. Where multiple access requests require the same common resource, priority is given to the older access request. Access requests may be placed in a sleep state pending availability of certain common resources. Deadlock may be avoided by allowing an older access request to steal resources from a younger resource request. One advantage of the disclosed technique is that older common resource access requests are not repeatedly blocked from making forward progress by newer access requests.
摘要翻译：本公开的一个实施例阐述了在与重放操作相关的公共资源访问请求的调度中维持公平性和顺序的有效方式。具体地说，流式多处理器（SM）包括配置成通过一个或多个执行周期调度访问请求的总顺序队列（TOQ）。访问请求被允许在需要时将共同资源分配给该请求来进行进展。在多个访问请求需要相同的公共资源的情况下，优先级被赋予较旧的访问请求。访问请求可能处于睡眠状态，等待某些公共资源的可用性。可以通过允许较旧的访问请求从较年轻的资源请求中窃取资源来避免死锁。所公开的技术的一个优点是较旧的公共资源访问请求不被重复阻止以通过较新的访问请求提前进展。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式