# US 2025/0148688 A1 · Graphics Processor with Non-Blocking Concurrent Architecture

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

- Number: US 2025/0148688 A1
- Document ID: US20250148688A1
- Status: Published application
- Kind: A1
- Application number: 19/017,672
- Filed: 2025-01-12
- Published: 2025-05-08
- Earliest claimed: 2011-06-16
- Assignees: Imagination Technologies Limited
- Applicants: Imagination Technologies Limited
- Inventors: Luke T. Peterson; James A. McCombe; Steven J. Clohset; Jason R. Redgrave
- Web page: https://patentgrep.com/patent/US20250148688A1

## CPC

- G06T 15/005: {General purpose rendering architectures}
- G06F 9/5033: {considering data affinity}
- G06F 9/505: {considering the load}
- G06F 9/52: Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F 15/8007: {single instruction multiple data [SIMD] multiprocessors}
- G06T 1/20: Processor architectures; Processor configuration, e.g. pipelining
- G06T 1/60: Memory management
- G06T 15/06: Ray-tracing
- G06T 2200/28: involving image processing hardware
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In some aspects, systems and methods provide for forming groupings of a plurality of independently-specified computation workloads, such as graphics processing workloads, and in a specific example, ray tracing workloads. The workloads include a scheduling key, which is one basis on which the groupings can be formed. Workloads grouped together can all execute from the same source of instructions, on one or more different private data elements. Such workloads can recursively instantiate other workloads that reference the same private data elements. In some examples, the scheduling key can be used to identify a data element to be used by all the workloads of a grouping. Memory conflicts to private data elements are handled through scheduling of non-conflicted workloads or specific instructions and/or deferring conflicted workloads instead of locking memory locations.

## Claims

### Claim 1

A computer-implemented method for processing workloads in a computer system comprising a plurality of computation elements, the method comprising:
receiving a plurality of fibres, each of the fibres comprising computer executable instructions, and each of the fibres having an associated priority;
identifying a scheduling key for each of the fibres;
grouping the fibres into one or more groups of fibres based on the identified scheduling key for each of the fibres; and
scheduling, for execution, the one or more groups of fibres based on the priority of each of the fibres.

### Claim 2 (depends on 1)

The method according to claim 1, wherein each of the fibres are instantiated individually either by a thread or another fibre.

### Claim 3 (depends on 1)

The method according to claim 1, further comprising determining a packet identifier representing one of the groups of fibres.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the method further comprises applying an aging mechanism to the priority of each of the fibres.

### Claim 5 (depends on 1)

The method according to claim 1, wherein the priority of each of the fibres is updated by a local cluster controller.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the method further comprises determining a priority for each of the fibres based on the current execution state of the fibres within the computer system.

### Claim 7 (depends on 1)

The method according to claim 1, wherein the priority of each of the one or more fibres of a group is determined based on a storage location of the group of fibres.

### Claim 8 (depends on 1)

The method according to claim 1, wherein the priority of each of the one or more fibres is determined based on a priority determined for a group comprising that fibre.

### Claim 9 (depends on 1)

The method according to claim 1, wherein the computer executable instructions of a fibre are operable to:
read and write to a fibre storage memory, and
instantiate additional fibres.

### Claim 10 (depends on 1)

The method according to claim 1, wherein the computer executable instructions of a fibre are operable to read data from the fibre storage memory through a Non-Uniform Memory Access (NUMA) architecture.

### Claim 11 (depends on 1)

The method according to claim 1, wherein the fibres grouped together for execution are executed to perform ray tracing.

### Claim 12 (depends on 1)

The method according to claim 1, wherein the fibres grouped together for execution are executed to perform database traversal.

### Claim 13 (depends on 1)

The method according to claim 1, wherein the fibres grouped together for execution are executed to perform sorting.

### Claim 14 (depends on 1)

The method according to claim 1, wherein the fibres grouped together for execution are executed to perform spatial searching.

### Claim 15 (depends on 1)

The method according to claim 1, wherein the computer executable instructions of the fibres grouped together for execution are executed on a GPU.

### Claim 16

A computing system configured to process workloads, wherein the computing system comprises:
a plurality of computation elements configured to execute fibres that comprise computer executable instructions; and
a controller configured to:
receive a plurality of fibres, each of the fibres having an associated priority;
identify a scheduling key for each of the fibres;
group the fibres into one or more groups of fibres based on the identified scheduling key for each of the fibres; and
schedule, for execution, the one or more groups of fibres based on the priority of each of the fibres.

### Claim 17 (depends on 16)

The computing system according to claim 16, further comprising a host processor which is configured to execute threads, and wherein the computer system further comprises a computing module that is a fibre API which is further configured to interface with the host processor to allow threads running on the host processor to instantiate a plurality of fibres for execution on one or more computation elements.

### Claim 18

A non-transitory computer readable storage medium having stored thereon computer readable instructions, which when executed on at least one processor in a computer system comprising a plurality of computation elements, causes the computer system to:
receive a plurality of fibres, each of the fibres comprising computer executable instructions, and each of the fibres having an associated priority;
identify a scheduling key for each of the fibres;
group the fibres into one or more groups of fibres based on the identified scheduling key for each of the fibres; and
schedule, for execution, the one or more groups of fibres based on the priority of each of the fibres.
