IP Library Granted Patent US 11,934,878
Granted Patent B2
US 11,934,878 · App. 18/125,665 · Granted Mar 19, 2024

Memory allocation for 3-D graphics rendering

Inventor: Michael John Livesley (Hertfordshire, GB)
Assignee: Imagination Technologies Limited
G06F9/5016G06T1/60G06T15/005
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,934,878
App. No.
18/125,665
Granted
Mar 19, 2024
Kind
B2
Abstract

A method and apparatus are provided for allocating memory for geometry processing in a 3-D graphics rendering system comprising multiple cores. Geometry processing work is divided up into discrete work-packages, which form an ordered sequence. Cores are assigned different work-packages to process, and make memory allocation requests to enable them to store the results of the processing. Memory allocation requests relating to the current earliest uncompleted work-package in the sequence are treated differently to other requests, and may be prioritised.

Claims (40)

1. A method of allocating memory for geometry processing in a 3-D graphics rendering system comprising multiple cores, the method comprising:

obtaining information describing a sequence of geometry-processing work-packages distributed among the multiple cores, wherein the information includes, for each work package, an index of the work package in the sequence, and an indication of whether the work package is currently being processed or has been completed;

identifying the earliest active work-package, being the earliest work-package in the sequence that is currently being processed by any of the cores;

receiving a request from one of the cores to allocate memory for geometry processing, and

determining whether to allocate the requested memory based at least in part on whether the request was received from the core processing the earliest active work-package.

2. The method of claim 1 , further comprising:

if the request was received from the core processing the earliest active work-package, allocating the memory; and

if the request was received from any other core, restricting the allocation of the memory.

3. The method of claim 2 , wherein the restricting is based at least in part on an amount of memory already allocated to the core.

4. The method of claim 3 , wherein the restricting is based at least in part on an amount of unrecoverable memory already allocated to the core, wherein memory is unrecoverable if it stores the output of geometry processing for work-packages subsequent in the sequence to the earliest active work-package.

5. The method of claim 2 , wherein the restricting is based at least in part on the size of a remaining free pool of memory available for the geometry processing.

6. The method of claim 5 , wherein the restricting is based on a comparison between the amount of unrecoverable memory already allocated to the core and the size of the remaining free pool of memory.

7. The method of claim 2 , wherein the restricting is based on a comparison between the amount of unrecoverable memory already allocated to the core and a fixed threshold.

8. The method of claim 2 , wherein the restricting is based on a comparison between the amount of unrecoverable memory already allocated to the core and a dynamic threshold.

9. The method of claim 8 , wherein the dynamic threshold is based at least in part on the size of the remaining free pool of memory.

10. The method of claim 8 , wherein the dynamic threshold is based at least in part on a minimum operable amount of memory for geometry processing.

11. The method of claim 8 , wherein the dynamic threshold is based at least in part on the size of the remaining free pool of memory divided by the number of cores in the system.

12. The method of claim 1 , wherein the information describing the sequence of geometry-processing work-packages distributed among the multiple cores is maintained in a register array for each core.

13. The method of claim 12 , wherein the register array for each core comprises an entry for each work-package assigned to that core, each entry comprising a “valid” flag, a “completed” flag, the index of the work-package, and an indication of the amount of memory currently allocated for that work-package.

14. A core configured to allocate memory for geometry processing in a 3-D graphics rendering system comprising multiple cores, the core comprising a parameter management master unit configured to:

obtain information describing a sequence of geometry-processing work-packages distributed among the multiple cores, wherein the information includes, for each work package, an index of the work package in the sequence, and an indication of whether the work package is currently being processed or has been completed;

identify the earliest active work-package, being the earliest work-package in the sequence that is currently being processed by any of the cores;

receive a request from one of the cores to allocate memory for geometry processing, and

determine whether to allocate the requested memory based at least in part on whether the request was received from the core processing the earliest active work-package.

15. The core of claim 14 , wherein the parameter management master unit is further configured to:

allocate the requested memory if the request was received from the core processing the earliest active work-package; and

if the request was received from any other core, restrict the allocation of the requested memory.

16. A graphics rendering system comprising:

a first core as set forth in claim 14 ;

at least one second core; and

a memory;

wherein the parameter management master unit of the first core is configured to allocate portions of the memory to the at least one second core for geometry processing work.

17. A graphics processing system comprising the core as set forth in claim 14 , and configured to:

obtain information describing a sequence of geometry-processing work-packages distributed among the multiple cores, wherein the information includes, for each work package, an index of the work package in the sequence, and an indication of whether the work package is currently being processed or has been completed;

identify the earliest active work-package, being the earliest work-package in the sequence that is currently being processed by any of the cores;

receive a request from one of the cores to allocate memory for geometry processing, and

determine whether to allocate the requested memory based at least in part on whether the request was received from the core processing the earliest active work-package.

18. A method of manufacturing a graphics processing system as set forth in claim 17 comprising inputting to an integrated circuit manufacturing system an integrated circuit definition dataset that, when processed in said integrated circuit manufacturing system, configures the integrated circuit manufacturing system to manufacture said graphics processing system.

19. A non-transitory computer readable storage medium having stored thereon executable code configured to cause the method as set forth in claim 1 to be performed when the code is run.

20. A non-transitory computer readable storage medium having stored thereon an integrated circuit definition dataset that, when processed in an integrated circuit manufacturing system, configures the integrated circuit manufacturing system to manufacture a graphics processing system as set forth in claim 17 .

Assignments (2)
SECURITY INTEREST Recorded Jul 31, 2024
From: IMAGINATION TECHNOLOGIES LIMITED
To: FORTRESS INVESTMENT GROUP (UK) LTD
Reel/Frame 068221/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 7, 2023
From: LIVESLEY, MICHAEL JOHN
To: IMAGINATION TECHNOLOGIES LIMITED
Reel/Frame 065488/0011 →
Priority Claims (1)
GB 2204511 · Mar 30, 2022 · national
Continuity (1)
Related Publication 20230333895A1 · Oct 19, 2023