Building and scheduling tasks for parallel processing
AssigneeImagination Technologies Limited
InventorsAlistair Goudie, Panagiotis Velentzas
Life of this patent
Estimating the term…
Abstract
Task building logic builds a plurality of tasks each comprising a group of rays. When a new ray is received into ray storage, if an existing task exists for the new ray, the new ray is added to an existing respective list. The task building logic indicates when any of the tasks is ready for scheduling, and task scheduling logic identifies a task ready for scheduling based on the indication from the task building logic, and in response traverses the respective list in order to schedule at least some of the rays of the respective task for processing in parallel.
Claims19
A processor comprising:
- task building logic for building a plurality of tasks, each task comprising a group of rays;
- ray storage arranged to hold a respective identifier for each of the rays;
- and
- one or more storage modules configured to store a list for each task
- wherein the task building logic is configured to, when a new ray is received into the ray storage, determine whether an existing task exists for the new ray, and if so, add the new ray to an existing respective list;
- wherein the task building logic is further configured to indicate when any of the tasks is ready for scheduling;
- and
- task scheduling logic arranged to identify a task ready for scheduling based on the indication from the task building logic, and in response, traverse the respective list in order to schedule at least some of the rays of the respective task for processing in parallel.
A method comprising:
- building a plurality of tasks, each comprising a respective group of rays to be processed;
- scheduling each of the tasks to be processed, whereby for each task, at least some of the rays of the respective group are processed in parallel;
- holding, in ray storage, respective data content of each ray;
- and
- in one or more storage modules, providing a respective entry for each of the rays;
- wherein the building of the tasks comprises:
- when a new ray is received into the ray storage, determining whether an existing task exists for the new ray, and if so adding the new ray to an existing respective list of entries in the one or more storage modules;
- the building of the tasks further comprising indicating when any of the tasks is ready for scheduling;
- and
- the scheduling comprising, based on said indication from the building, identifying a task ready for scheduling, and in response traversing the respective list in order to schedule the rays of the respective task for the processing.
A non-transitory computer readable storage medium having stored thereon computer readable code configured to, when the code is run on at least one processor, cause the at least one processor to:
- build a plurality of tasks, each comprising a respective group of rays to be processed;
- schedule each of the tasks to be processed, whereby for each task, at least some of the rays of the respective group are processed in parallel;
- hold, in ray storage, respective data content of each ray;
- and
- in one or more storage modules, provide a respective entry for each of the rays;
- wherein the building of the tasks comprises:
- when a new ray is received into the ray storage, determining whether an existing task exists for the new ray, and if so adding the new ray to an existing respective list of the a subset of the entries in the one or more storage modules;
- the building of the tasks further comprises indicating when any of the tasks is ready for scheduling;
- and
- the scheduling comprises, based on said indication from the building, identifying a task ready for scheduling, and in response traversing the respective list in order to schedule the rays of the respective task for the processing.
Dependencies are inferred from the claim text.