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

1. 发明授权

US09262174B2 Dynamic bank mode addressing for memory access 有权
标题翻译：用于存储器访问的动态存储区模式寻址
公开(公告)号：US09262174B2
公开(公告)日：2016-02-16
申请号：US13440945
申请日：2012-04-05
申请人： Michael Fetterman , Stewart Glenn Carlton , Douglas J. Hahn , Rajeshwaran Selvanesan , Shirish Gadre , Steven James Heinrich
发明人： Michael Fetterman , Stewart Glenn Carlton , Douglas J. Hahn , Rajeshwaran Selvanesan , Shirish Gadre , Steven James Heinrich
IPC分类号： G06F13/00 , G06F13/28 , G06F9/38
CPC分类号： G06F9/3887 , G06F9/3851
摘要： One embodiment sets forth a technique for dynamically mapping addresses to banks of a multi-bank memory based on a bank mode. Application programs may be configured to perform read and write a memory accessing different numbers of bits per bank, e.g., 32-bits per bank, 64-bits per bank, or 128-bits per bank. On each clock cycle an access request may be received from one of the application programs and per processing thread addresses of the access request are dynamically mapped based on the bank mode to produce a set of bank addresses. The bank addresses are then used to access the multi-bank memory. Allowing different bank mappings enables each application program to avoid bank conflicts when the memory is accesses compared with using a single bank mapping for all accesses.
摘要翻译：一个实施例提出了一种用于基于银行模式将地址动态地映射到多存储体存储器的存储体的技术。应用程序可以被配置为执行读取和写入访问每个存储体的不同位数的存储器，例如每个存储体32位，每个存储体64位或每个存储体128位。在每个时钟周期上，可以从应用程序之一接收访问请求，并且基于所述存储体模式动态地映射访问请求的每个处理线程地址以产生一组存储体地址。然后，银行地址用于访问多存储存储器。允许不同的银行映射使每个应用程序避免存储器访问时的存储器冲突，与对所有访问使用单个存储库映射相比。

2. 发明申请

US20130311686A1 MECHANISM FOR TRACKING AGE OF COMMON RESOURCE REQUESTS WITHIN A RESOURCE MANAGEMENT SUBSYSTEM 有权
标题翻译：跟踪资源管理子系统中共同资源年龄的机制
公开(公告)号：US20130311686A1
公开(公告)日：2013-11-21
申请号：US13476825
申请日：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分类号： G06F5/00
CPC分类号： H04L49/254 , G06F9/46
摘要： 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）。访问请求被允许在需要时将共同资源分配给该请求来进行进展。在多个访问请求需要相同的公共资源的情况下，优先级被赋予较旧的访问请求。访问请求可能处于睡眠状态，等待某些公共资源的可用性。可以通过允许较旧的访问请求从较年轻的资源请求中窃取资源来避免死锁。所公开的技术的一个优点是较旧的公共资源访问请求不被重复阻止以通过较新的访问请求提前进展。

3. 发明申请

US20130268715A1 DYNAMIC BANK MODE ADDRESSING FOR MEMORY ACCESS 有权
标题翻译：用于存储器访问的动态银行模式寻址
公开(公告)号：US20130268715A1
公开(公告)日：2013-10-10
申请号：US13440945
申请日：2012-04-05
申请人： Michael FETTERMAN , Stewart Glenn Carlton , Douglas J. Hahn , Rajeshwaran Selvanesan , Shirish Gadre , Steven James Heinrich
发明人： Michael FETTERMAN , Stewart Glenn Carlton , Douglas J. Hahn , Rajeshwaran Selvanesan , Shirish Gadre , Steven James Heinrich
IPC分类号： G06F12/06
CPC分类号： G06F9/3887 , G06F9/3851
摘要： One embodiment sets forth a technique for dynamically mapping addresses to banks of a multi-bank memory based on a bank mode. Application programs may be configured to perform read and write a memory accessing different numbers of bits per bank, e.g., 32-bits per bank, 64-bits per bank, or 128-bits per bank. On each clock cycle an access request may be received from one of the application programs and per processing thread addresses of the access request are dynamically mapped based on the bank mode to produce a set of bank addresses. The bank addresses are then used to access the multi-bank memory. Allowing different bank mappings enables each application program to avoid bank conflicts when the memory is accesses compared with using a single bank mapping for all accesses.
摘要翻译：一个实施例提出了一种用于基于银行模式将地址动态地映射到多存储体存储器的存储体的技术。应用程序可以被配置为执行读取和写入访问每个存储体的不同位数的存储器，例如每个存储体32位，每个存储体64位或每个存储体128位。在每个时钟周期上，可以从应用程序之一接收访问请求，并且基于所述存储体模式动态地映射访问请求的每个处理线程地址以产生一组存储体地址。然后，银行地址用于访问多存储存储器。允许不同的银行映射使每个应用程序避免存储器访问时的存储器冲突，与对所有访问使用单个存储库映射相比。

4. 发明申请

US20130187956A1 METHOD AND SYSTEM FOR REDUCING A POLYGON BOUNDING BOX 有权
标题翻译：用于减少多边形接线盒的方法和系统
公开(公告)号：US20130187956A1
公开(公告)日：2013-07-25
申请号：US13356551
申请日：2012-01-23
申请人： Walter R. STEINER , Eric LUM , Dale L. KIRKLAND , Steven James HEINRICH , David Charles PATRICK
发明人： Walter R. STEINER , Eric LUM , Dale L. KIRKLAND , Steven James HEINRICH , David Charles PATRICK
IPC分类号： G09G5/00
CPC分类号： G06T11/40 , G06T11/00
摘要： In a graphics processing pipeline, a processing unit establishes a bounding box around a polygon in order to identify sample points that are covered by the polygon. For a given sample point included within the bounding box, the processing unit constructs a set of lines that intersect at the sample point, where each line in the set of lines is parallel to at least one side of the polygon. When all vertices of the polygon reside on one side of at least one line in the set of lines, the processing unit may reduce the size of the bounding box to exclude the sample point.
摘要翻译：在图形处理流水线中，处理单元在多边形周围建立边界框，以便识别多边形覆盖的采样点。对于包含在边界框内的给定采样点，处理单元构建在采样点相交的一组线，其中该组线中的每条线平行于多边形的至少一侧。当多边形的所有顶点驻留在该组行中的至少一行的一侧时，处理单元可以减小边界框的大小以排除采样点。

5. 发明申请

US20110078692A1 COALESCING MEMORY BARRIER OPERATIONS ACROSS MULTIPLE PARALLEL THREADS 有权
标题翻译：通过多个并行线程来解决存储器障碍操作
公开(公告)号：US20110078692A1
公开(公告)日：2011-03-31
申请号：US12887081
申请日：2010-09-21
申请人： John R. NICKOLLS , Steven James Heinrich , Brett W. Coon , Michael C. Shebanow
发明人： John R. NICKOLLS , Steven James Heinrich , Brett W. Coon , Michael C. Shebanow
IPC分类号： G06F9/46
CPC分类号： G06F9/3834 , G06F9/3004 , G06F9/30087 , G06F9/3851
摘要： One embodiment of the present invention sets forth a technique for coalescing memory barrier operations across multiple parallel threads. Memory barrier requests from a given parallel thread processing unit are coalesced to reduce the impact to the rest of the system. Additionally, memory barrier requests may specify a level of a set of threads with respect to which the memory transactions are committed. For example, a first type of memory barrier instruction may commit the memory transactions to a level of a set of cooperating threads that share an L1 (level one) cache. A second type of memory barrier instruction may commit the memory transactions to a level of a set of threads sharing a global memory. Finally, a third type of memory barrier instruction may commit the memory transactions to a system level of all threads sharing all system memories. The latency required to execute the memory barrier instruction varies based on the type of memory barrier instruction.
摘要翻译：本发明的一个实施例提出了一种用于在多个并行线程之间聚合存储器屏障操作的技术。来自给定并行线程处理单元的存储器屏障请求被合并以减少对系统其余部分的影响。此外，存储器屏障请求可以指定针对其提交内存事务的一组线程的级别。例如，第一类型的存储器障碍指令可以将存储器事务提交到共享L1（一级）高速缓存的一组协作线程的级别。第二种类型的存储器障碍指令可以将存储器事务提交到共享全局存储器的一组线程的级别。最后，第三种类型的存储器障碍指令可以将存储器事务提交到共享所有系统存储器的所有线程的系统级。执行存储器屏障指令所需的延迟基于存储器屏障指令的类型而变化。

6. 发明申请

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）。访问请求被允许在需要时将共同资源分配给该请求来进行进展。在多个访问请求需要相同的公共资源的情况下，优先级被赋予较旧的访问请求。访问请求可能处于睡眠状态，等待某些公共资源的可用性。可以通过允许较旧的访问请求从较年轻的资源请求中窃取资源来避免死锁。所公开的技术的一个优点是较旧的公共资源访问请求不被重复阻止以通过较新的访问请求提前进展。

7. 发明申请

US20130159684A1 BATCHED REPLAYS OF DIVERGENT OPERATIONS 有权
标题翻译：批量操作的重复操作
公开(公告)号：US20130159684A1
公开(公告)日：2013-06-20
申请号：US13329066
申请日：2011-12-16
申请人： Michael Fetterman , Jack Hilaire Choquette , Omkar Paranjape , Anjana Rajendran , Eric Lyell Hill , Stewart glenn Carlton , Rajeshwaran Selvanesan , Douglas J. Hahn , Steven James Heinrich
发明人： Michael Fetterman , Jack Hilaire Choquette , Omkar Paranjape , Anjana Rajendran , Eric Lyell Hill , Stewart glenn Carlton , Rajeshwaran Selvanesan , Douglas J. Hahn , Steven James Heinrich
IPC分类号： G06F9/38 , G06F9/312
CPC分类号： G06F9/3851 , G06F9/3861
摘要： One embodiment of the present invention sets forth an optimized way to execute replay operations for divergent operations in a parallel processing subsystem. Specifically, the streaming multiprocessor (SM) includes a multistage pipeline configured to batch two or more replay operations for processing via replay loop. A logic element within the multistage pipeline detects whether the current pipeline stage is accessing a shared resource, such as loading data from a shared memory. If the threads are accessing data which are distributed across multiple cache lines, then the multistage pipeline batches two or more replay operations, where the replay operations are inserted into the pipeline back-to-back. Advantageously, divergent operations requiring two or more replay operations operate with reduced latency. Where memory access operations require transfer of more than two cache lines to service all threads, the number of clock cycles required to complete all replay operations is reduced.
摘要翻译：本发明的一个实施例阐述了在并行处理子系统中对发散操作执行重放操作的优化方法。具体地说，流式多处理器（SM）包括多级流水线，其被配置为批量两个或更多个重播操作以便经由重放循环进行处理。多级流水线内的逻辑元件检测当前流水线阶段是否正在访问共享资源，例如从共享内存加载数据。如果线程正在访问分布在多个高速缓存行中的数据，则多级管道批量执行两个或更多个重放操作，其中重放操作被背对背地插入到管道中。有利地，需要两次或更多次重放操作的发散操作以降低的等待时间运行。在存储器访问操作需要传送两条以上的高速缓存行以服务所有线程的情况下，完成所有重放操作所需的时钟周期数减少。

8. 发明授权

US09952977B2 Cache operations and policies for a multi-threaded client 有权
公开(公告)号：US09952977B2
公开(公告)日：2018-04-24
申请号：US12890476
申请日：2010-09-24
申请人： Steven James Heinrich , Alexander L. Minkin , Brett W. Coon , Rajeshwaran Selvanesan , Robert Steven Glanville , Charles McCarver , Anjana Rajendran , Stewart Glenn Carlton , John R. Nickolls , Brian Fahs
发明人： Steven James Heinrich , Alexander L. Minkin , Brett W. Coon , Rajeshwaran Selvanesan , Robert Steven Glanville , Charles McCarver , Anjana Rajendran , Stewart Glenn Carlton , John R. Nickolls , Brian Fahs
IPC分类号： G06F12/00 , G06F12/0842 , G06F12/0897
CPC分类号： G06F12/0842 , G06F12/0897
摘要： A method for managing a parallel cache hierarchy in a processing unit. The method including receiving an instruction that includes a cache operations modifier that identifies a level of the parallel cache hierarchy in which to cache data associated with the instruction; and implementing a cache replacement policy based on the cache operations modifier.

9. 发明授权

US09633458B2 Method and system for reducing a polygon bounding box 有权
公开(公告)号：US09633458B2
公开(公告)日：2017-04-25
申请号：US13356551
申请日：2012-01-23
申请人： Walter R. Steiner , Eric Lum , Dale L. Kirkland , Steven James Heinrich , David Charles Patrick
发明人： Walter R. Steiner , Eric Lum , Dale L. Kirkland , Steven James Heinrich , David Charles Patrick
IPC分类号： G09G5/00 , G06T11/40 , G06T11/00
CPC分类号： G06T11/40 , G06T11/00
摘要： In a graphics processing pipeline, a processing unit establishes a bounding box around a polygon in order to identify sample points that are covered by the polygon. For a given sample point included within the bounding box, the processing unit constructs a set of lines that intersect at the sample point, where each line in the set of lines is parallel to at least one side of the polygon. When all vertices of the polygon reside on one side of at least one line in the set of lines, the processing unit may reduce the size of the bounding box to exclude the sample point.

10. 发明授权

US08997103B2 N-way memory barrier operation coalescing 有权
标题翻译： N路记忆障碍操作合并
公开(公告)号：US08997103B2
公开(公告)日：2015-03-31
申请号：US13441785
申请日：2012-04-06
申请人： Shirish Gadre , Charles McCarver , Anjana Rajendran , Omkar Paranjape , Steven James Heinrich
发明人： Shirish Gadre , Charles McCarver , Anjana Rajendran , Omkar Paranjape , Steven James Heinrich
IPC分类号： G06F9/46 , G06F1/04 , G06F7/00 , G06F9/38 , G06F9/30 , G06F9/52
CPC分类号： G06F9/3834 , G06F9/3004 , G06F9/30087 , G06F9/3851 , G06F9/522
摘要： One embodiment sets forth a technique for N-way memory barrier operation coalescing. When a first memory barrier is received for a first thread group execution of subsequent memory operations for the first thread group are suspended until the first memory barrier is executed. Subsequent memory barriers for different thread groups may be coalesced with the first memory barrier to produce a coalesced memory barrier that represents memory barrier operations for multiple thread groups. When the coalesced memory barrier is being processed, execution of subsequent memory operations for the different thread groups is also suspended. However, memory operations for other thread groups that are not affected by the coalesced memory barrier may be executed.
摘要翻译：一个实施例提出了一种用于N路存储器屏障操作合并的技术。当为第一线程组接收到第一存储器障碍时，对于第一线程组的后续存储器操作的执行被暂停，直到执行第一存储器障碍。不同线程组的后续内存障碍可以与第一存储器屏障合并，以产生代表多个线程组的存储器屏障操作的聚结存储器屏障。当合并的存储器障碍被处理时，对于不同的线程组的后续存储器操作的执行也被暂停。然而，可以执行不受聚结的存储器屏障影响的其他线程组的存储器操作。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式