-
公开(公告)号:US12118398B2
公开(公告)日:2024-10-15
申请号:US16041066
申请日:2018-07-20
Applicant: Imagination Technologies Limited
Inventor: Luke Tilman Peterson , James Alexander McCombe
CPC classification number: G06F9/5038 , G06F9/3828 , G06F9/3851 , G06F9/3891 , G06F2209/506
Abstract: 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.
-
公开(公告)号:US20240331298A1
公开(公告)日:2024-10-03
申请号:US18736313
申请日:2024-06-06
Applicant: Imagination Technologies Limited
Inventor: Peter Malcolm Lacey
CPC classification number: G06T17/20 , G06T15/005 , G06T17/005 , G06T17/10 , G06T2200/28
Abstract: A method of generating identifiers (IDs) for primitives and optionally vertices during tessellation. The IDs include a binary sequence of bits that represents the sub-division steps taken during the tessellation process and so encodes the way in which tessellation has been performed. Such an ID may subsequently be used to generate a random primitive or vertex and hence recalculate vertex data for that primitive or vertex.
-
公开(公告)号:US20240320298A1
公开(公告)日:2024-09-26
申请号:US18591401
申请日:2024-02-29
Applicant: Imagination Technologies Limited
Inventor: Gunduz Vehbi Demirci , Cagatay Dikici , Grant Michael Stevens , Le Yang
IPC: G06F17/16
CPC classification number: G06F17/16
Abstract: Methods of implementing a sparse submanifold convolution using a neural network accelerator. The methods include: receiving, at the neural network accelerator, an input tensor in a sparse format; performing, at the neural network accelerator, for each position of a kernel of the sparse submanifold convolution, a 1×1 convolution between the received input tensor and weights of filters of the sparse submanifold convolution at that kernel position to generate a plurality of partial outputs; and combining appropriate partial outputs of the plurality of partial outputs to generate an output tensor of the sparse submanifold convolution in sparse format.
-
公开(公告)号:US20240320039A1
公开(公告)日:2024-09-26
申请号:US18737728
申请日:2024-06-07
Applicant: Imagination Technologies Limited
Inventor: Jonas Olof Gunnar Källén
IPC: G06F9/48 , G06F9/50 , G06F13/16 , G06F13/18 , G06F13/20 , G06F13/28 , G06F13/364 , G06F16/901
CPC classification number: G06F9/4881 , G06F9/48 , G06F9/4806 , G06F9/4818 , G06F9/4831 , G06F9/50 , G06F9/5005 , G06F9/5027 , G06F9/5038 , G06F13/16 , G06F13/1605 , G06F13/18 , G06F13/20 , G06F13/28 , G06F13/364 , G06F16/9027
Abstract: Methods and systems for generating common priority information for a plurality of requestors in a computing system that share a plurality of computing resources for use in a next cycle to arbitrate between the plurality of requestors, include generating, for each resource, priority information for the next cycle based on an arbitration scheme; generating, for each resource, relevant priority information for the next cycle based on the priority information for the next cycle for that resource, the relevant priority information for a resource being the priority information that relates to requestors that requested access to the resource in the current cycle and were not granted access to the resource in the current cycle; and combining the relevant priority information for the next cycle for each resource to generate the common priority information for the next cycle.
-
公开(公告)号:US20240319963A1
公开(公告)日:2024-09-26
申请号:US18581261
申请日:2024-02-19
Applicant: Imagination Technologies Limited
Inventor: Rostam King , Simon Fenney
IPC: G06F7/499
CPC classification number: G06F7/49963
Abstract: A binary logic circuit and method for rounding an unsigned normalised n-bit binary number to an m-bit binary number. A correction value of length of n bits and a pre-truncation value of length of n bits are determined. The correction value is determined by shifting the n-bit number by m bits. The pre-truncation value is determined based on at least the n-bit number, the correction value, a value for the most significant bit (MSB) of the n-bit number, and a rounding value having a ‘1’ at the n−mth bit position and a ‘0’ at all other bits. The rounded m-bit number is then obtained by truncating the n−m least significant bits (LSB) of the pre-truncation value.
-
公开(公告)号:US12100062B2
公开(公告)日:2024-09-24
申请号:US17737118
申请日:2022-05-05
Applicant: Imagination Technologies Limited
Inventor: John W. Howson , Richard Broadhurst , Steven Fishwick
IPC: G06T1/20 , G06F9/38 , G06T1/60 , G06T7/11 , G06T11/40 , G06T15/00 , H04N19/00 , H04N19/115 , H04N19/117 , H04N19/124 , H04N19/14 , H04N19/174
CPC classification number: G06T1/20 , G06F9/38 , G06T1/60 , G06T7/11 , G06T11/40 , G06T15/005 , H04N19/00 , H04N19/115 , H04N19/117 , H04N19/124 , H04N19/14 , H04N19/174
Abstract: A computing system comprises graphics rendering logic and image processing logic. The graphics rendering logic processes graphics data to render an image using a rendering space which is sub-divided into a plurality of tiles. Cost indication logic obtains a cost indication for each of a plurality of sets of one or more tiles of the rendering space, wherein the cost indication for a set of one or more tiles is suggestive of a cost of processing rendered image values for a region of the rendered image corresponding to the set of one or more tiles. The image processing logic processes rendered image values for regions of the rendered image. The computing system causes the image processing logic to process rendered image values for regions of the rendered image in dependence on the cost indications for the corresponding sets of one or more tiles.
-
47.
公开(公告)号:US20240303903A1
公开(公告)日:2024-09-12
申请号:US18635206
申请日:2024-04-15
Applicant: Imagination Technologies Limited
Inventor: Rostam King , Kenneth Rovers
CPC classification number: G06T15/04 , G06F17/18 , G06T7/60 , G06T15/503
Abstract: A method of performing anisotropic texture filtering includes generating one or more parameters describing an elliptical footprint in texture space; performing isotropic filtering at each of a plurality of sampling points along a major axis of the elliptical footprint, wherein a spacing between adjacent sampling points of the plurality of sampling points is proportional to √{square root over (1−η−2)} units, wherein η is a ratio of a major radius of an ellipse to be sampled and a minor radius of the ellipse to be sampled, wherein the ellipse to be sampled is based on the elliptical footprint; and combining results of the isotropic filtering at the plurality of sampling points with a Gaussian filter to generate at least a portion of a filter result.
-
公开(公告)号:US20240303867A1
公开(公告)日:2024-09-12
申请号:US18599517
申请日:2024-03-08
Applicant: Imagination Technologies Limited
Inventor: Peter Smith-Lacey
CPC classification number: G06T9/00 , G06T15/04 , G06T15/06 , G06T15/08 , G06T2210/12 , G06T2210/21 , G06T2210/36
Abstract: A method of compressing data for representing displacement information in a ray tracing system, wherein the displacement information indicates displacements to be applied to geometry in a scene to be rendered by the ray tracing system. The method includes retrieving a pair of datasets representing the displacement information, wherein a first of the datasets comprises a first array of values, and a second of the datasets comprises a second array of values; retrieving values from a corresponding array position in each of the first and second arrays, wherein the retrieved values form a pair of values representing an upper and lower bound of a magnitude of displacement for the corresponding array position. The method includes identifying which of a plurality of predetermined conditions the pair of values satisfies, and encoding the pair of values as a single value in a compressed dataset, wherein the single value represents the identified predetermined condition.
-
公开(公告)号:US20240290035A1
公开(公告)日:2024-08-29
申请号:US18401369
申请日:2023-12-30
Applicant: Imagination Technologies Limited
Inventor: John William Howson
CPC classification number: G06T17/20 , G06T15/005 , G06T15/40
Abstract: A method and apparatus are provided for tessellating patches of surfaces in a tile based three dimensional computer graphics rendering system. For each tile in an image a per tile list of primitive indices is derived for tessellated primitives which make up a patch. Hidden surface removal is then performed on the patch and any domain points which remain after hidden surface removal are derived. The primitives are then shaded for display.
-
公开(公告)号:US12073567B2
公开(公告)日:2024-08-27
申请号:US17187831
申请日:2021-02-28
Applicant: Imagination Technologies Limited
Inventor: Aria Ahmadi , David Walton , Cagatay Dikici
CPC classification number: G06T7/246 , G06F18/22 , G06F18/23 , G06T7/207 , G06T7/248 , G06T2207/20081
Abstract: A method of analysing objects in a first frame and a second frame is disclosed. The method includes segmenting the frames, and matching at least one object in the first frame with a corresponding object in the second frame. The method optionally includes estimating the motion of the at least one matched object between the frames. Also disclosed is a method of generating a training dataset suitable for training machine learning algorithms to estimate the motion of objects. Also provided are processing systems configured to carry out these methods.
-
-
-
-
-
-
-
-
-