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

1. 发明授权

US09442759B2 Concurrent execution of independent streams in multi-channel time slice groups 有权
标题翻译：在多通道时间片组中并发执行独立流
公开(公告)号：US09442759B2
公开(公告)日：2016-09-13
申请号：US13316334
申请日：2011-12-09
申请人： Samuel H. Duncan , Lacky V. Shah , Sean J. Treichler , Daniel Elliot Wexler , Jerome F. Duluk, Jr. , Philip Browning Johnson , Jonathon Stuart Ramsay Evans
发明人： Samuel H. Duncan , Lacky V. Shah , Sean J. Treichler , Daniel Elliot Wexler , Jerome F. Duluk, Jr. , Philip Browning Johnson , Jonathon Stuart Ramsay Evans
IPC分类号： G06F9/46 , G06F13/00 , G06F9/48 , G06F9/38
CPC分类号： G06F9/4881 , G06F9/3851 , G06F9/461
摘要： A time slice group (TSG) is a grouping of different streams of work (referred to herein as “channels”) that share the same context information. The set of channels belonging to a TSG are processed in a pre-determined order. However, when a channel stalls while processing, the next channel with independent work can be switched to fully load the parallel processing unit. Importantly, because each channel in the TSG shares the same context information, a context switch operation is not needed when the processing of a particular channel in the TSG stops and the processing of a next channel in the TSG begins. Therefore, multiple independent streams of work are allowed to run concurrently within a single context increasing utilization of parallel processing units.
摘要翻译：时间片组（TSG）是共享相同上下文信息的不同工作流（本文称为“信道”）的分组。属于TSG的信道集合以预定的顺序被处理。然而，当通道在处理过程中停顿时，可以切换具有独立工作的下一个通道来完全加载并行处理单元。重要的是，由于TSG中的每个信道共享相同的上下文信息，当TSG中的特定信道的处理停止并且TSG中的下一个信道的处理开始时，不需要上下文切换操作。因此，允许多个独立的工作流在单个上下文中同时运行，增加并行处理单元的利用率。

2. 发明授权

US10795722B2 Compute task state encapsulation 有权
公开(公告)号：US10795722B2
公开(公告)日：2020-10-06
申请号：US13292951
申请日：2011-11-09
申请人： Jerome F. Duluk, Jr. , Lacky V. Shah , Sean J. Treichler
发明人： Jerome F. Duluk, Jr. , Lacky V. Shah , Sean J. Treichler
IPC分类号： G06F9/48 , G06F9/46 , G06F9/50
摘要： One embodiment of the present invention sets forth a technique for encapsulating compute task state that enables out-of-order scheduling and execution of the compute tasks. The scheduling circuitry organizes the compute tasks into groups based on priority levels. The compute tasks may then be selected for execution using different scheduling schemes. Each group is maintained as a linked list of pointers to compute tasks that are encoded as task metadata (TMD) stored in memory. A TMD encapsulates the state and parameters needed to initialize, schedule, and execute a compute task.

3. 发明授权

US08984183B2 Signaling, ordering, and execution of dynamically generated tasks in a processing system 有权
标题翻译：在处理系统中信令，排序和执行动态生成的任务
公开(公告)号：US08984183B2
公开(公告)日：2015-03-17
申请号：US13329169
申请日：2011-12-16
申请人： Timothy John Purcell , Lacky V. Shah , Jerome F. Duluk, Jr. , Sean J. Treichler , Karim M. Abdalla , Philip Alexander Cuadra , Brian Pharris
发明人： Timothy John Purcell , Lacky V. Shah , Jerome F. Duluk, Jr. , Sean J. Treichler , Karim M. Abdalla , Philip Alexander Cuadra , Brian Pharris
IPC分类号： G06F3/00 , G06F9/46 , G06F9/48
CPC分类号： G06F9/4843
摘要： One embodiment of the present invention sets forth a technique for enabling the insertion of generated tasks into a scheduling pipeline of a multiple processor system allows a compute task that is being executed to dynamically generate a dynamic task and notify a scheduling unit of the multiple processor system without intervention by a CPU. A reflected notification signal is generated in response to a write request when data for the dynamic task is written to a queue. Additional reflected notification signals are generated for other events that occur during execution of a compute task, e.g., to invalidate cache entries storing data for the compute task and to enable scheduling of another compute task.
摘要翻译：本发明的一个实施例提出了一种用于使所生成的任务能够插入到多处理器系统的调度流水线中的技术，允许正在执行的计算任务动态生成动态任务并通知多处理器系统的调度单元没有CPU的干预。当将动态任务的数据写入队列时，响应于写入请求产生反映的通知信号。为在执行计算任务期间发生的其他事件生成附加的反映的通知信号，例如，使存储用于计算任务的数据的高速缓存条目无效并启用其他计算任务的调度。

4. 发明申请

US20130160021A1 SIGNALING, ORDERING, AND EXECUTION OF DYNAMICALLY GENERATED TASKS IN A PROCESSING SYSTEM 有权
标题翻译：在处理系统中的动态生成任务的信号，订购和执行
公开(公告)号：US20130160021A1
公开(公告)日：2013-06-20
申请号：US13329169
申请日：2011-12-16
申请人： Timothy John PURCELL , Lacky V. Shah , Jerome F. Duluk, JR. , Sean J. Treichler , Karim M. Abdalla , Philip Alexander Cuadra , Brian Pharris
发明人： Timothy John PURCELL , Lacky V. Shah , Jerome F. Duluk, JR. , Sean J. Treichler , Karim M. Abdalla , Philip Alexander Cuadra , Brian Pharris
IPC分类号： G06F9/46
CPC分类号： G06F9/4843
摘要： One embodiment of the present invention sets forth a technique for enabling the insertion of generated tasks into a scheduling pipeline of a multiple processor system allows a compute task that is being executed to dynamically generate a dynamic task and notify a scheduling unit of the multiple processor system without intervention by a CPU. A reflected notification signal is generated in response to a write request when data for the dynamic task is written to a queue. Additional reflected notification signals are generated for other events that occur during execution of a compute task, e.g., to invalidate cache entries storing data for the compute task and to enable scheduling of another compute task.
摘要翻译：本发明的一个实施例提出了一种用于使所生成的任务能够插入到多处理器系统的调度流水线中的技术，允许正在执行的计算任务动态生成动态任务并通知多处理器系统的调度单元没有CPU的干预。当将动态任务的数据写入队列时，响应于写入请求产生反映的通知信号。为在执行计算任务期间发生的其他事件生成附加的反映的通知信号，例如，使存储用于计算任务的数据的高速缓存条目无效并启用其他计算任务的调度。

5. 发明授权

US09069609B2 Scheduling and execution of compute tasks 有权
标题翻译：计划任务的计划和执行
公开(公告)号：US09069609B2
公开(公告)日：2015-06-30
申请号：US13353150
申请日：2012-01-18
申请人： Karim M. Abdalla , Lacky V. Shah , Jerome F. Duluk, Jr. , Timothy John Purcell , Tanmoy Mandal , Gentaro Hirota
发明人： Karim M. Abdalla , Lacky V. Shah , Jerome F. Duluk, Jr. , Timothy John Purcell , Tanmoy Mandal , Gentaro Hirota
IPC分类号： G06F9/46 , G06F9/48 , G06F9/50
CPC分类号： G06F9/4881 , G06F9/4806 , G06F9/50 , G06F2209/483
摘要： One embodiment of the present invention sets forth a technique for assigning a compute task to a first processor included in a plurality of processors. The technique involves analyzing each compute task in a plurality of compute tasks to identify one or more compute tasks that are eligible for assignment to the first processor, where each compute task is listed in a first table and is associated with a priority value and an allocation order that indicates relative time at which the compute task was added to the first table. The technique further involves selecting a first task compute from the identified one or more compute tasks based on at least one of the priority value and the allocation order, and assigning the first compute task to the first processor for execution.
摘要翻译：本发明的一个实施例提出了一种用于将计算任务分配给包括在多个处理器中的第一处理器的技术。该技术涉及分析多个计算任务中的每个计算任务以识别符合分配给第一处理器的一个或多个计算任务，其中每个计算任务在第一表中列出并且与优先级值和分配指示将计算任务添加到第一个表的相对时间的顺序。该技术还包括基于优先级值和分配顺序中的至少一个从所识别的一个或多个计算任务中选择第一任务计算，以及将第一计算任务分配给第一处理器以供执行。

6. 发明申请

US20130074088A1 SCHEDULING AND MANAGEMENT OF COMPUTE TASKS WITH DIFFERENT EXECUTION PRIORITY LEVELS 审中-公开
标题翻译：具有不同优先级别的计算机任务的调度和管理
公开(公告)号：US20130074088A1
公开(公告)日：2013-03-21
申请号：US13236473
申请日：2011-09-19
申请人： Timothy John PURCELL , Lacky V. Shah , Jerome F. Duluk, JR.
发明人： Timothy John PURCELL , Lacky V. Shah , Jerome F. Duluk, JR.
IPC分类号： G06F9/46
CPC分类号： G06F9/4881 , G06F9/461
摘要： One embodiment of the present invention sets forth a technique for dynamically scheduling and managing compute tasks with different execution priority levels. The scheduling circuitry organizes the compute tasks into groups based on priority levels. The compute tasks may then be selected for execution using different scheduling schemes, such as round-robin, priority, and partitioned priority. Each group is maintained as a linked list of pointers to compute tasks that are encoded as queue metadata (QMD) stored in memory. A QMD encapsulates the state needed to execute a compute task. When a task is selected for execution by the scheduling circuitry, the QMD is removed for a group and transferred to a table of active compute tasks. Compute tasks are then selected from the active task table for execution by a streaming multiprocessor.
摘要翻译：本发明的一个实施例提出了一种用于动态调度和管理具有不同执行优先级的计算任务的技术。调度电路基于优先级将计算任务组织成组。然后可以使用不同的调度方案来选择计算任务，例如循环，优先级和分区优先级。维护每个组作为指向存储在存储器中的队列元数据（QMD）编码的任务的指针的链表。 QMD封装执行计算任务所需的状态。当任务被选择用于由调度电路执行时，针对组移除QMD并将其传送到活动计算任务的表。然后从活动任务表中选择计算任务，以便由流式多处理器执行。

7. 发明授权

US09507638B2 Compute work distribution reference counters 有权
标题翻译：计算工作分配参考计数器
公开(公告)号：US09507638B2
公开(公告)日：2016-11-29
申请号：US13291369
申请日：2011-11-08
申请人： Philip Alexander Cuadra , Karim M. Abdalla , Jerome F. Duluk, Jr. , Luke Durant , Gerald F. Luiz , Timothy John Purcell , Lacky V. Shah
发明人： Philip Alexander Cuadra , Karim M. Abdalla , Jerome F. Duluk, Jr. , Luke Durant , Gerald F. Luiz , Timothy John Purcell , Lacky V. Shah
IPC分类号： G06F9/455 , G06F9/50
CPC分类号： G06F9/5022
摘要： One embodiment of the present invention sets forth a technique for managing the allocation and release of resources during multi-threaded program execution. Programmable reference counters are initialized to values that limit the amount of resources for allocation to tasks that share the same reference counter. Resource parameters are specified for each task to define the amount of resources allocated for consumption by each array of execution threads that is launched to execute the task. The resource parameters also specify the behavior of the array for acquiring and releasing resources. Finally, during execution of each thread in the array, an exit instruction may be configured to override the release of the resources that were allocated to the array. The resources may then be retained for use by a child task that is generated during execution of a thread.
摘要翻译：本发明的一个实施例提出了一种用于在多线程程序执行期间管理资源的分配和释放的技术。可编程参考计数器被初始化为限制用于分配给共享相同引用计数器的任务的资源量的值。为每个任务指定资源参数，以定义为执行任务启动的每个执行线程数组分配的消耗资源量。资源参数还指定数组用于获取和释放资源的行为。最后，在执行阵列中的每个线程时，可以将退出指令配置为覆盖分配给阵列的资源的释放。然后可以保留资源以供执行线程期间生成的子任务使用。

8. 发明授权

US09715413B2 Execution state analysis for assigning tasks to streaming multiprocessors 有权
公开(公告)号：US09715413B2
公开(公告)日：2017-07-25
申请号：US13353155
申请日：2012-01-18
申请人： Karim M. Abdalla , Lacky V. Shah , Jerome F. Duluk, Jr. , Timothy John Purcell , Tanmoy Mandal , Gentaro Hirota
发明人： Karim M. Abdalla , Lacky V. Shah , Jerome F. Duluk, Jr. , Timothy John Purcell , Tanmoy Mandal , Gentaro Hirota
IPC分类号： G06F9/46 , G06F13/00 , G06F9/50
CPC分类号： G06F9/505 , G06F2209/503
摘要： One embodiment of the present invention sets forth a technique for selecting a first processor included in a plurality of processors to receive work related to a compute task. The technique involves analyzing state data of each processor in the plurality of processors to identify one or more processors that have already been assigned one compute task and are eligible to receive work related to the one compute task, receiving, from each of the one or more processors identified as eligible, an availability value that indicates the capacity of the processor to receive new work, selecting a first processor to receive work related to the one compute task based on the availability values received from the one or more processors, and issuing, to the first processor via a cooperative thread array (CTA), the work related to the one compute task.

9. 发明申请

US20130298133A1 TECHNIQUE FOR COMPUTATIONAL NESTED PARALLELISM 有权
标题翻译：计算并行平行技术
公开(公告)号：US20130298133A1
公开(公告)日：2013-11-07
申请号：US13462649
申请日：2012-05-02
申请人： Stephen JONES , Philip Alexander Cuadra , Daniel Elliot Wexler , Ignacio Llamas , Lacky V. Shah , Jerome F. Duluk, JR. , Christopher Lamb
发明人： Stephen JONES , Philip Alexander Cuadra , Daniel Elliot Wexler , Ignacio Llamas , Lacky V. Shah , Jerome F. Duluk, JR. , Christopher Lamb
IPC分类号： G06F9/50
CPC分类号： G06F9/5027 , G06F9/522 , G06F2209/483 , G06T1/20
摘要： One embodiment of the present invention sets forth a technique for performing nested kernel execution within a parallel processing subsystem. The technique involves enabling a parent thread to launch a nested child grid on the parallel processing subsystem, and enabling the parent thread to perform a thread synchronization barrier on the child grid for proper execution semantics between the parent thread and the child grid. This technique advantageously enables the parallel processing subsystem to perform a richer set of programming constructs, such as conditionally executed and nested operations and externally defined library functions without the additional complexity of CPU involvement.
摘要翻译：本发明的一个实施例提出了一种用于在并行处理子系统内执行嵌套的内核执行的技术。该技术涉及使父线程启动并行处理子系统上的嵌套子网格，并使父线程能够在子网格上执行线程同步屏障，以在父线程和子网格之间实现正确的执行语义。该技术有利地使得并行处理子系统能够执行更丰富的编程结构集合，诸如条件执行和嵌套操作以及外部定义的库函数，而不会增加CPU参与的复杂性。

10. 发明申请

US20130198760A1 AUTOMATIC DEPENDENT TASK LAUNCH 审中-公开
标题翻译：自动相关任务启动
公开(公告)号：US20130198760A1
公开(公告)日：2013-08-01
申请号：US13360581
申请日：2012-01-27
申请人： Philip Alexander CUADRA , Lacky V. Shah , Timothy John Purcell , Gerald F. Luiz , Jerome F. Duluk, JR.
发明人： Philip Alexander CUADRA , Lacky V. Shah , Timothy John Purcell , Gerald F. Luiz , Jerome F. Duluk, JR.
IPC分类号： G06F9/46
CPC分类号： G06F9/4881 , G06F9/445 , G06F2209/484
摘要： One embodiment of the present invention sets forth a technique for automatic launching of a dependent task when execution of a first task completes. Automatically launching the dependent task reduces the latency incurred during the transition from the first task to the dependent task. Information associated with the dependent task is encoded as part of the metadata for the first task. When execution of the first task completes a task scheduling unit is notified and the dependent task is launched without requiring any release or acquisition of a semaphore. The information associated with the dependent task includes an enable flag and a pointer to the dependent task. Once the dependent task is launched, the first task is marked as complete so that memory storing the metadata for the first task may be reused to store metadata for a new task.
摘要翻译：本发明的一个实施例提出了当执行第一任务完成时自动启动依赖任务的技术。自动启动从属任务可以减少在从第一个任务到从属任务的转换过程中产生的延迟。与依赖任务相关联的信息被编码为第一任务的元数据的一部分。当执行第一任务完成任务调度单元被通知并且从属任务被启动而不需要任何释放或获取信号量时。与从属任务相关联的信息包括使能标志和指向依赖任务的指针。一旦启动依赖任务，第一个任务被标记为完整的，以便存储第一个任务的元数据的内存可以被重新用于存储新任务的元数据。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式