# US 2025/0165292 A1 · Data processor

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

- Number: US 2025/0165292 A1
- Document ID: US20250165292A1
- Status: Published application
- Kind: A1
- Application number: 18/512,615
- Filed: 2023-11-17
- Published: 2025-05-22
- Earliest claimed: 2023-11-17
- Assignees: Arm Limited
- Applicants: Arm Limited
- Inventors: Dominic Hugo Symes; Rune Holm; Thomas Patrik Andreas Olsson
- Web page: https://patentgrep.com/patent/US20250165292A1

## CPC

- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The present disclosure relates to a data processor for processing data, comprising: a plurality of execution units to execute one or more operations; and a plurality of storage elements to store data for the one or more operations, the data processor being configured to process at least one task, each task to be executed in the form of a directed acyclic graph of operations, wherein each of the operations maps to a corresponding execution unit and each connection between operations in the acyclic graph maps to a corresponding storage element, the data processor further comprising: a plurality of counters; and a control module to control the plurality of counters to: in a first mode, count an operation cycle number associated with each operation of the at least one task, the operation cycle number of an operation being a number of cycles required to complete the operation; and in a second mode, count a unit cycle number associated with one or more execution units, the unit cycle number of an execution unit being an accumulative number of cycles when the execution unit is occupied in use during execution of the at least one task.

## Claims

### Claim 1

A data processor for processing data, comprising:
a plurality of execution units to execute one or more operations; and
a plurality of storage elements to store data for the one or more operations,
the data processor being configured to process at least one task, each task to be executed in the form of a graph of operations, wherein each of the operations maps to a corresponding execution unit and each connection between operations in the graph maps to a corresponding storage element,
the data processor further comprising:
a plurality of counters; and
a control module to control the plurality of counters to:
in a first mode, count an operation cycle number associated with each operation of the at least one task, the operation cycle number of an operation being a number of cycles required to complete the operation; and
in a second mode, count a unit cycle number associated with one or more execution units, the unit cycle number of an execution unit being an accumulative number of cycles when the execution unit is occupied during execution of the at least one task.

### Claim 2 (depends on 1)

The data processor of claim 1, wherein the control module is configured to, in the first mode, assign a set of counters from the plurality of counters to each task of the at least one task, wherein, for each task, each operation of the task is assigned with at least one counter from the corresponding set of counters to count the operation cycle number associated with the operation.

### Claim 3 (depends on 1)

The data processor of claim 1, wherein the control module is configured to, in the second mode, assign a set of counters from the plurality of counters to a pair of dependent execution units, wherein the pair of dependent execution units comprises a source execution unit that executes a first operation for the at least one task and a destination execution unit that executes a second operation for the at least one task by receiving input data from the source execution unit.

### Claim 4 (depends on 3)

The data processor of claim 3, wherein the set of counters is configured to only count a cycle towards the unit cycle number of the pair of dependent execution units when at least one stall condition is met.

### Claim 5 (depends on 4)

The data processor of claim 4, wherein the at least one stall condition comprises:
(a) the destination execution unit is idle on the second operation;
(b) a destination connection to which the second operation outputs data is not full;
(c) a source connection to which the first operation outputs data to the second operation is generated by the source execution unit; or
(d) the source connection contains less than a block of data.

### Claim 6 (depends on 5)

The data processor of claim 5, wherein the set of counters is configured to only count a cycle towards the unit cycle number of the pair of dependent execution units when all stall conditions are met.

### Claim 7 (depends on 1)

The data processor of claim 1, wherein the plurality of execution units comprises a first execution unit and the at least one task comprises a first task and a second task, the first execution unit being configured to execute both a first operation associated with the first task and a second operation associated with the second task, and wherein the control module is configured to, in the first mode, assign a first set of counters to the first task, at least one counter of the first set of counters being configured to count the operation cycle number against the first operation, and assign a second set of counters to the second task, at least one counter of the second set of counters being configured to count the operation cycle number against the second operation.

### Claim 8 (depends on 7)

The data processor of claim 7, wherein, in the first mode, for each overlapping cycle in which the first execution unit executes the first operation and the second operation substantially simultaneously, the first set of counters and the second set of counters are configured to each separately count the overlapping cycle respectively against the first operation and the second operation.

### Claim 9 (depends on 1)

The data processor of claim 1, wherein the plurality of execution units comprise a first execution unit and the at least one task comprises a first task and a second task, the first execution unit being configured to execute both a first operation associated with the first task and a second operation associated with the second task, and wherein the control module is configured to, in the second mode, assign a set of counters to the first execution unit to count the unit cycle number of the first execution unit when the first execution unit is occupied during execution of the first task and/or the second task.

### Claim 10 (depends on 9)

The data processor of claim 9, wherein the first task and the second task at least partially overlap, and the set of counters is configured to, in the second mode, count the unit cycle number of the first execution unit against the first task to count a number of cycles when the first execution unit is executing the first operation or the second operation.

### Claim 11 (depends on 10)

The data processor of claim 10, wherein the set of counters is configured to, in the second mode, reset upon completion of the first task, and to count the unit cycle number of the first execution unit against the second task to count a number of cycles when the first execution unit is executing the second operation.

### Claim 12

A computer-implemented method of processing data in a data processor, the data processor comprising a plurality of execution units, a plurality of storage elements, a plurality of counters, and a control module, the data processor being configured to process at least one task, each task to be executed in the form of a graph of operations, wherein each of the operations maps to a corresponding execution unit and each connection between operations in the graph maps to a corresponding storage element, the method comprising:
controlling, by the control module, the plurality of counters to:
in a first mode, count an operation cycle number associated with each operation of the at least one task, the operation cycle number of an operation being a number of cycles required to complete the operation; and
in a second mode, count a unit cycle number associated with one or more execution units, the unit cycle number of an execution unit being an accumulative number of cycles when the execution unit is occupied during execution of the at least one task.

### Claim 13 (depends on 12)

The method of claim 12, further comprising:
assigning, by the control module, in the first mode, a set of counters from the plurality of counters to each task of the at least one task, wherein, for each task, each operation of the task is assigned with at least one counter from the corresponding set of counters to count the operation cycle number associated with the operation; and
assigning, by the control module, in the second mode, a set of counters from the plurality of counters to a pair of dependent execution units, wherein the pair of dependent execution units comprises a source execution unit that executes a first operation for the at least one task and a destination execution unit that executes a second operation for the at least one task by receiving input data from the source execution unit.

### Claim 14 (depends on 13)

The method of claim 13, further comprising the set of counters only counting a cycle towards the unit cycle number of the pair of dependent execution units when at least one stall condition is met.

### Claim 15 (depends on 14)

The method of claim 14, wherein the at least one stall condition comprises:
(a) the destination execution unit is idle on the second operation;
(b) a destination connection to which the second operation outputs data is not full;
(c) a source connection to which the first operation outputs data to the second operation is generated by the source execution unit; or
(d) the source connection contains less than a block of data.

### Claim 16 (depends on 15)

The method of claim 15, further comprising the set of counters only counting a cycle towards the unit cycle number of the pair of dependent execution units when all stall conditions are met.

### Claim 17 (depends on 12)

The method of claim 12, wherein the plurality of execution units comprises a first execution unit and the at least one task comprises a first task and a second task, the first execution unit being configured to execute both a first operation associated with the first task and a second operation associated with the second task, and the method further comprises, in the first mode:
assigning, by the control module, a first set of counters to the first task and configuring at least one counter of the first set of counters to count the operation cycle number against the first operation; and
assigning, by the control module, a second set of counters to the second task and configuring at least one counter of the second set of counters to count the operation cycle number against the second operation.

### Claim 18 (depends on 17)

The method of claim 17, further comprising, in the first mode, for each overlapping cycle in which the first execution unit substantially simultaneously executes the first operation and the second operation:
counting, by the first set of counters the overlapping cycle against the first operation; and
counting, by the second set of counters, the overlapping cycle against the second operation.

### Claim 19 (depends on 12)

The method of claim 12, wherein the plurality of execution units comprises a first execution unit and the at least one task comprises a first task and a second task, the first execution unit being configured to execute both a first operation associated with the first task and a second operation associated with the second task, and the method further comprises, in the second mode:
assigning, by the control module is configured to, a set of counters to the first execution unit to count the unit cycle number of the first execution unit when the first execution unit is occupied during execution of the first task and/or the second task.

### Claim 20 (depends on 19)

The method of claim 19, wherein the first task and the second task at least partially overlap, and the method further comprises, in the second mode:
counting, by the set of counters, the unit cycle number of the first execution unit against the first task to count a number of cycles when the first execution unit is executing the first operation or the second operation; and
optionally, upon completion of the first task, resetting the set of counters and counting the unit cycle number of the first execution unit against the second task to count a number of cycles when the first execution unit is executing the second operation.
