# US 2023/0273818 A1 · Highly parallel processing architecture with out-of-order resolution

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

- Number: US 2023/0273818 A1
- Document ID: US20230273818A1
- Status: Published application
- Kind: A1
- Application number: 18/119,315
- Filed: 2023-03-09
- Published: 2023-08-31
- Earliest claimed: 2020-09-09
- Assignees: Ascenium, Inc.
- Applicants: Ascenium, Inc.
- Inventors: Peter Foley
- Web page: https://patentgrep.com/patent/US20230273818A1

## CPC

- G06F 8/443: {Optimisation}
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 8/41: Compilation
- G06F 8/451: {Code distribution (considering CPU load at run-time G06F9/505; load rebalancing G06F9/5083)}
- G06F 15/17381: {Two dimensional, e.g. mesh, torus}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Techniques for task processing based on a highly parallel processing architecture with out-of-order resolution are disclosed. A two-dimensional array of compute elements is accessed. Each compute element within the array of compute elements is known to a compiler and is coupled to its neighboring compute elements within the array of compute elements. The array of compute elements is coupled to supporting logic and to memory, which, along with the array of compute elements, comprise compute hardware. A set of directions is provided to the hardware, through a control word generated by the compiler, for compute element operation. The set of directions is augmented with data access ordering information. The data access ordering is performed by the hardware. A compiled task is executed on the array of compute elements, based on the set of directions that was augmented.

## Claims

### Claim 1

A processor-implemented method for task processing comprising:
accessing a two-dimensional array of compute elements, wherein each compute element within the array of compute elements is known to a compiler and is coupled to its neighboring compute elements within the array of compute elements, and wherein the array of compute elements is coupled to supporting logic and to memory, which together with the array of compute elements comprises compute hardware;
providing a set of directions to the hardware, through a control word generated by the compiler, for compute element operation;
augmenting the set of directions with data access ordering information, wherein data access ordering is performed by the compute hardware; and
executing a compiled task on the array of compute elements, based on the set of directions that was augmented.

### Claim 2 (depends on 1)

The method of claim 1 wherein the ordering information includes ordering information for a single architectural cycle.

### Claim 3 (depends on 2)

The method of claim 2 wherein the single architectural cycle contains multiple compute element operations.

### Claim 4 (depends on 1)

The method of claim 1 wherein the ordering information includes ordering information for load and/or store operations.

### Claim 5 (depends on 4)

The method of claim 4 wherein the load and/or store operations read and/or write data to the memory.

### Claim 6 (depends on 4)

The method of claim 4 wherein the load and/or store ordering information enables the hardware to detect data access hazards.

### Claim 7 (depends on 6)

The method of claim 6 wherein the data access hazards include write-after-read, read-after-write, and write-after-write conflicts.

### Claim 8 (depends on 6)

The method of claim 6 further comprising resolving a data access hazard that was detected.

### Claim 9 (depends on 8)

The method of claim 8 wherein the resolving includes delaying loads and/or stores.

### Claim 10 (depends on 9)

The method of claim 9 wherein data for the load and/or store is held in buffers.

### Claim 11 (depends on 10)

The method of claim 10 wherein the data held in buffers is committed after the data access hazard detection and mitigation window has expired.

### Claim 12 (depends on 4)

The method of claim 4 wherein the load and/or store operations involve a temporal distance of more than one architectural cycle.

### Claim 13 (depends on 12)

The method of claim 12 further comprising using local buffers to delay commitment of data for the load and/or store operations.

### Claim 14 (depends on 13)

The method of claim 13 wherein the data for load operations is read from the memory.

### Claim 15 (depends on 13)

The method of claim 13 wherein the data for store operations is written to the memory.

### Claim 16 (depends on 1)

The method of claim 1 wherein the compute hardware ensures semantic correctness of operations to the memory.

### Claim 17 (depends on 1)

The method of claim 1 wherein the data access ordering enables ordering of memory data.

### Claim 18 (depends on 17)

The method of claim 17 wherein the ordering of memory data enables compute element result sequencing.

### Claim 19 (depends on 1)

The method of claim 1 wherein the control word specifies operations for the array of compute elements.

### Claim 20 (depends on 19)

The method of claim 19 wherein the operations are specified on a physical cycle-by-cycle basis.

### Claim 21 (depends on 20)

The method of claim 20 wherein the physical cycle-by-cycle basis comprises an architectural cycle.

### Claim 22 (depends on 1)

The method of claim 1 wherein the data access ordering information is generated by the hardware during runtime.

### Claim 23

A computer program product embodied in a non-transitory computer readable medium for task processing, the computer program product comprising code which causes one or more processors to perform operations of:
accessing a two-dimensional array of compute elements, wherein each compute element within the array of compute elements is known to a compiler and is coupled to its neighboring compute elements within the array of compute elements, and wherein the array of compute elements is coupled to supporting logic and to memory, which together with the array of compute elements comprises compute hardware;
providing a set of directions to the hardware, through a control word generated by the compiler, for compute element operation;
augmenting the set of directions with data access ordering information, wherein data access ordering is performed by the compute hardware; and
executing a compiled task on the array of compute elements, based on the set of directions that was augmented.

### Claim 24

A computer system for task processing comprising:
a memory which stores instructions;
one or more processors coupled to the memory, wherein the one or more processors, when executing the instructions which are stored, are configured to:
access a two-dimensional array of compute elements, wherein each compute element within the array of compute elements is known to a compiler and is coupled to its neighboring compute elements within the array of compute elements, and wherein the array of compute elements is coupled to supporting logic and to memory, which together with the array of compute elements comprises compute hardware;
provide a set of directions to the hardware, through a control word generated by the compiler, for compute element operation;
augment the set of directions with data access ordering information, wherein data access ordering is performed by the compute hardware; and
execute a compiled task on the array of compute elements, based on the set of directions that was augmented.
