# US 2025/0147799 A1 · Systems and methods for task management

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

- Number: US 2025/0147799 A1
- Document ID: US20250147799A1
- Status: Published application
- Kind: A1
- Application number: 18/501,868
- Filed: 2023-11-03
- Published: 2025-05-08
- Earliest claimed: 2023-11-03
- Assignees: Xilinx, Inc.
- Applicants: Xilinx, Inc.
- Inventors: Thomas Calvert; Ripduman Sohan; Dmitri Kitariev; Kimon Karras; Stephan Diestelhorst; Neil Turton; David Riddoch; Derek Roberts; Kieran Mansley; Steven Pope
- Web page: https://patentgrep.com/patent/US20250147799A1

## CPC

- G06F 9/4806: {Task transfer initiation or dispatching}
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- 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/546: {Message passing systems or structures, e.g. queues}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A computer-implemented method for task management can include managing performance of a task on a message by a plurality of circuits. In some aspects, the task can comprise a sequence of processings to be performed on the message and each circuit of the plurality of circuits performing a processing of the sequence of processings. In some aspects, the method can include routing, based on the sequence, a first information regarding the task to a first circuit of the plurality of circuits to perform a first processing of the sequence of processings on the message; receiving, from the first circuit, an output of the first processing; and routing, based on the sequence of processings identified for the task, a second information regarding the task to a second circuit of the plurality of circuits to perform a second processing that follows the first processing in the sequence of processings.

## Claims

### Claim 1

A method comprising:
managing performance of a task on a message by a plurality of circuits of a processing device, the task comprising a sequence of processings to be performed on the message and each circuit of the plurality of circuits performing a processing of the sequence of processings, the managing performance of the task comprising:
routing, based on the sequence of processings for the task, first information regarding the task to a first circuit of the plurality of circuits to perform a first processing of the sequence of processings on the message;
receiving, from the first circuit, an output of the first processing; and
routing, based on the sequence of processings identified for the task, second information regarding the task to a second circuit of the plurality of circuits to perform a second processing that follows the first processing in the sequence of processings.

### Claim 2 (depends on 1)

The method of claim 1, wherein:
the method is performed by a controller communicatively coupled to each circuit of the plurality of circuits, wherein each circuit of the plurality of circuits is connected to the controller via one or more interfaces;
wherein each circuit of the plurality of circuits comprises one or more queues for output of tasks that are to be passed to one or more other circuits of the plurality of circuits; and
routing to a circuit of the plurality of circuits comprises routing to an interface of the circuit from a queue of another circuit of the plurality of circuits.

### Claim 3 (depends on 1)

The method of claim 1, wherein:
the task is a first type of task, the first type of tasks comprising the sequence of processings performed with the plurality of circuits; and
a second type of task comprises a second sequence of processings performed with at least some of the plurality of circuits, the second sequence of processings being different from the sequence of processings.

### Claim 4 (depends on 1)

The method of claim 1, wherein:
the task is one of a plurality of tasks, the plurality of tasks organized into at least a first flow of tasks;
managing performance of the task comprises selecting, at a time, between one or more tasks for which information is to be routed to circuits of the plurality of circuits for processing; and
managing performance of the task comprises ensuring that tasks of the first flow of tasks are processed by circuits of the plurality of circuits according to an order of the tasks in the first flow.

### Claim 5 (depends on 1)

The method of claim 1, wherein:
the message comprises a command and/or data;
the task comprises a task description comprising information regarding performance of the task; and
routing the first information regarding the task to the first circuit and the second information regarding the task to the second circuit comprises routing, at a time, at least some of the task description at the time.

### Claim 6 (depends on 5)

The method of claim 5, wherein:
each of the plurality of circuits is communicatively coupled to a shared memory;
the command and/or the data for the message is stored in a message buffer in the shared memory;
the information regarding performance of the task is stored in the shared memory separate from the command and/or the data; and
the task description comprises a pointer to a location storing the information regarding performance of the task, a pointer to the command and/or data, and/or a flow identifier identifying a flow of tasks with which the task is associated.

### Claim 7 (depends on 6)

The method of claim 6, wherein:
the first circuit edits the flow identifier for the task; and
the second information regarding the task has a different flow identifier for the task than the first information regarding the task.

### Claim 8 (depends on 7)

The method of claim 7, wherein routing the first and second information regarding the task to the first circuit and the second circuit, respectively, comprises looking up the flow identifier in a table of information regarding routing of tasks.

### Claim 9 (depends on 1)

The method of claim 1, wherein the first circuit is a programmable processing circuit.

### Claim 10 (depends on 1)

The method of claim 1, further comprising:
receiving the message from a network.

### Claim 11

A non-transitory computer-readable storage medium for storing instructions executable by a processor, the instructions comprising:
managing performance of a task on a message by a plurality of circuits of a processing device, the task comprising a sequence of processings to be performed on the message and each circuit of the plurality of circuits performing a processing of the sequence of processings, the managing performance of the task comprising:
routing, based on the sequence of processings for the task, first information regarding the task to a first circuit of the plurality of circuits to perform a first processing of the sequence of processings on the message;
receiving, from the first circuit, an output of the first processing; and
routing, based on the sequence of processings identified for the task, second information regarding the task to a second circuit of the plurality of circuits to perform a second processing that follows the first processing in the sequence of processings.

### Claim 12 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein:
the instructions are performed by a controller communicatively coupled to each circuit of the plurality of circuits, wherein each circuit of the plurality of circuits is connected to the controller via one or more interfaces;
wherein each circuit of the plurality of circuits comprises one or more queues for output of tasks that are to be passed to one or more other circuits of the plurality of circuits; and
routing to a circuit of the plurality of circuits comprises routing to an interface of the circuit from a queue of another circuit of the plurality of circuits.

### Claim 13 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein:
the task is a first type of task, the first type of tasks comprising the sequence of processings performed with the plurality of circuits; and
a second type of task comprises a second sequence of processings performed with at least some of the plurality of circuits, the second sequence of processings being different from the sequence of processings.

### Claim 14 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein:
the task is one of a plurality of tasks, the plurality of tasks organized into at least a first flow of tasks;
managing performance of the task comprises selecting, at a time, between one or more tasks for which information is to be routed to circuits of the plurality of circuits for processing; and
managing performance of the task comprises ensuring that tasks of the first flow of tasks are processed by circuits of the plurality of circuits according to an order of the tasks in the first flow.

### Claim 15 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein:
the message comprises a command and/or data;
the task comprises a task description comprising information regarding performance of the task; and
routing the first information regarding the task to the first circuit and the second information regarding the task to the second circuit comprises routing, at a time, at least some of the task description at the time.

### Claim 16 (depends on 15)

The non-transitory computer-readable storage medium of claim 15, wherein:
each of the plurality of circuits is communicatively coupled to a shared memory;
the command and/or the data for the message is stored in a message buffer in the shared memory;
the information regarding performance of the task is stored in the shared memory separate from the command and/or the data; and
the task description comprises a pointer to a location storing the information regarding performance of the task, a pointer to the command and/or data, and/or a flow identifier identifying a flow of tasks with which the task is associated.

### Claim 17 (depends on 16)

The non-transitory computer-readable storage medium of claim 16, wherein:
the first circuit edits the flow identifier for the task; and
the second information regarding the task has a different flow identifier for the task than the first information regarding the task.

### Claim 18 (depends on 17)

The non-transitory computer-readable storage medium of claim 17, wherein routing the first and second information regarding the task to the first circuit and the second circuit, respectively, comprises looking up the flow identifier in a table of information regarding routing of tasks.

### Claim 19 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein the first circuit is a programmable processing circuit.

### Claim 20

A device comprising:
a circuit configured to perform a method comprising managing performance of a task on a message by a plurality of circuits of the device, the task comprising a sequence of processings to be performed on the message and each circuit of the plurality of circuits performing a processing of the sequence of processings, the managing performance of the task comprising:
routing, based on the sequence of processings for the task, first information regarding the task to a first circuit of the plurality of circuits to perform a first processing of the sequence of processings on the message;
receiving, from the first circuit, an output of the first processing; and
routing, based on the sequence of processings identified for the task, second information regarding the task to a second circuit of the plurality of circuits to perform a second processing that follows the first processing in the sequence of processings.
