Scheduling heterogeneous computation on multithreaded processors
AssigneeImagination Technologies Limited
InventorsLuke Tilman Peterson, James Alexander McCombe
Life of this patent
Estimating the term…
Loading patent…
AssigneeImagination Technologies Limited
InventorsLuke Tilman Peterson, James Alexander McCombe
Estimating the term…
Aspects include computation systems that can identify computation instances that are not capable of being reentrant, or are not reentrant capable on a target architecture, or are non-reentrant as a result of having a memory conflict in a particular execution situation. For example, a system can have a plurality of computation units, each with an independently schedulable SIMD vector. Computation instances can be defined by a program module, and a data element(s) that may be stored in a local cache for a particular computation unit of the plurality. Each local cache does not maintain coherency controls for such data elements. During scheduling, a scheduler can maintain a list of running (or runnable) instances, and attempt to schedule new computation instances by determining whether any new computation instance conflicts with a running instance and responsively defer scheduling. Such memory conflict checks can be conditioned on a flag or other indication of the potential for non-reentrancy.
A graphics rendering system for performing graphics computation, comprising:
A computer-implemented graphics rendering method of executing instances of graphics computation on a plurality of computation units, the method comprising:
A non-transitory computer readable storage medium having stored thereon computer readable code that, when executed, causes a method of scheduling instances of graphics computation to be performed in a graphics rendering system, wherein the method comprises:
Dependencies are inferred from the claim text.