# US 2026/0099360 A1 · Grouping tasks for execution by a processor

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0099360 A1
- Document ID: US20260099360A1
- Status: Published application
- Kind: A1
- Application number: 18/911,020
- Filed: 2024-10-09
- Published: 2026-04-09
- Earliest claimed: 2024-10-09
- Assignees: NVIDIA Corporation
- Applicants: NVIDIA Corporation
- Inventors: Gentaro Hirota; Naman Govil; Umur Darbaz; Gregory Scott Palmer; Andrei Khodakovsky
- Web page: https://patentgrep.com/patent/US20260099360A1

## CPC

- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 9/461: {Saving or restoring of program or task context}
- G06F 9/485: {Task life-cycle, e.g. stopping, restarting, resuming execution (G06F9/4881 takes precedence)}
- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- G06F 9/5038: {considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration (scheduling strategies G06F9/4881 and subgroups)}
- G06F 9/5066: {Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs (mappping at compile time, see G06F8/451)}
- G06F 9/52: Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F 9/522: {Barrier synchronisation}
- G06F 2209/483: Multiproc
- G06F 2209/484: Precedence
- G06F 2209/5017: Task decomposition
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Disclosed are systems and techniques for grouping tasks for execution by a processor. The techniques include receiving a plurality of task descriptors, each task descriptor having corresponding task metadata. The techniques further include determining a first subset of the plurality of task descriptors based on the task metadata. The techniques further include generating a group task descriptor comprising the first subset of the plurality of task descriptors. The techniques further include providing the group task descriptor to be scheduled for execution by a parallel processing unit.

## Claims

### Claim 1

A method comprising:
receiving a plurality of task descriptors, each task descriptor having corresponding task metadata;
determining a first subset of the plurality of task descriptors based on the task metadata;
generating a group task descriptor comprising the first subset of the plurality of task descriptors; and
providing the group task descriptor to be scheduled for execution by a parallel processing device.

### Claim 2 (depends on 1)

The method of claim 1, wherein the task metadata comprises dependency information comprising at least barrier information.

### Claim 3 (depends on 2)

The method of claim 2, wherein determining the first subset of the plurality of task descriptors based on the task metadata comprises comparing barrier information of a first task of the plurality of task descriptors and barrier information of a second task of the plurality of task descriptors.

### Claim 4 (depends on 1)

The method of claim 1, wherein the group task descriptor further comprises shared task state and individual task state.

### Claim 5 (depends on 1)

The method of claim 1, wherein receiving the plurality of task descriptors comprises reading the plurality of task descriptors from a memory of the parallel processing device.

### Claim 6 (depends on 1)

The method of claim 1, wherein a first task of the plurality of task descriptors is a compute task for execution by the parallel processing device.

### Claim 7 (depends on 1)

The method of claim 1, the method further comprising:
receiving a first new task descriptor and a second new task descriptor, each having corresponding task metadata;
determining that the task metadata of the first new task descriptor does not match the task metadata of the second new task descriptor;
providing the first new task descriptor to be scheduled for execution by the parallel processing device; and
providing the second new task descriptor to be scheduled for execution by the parallel processing device.

### Claim 8

A system comprising:
a parallel processing unit; and
a circuit, coupled to the parallel processing unit, to:
receive a plurality of task descriptors, each task descriptor having corresponding task metadata;
determine a first subset of the plurality of task descriptors based on the task metadata;
generate a group task descriptor comprising the first subset of the plurality of task descriptors; and
provide the group task descriptor to be scheduled for execution by the parallel processing unit.

### Claim 9 (depends on 8)

The system of claim 8, wherein the task metadata comprises dependency information comprising at least barrier information.

### Claim 10 (depends on 9)

The system of claim 9, wherein to determine the first subset of the plurality of task descriptors based on the task metadata, the circuit is to compare barrier information of a first task of the plurality of task descriptors and barrier information of a second task of the plurality of task descriptors.

### Claim 11 (depends on 8)

The system of claim 8, wherein the group task descriptor further comprises shared task state and individual task state.

### Claim 12 (depends on 8)

The system of claim 8, further comprising a memory coupled to the parallel processing unit and the circuit, and wherein to receive the plurality of task descriptors, the circuit is to read the plurality of task descriptors from the memory.

### Claim 13 (depends on 8)

The system of claim 8, wherein a first task of the plurality of task descriptors is a compute task for execution by the parallel processing unit.

### Claim 14 (depends on 8)

The system of claim 8, wherein the circuit is further to:
receive a first new task descriptor and a second new task descriptor, each having corresponding task metadata;
determine that the task metadata of the first new task descriptor does not match the task metadata of the second new task descriptor;
provide the first new task descriptor to be scheduled for execution by the parallel processing unit; and
provide the second new task descriptor to be scheduled for execution by the parallel processing unit.

### Claim 15

A system comprising:
a first processor; and
a second processor, coupled to the first processor, to:
receive a plurality of task descriptors, each task descriptor having corresponding task metadata;
determine a first subset of the plurality of task descriptors based on the task metadata;
generate a group task descriptor comprising the first subset of the plurality of task descriptors; and
provide the group task descriptor to be scheduled for execution by the first processor.

### Claim 16 (depends on 15)

The system of claim 15, wherein the task metadata comprises dependency information comprising at least barrier information.

### Claim 17 (depends on 16)

The system of claim 16, wherein to determine the first subset of the plurality of task descriptors based on the task metadata, the second processor is to compare barrier information of a first task of the plurality of task descriptors and barrier information of a second task of the plurality of task descriptors.

### Claim 18 (depends on 15)

The system of claim 15, wherein the group task descriptor further comprises shared task state and individual task state.

### Claim 19 (depends on 15)

The system of claim 15, wherein to receive the plurality of task descriptors, the second processor is to read the plurality of task descriptors from a memory of the first processor.

### Claim 20 (depends on 15)

The system of claim 15, wherein the second processor is further to:
receive a first new task descriptor and a second new task descriptor, each having corresponding task metadata;
determine that the task metadata of the first new task descriptor does not match the task metadata of the second new task descriptor;
provide the first new task descriptor to be scheduled for execution by the first processor; and
provide the second new task descriptor to be scheduled for execution by the first processor.
