Techniques for interleaving surfaces

US9355430B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9355430-B2
Application numberUS-201314033389-A
CountryUS
Kind codeB2
Filing dateSep 20, 2013
Priority dateSep 20, 2013
Publication dateMay 31, 2016
Grant dateMay 31, 2016

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

One embodiment sets forth a method for allocating memory to surfaces. A software application specifies surface data, including interleaving state data. Based on the interleaving state data, a surface access unit bloats addressees derived from discrete coordinates associated with the surface, creating a bloated virtual address space with a predictable pattern of addresses that do not correspond to data. Advantageously, by creating predictable regions of addresses that do not correspond to data, the software application program may configure the surface to share physical memory space with one or more other surfaces. In particular, the software application may map the virtual address space together with one or more virtual address spaces corresponding to complementary data patterns to the same physical base address. And, by overlapping the virtual address spaces onto the same pages in physical address space, the physical memory may be more densely packed than by using prior-art allocation techniques.

First claim

Opening claim text (preview).

What is claimed is: 1. A method for allocating memory to surfaces, the method comprising: receiving first surface data related to a first surface; receiving first surface interleaving state data related to the first surface; computing a first bloat based on the first surface interleaving state data; mapping the first surface data to a first surface virtual address space based on the first bloat; and mapping one or more pages included in the first surface virtual address space to a physical address space. 2. The method of claim 1 , wherein the first surface interleaving state data specifies a location and a value of one or more interleaving bits with respect to a first coordinate associated with the first surface data and a second surface associated with the first surface data. 3. The method of claim 2 , wherein computing the first bloat comprises inserting the one or more interleaving bits into bits that represent coordinates associated with the first surface data. 4. The method of claim 1 , further comprising: receiving second surface data related to a second surface; receiving second surface interleaving state data related to the second surface; computing a second bloat based on the second surface interleaving state data; mapping the second surface data to a second surface virtual address space based on the second bloat; and mapping one or more pages included in the second surface virtual address space to the physical address space. 5. The method of claim 4 , wherein the first surface interleaving state data and the second surface interleaving state data specify that the first surface and the second surface map to the same base address in the physical address space. 6. The method of claim 5 , wherein the first surface data includes information related to a position in the first surface and the second surface data does not include information related to a corresponding position in the second surface. 7. The method of claim 5 , wherein the first surface and the second surface differ in at least one of shape and size. 8. The method of claim 1 , wherein the first surface comprises a texture. 9. The method of claim 8 , wherein the texture comprises a level of a mipmap. 10. A non-transitory computer-readable storage medium including instructions that, when executed by a processing unit, cause the processing unit to allocate memory to surfaces by performing the steps of: receiving first surface data related to a first surface; receiving first surface interleaving state data related to the first surface; computing a first bloat based on the first surface interleaving state data; mapping the first surface data to a first surface virtual address space based on the first bloat; and mapping one or more pages included in the first surface virtual address space to a physical address space. 11. The computer-readable storage medium of claim 10 , wherein the first surface interleaving state data specifies a location and a value of one or more interleaving bits with respect to a first coordinate associated with the first surface data and a second surface associated with the first surface data. 12. The computer-readable storage medium of claim 11 , wherein computing the first bloat comprises inserting the one or more interleaving bits into bits that represent coordinates associated with the first surface data. 13. The computer-readable storage medium of claim 10 , further comprising: receiving second surface data related to a second surface; receiving second surface interleaving state data related to the second surface; computing a second bloat based on the second surface interleaving state data; mapping the second surface data to a second surface virtual address space based on the second bloat; and mapping one or more pages included in the second surface virtual address space to the physical address space. 14. The computer-readable storage medium of claim 13 , wherein the first surface interleaving state data and the second surface interleaving state data specify that the first surface and the second surface map to the same base address in the physical address space. 15. The computer-readable storage medium of claim 14 , wherein the first surface data includes information related to a position in the first surface and the second surface data does not include information related to a corresponding position in the second surface. 16. The computer-readable storage medium of claim 14 , wherein the first surface and the second surface differ in at least one of shape and size. 17. The computer-readable storage medium of claim 10 , wherein the first surface comprises a texture. 18. The computer-readable storage medium of claim 17 , wherein the texture comprises a level of a mipmap. 19. A system configured to allocate memory to surfaces, the system comprising: a surface access unit configured to: receive first surface data related to a first surface, receive first surface interleaving state data related to the first surface, compute a first bloat based on the first surface interleaving state data, and map the first surface data to a first surface virtual address space based on the first bloat; and a memory management unit configured to: map one or more pages included in the first surface virtual address space to a physical address space. 20. The system of claim 19 , wherein the first surface interleaving state data specifies a location and a value of one or more interleaving bits with respect to a first coordinate associated with the first surface data and a second surface associated with the first surface data.

Assignees

Inventors

Classifications

  • G06T1/60Primary

    Memory management · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9355430B2 cover?
One embodiment sets forth a method for allocating memory to surfaces. A software application specifies surface data, including interleaving state data. Based on the interleaving state data, a surface access unit bloats addressees derived from discrete coordinates associated with the surface, creating a bloated virtual address space with a predictable pattern of addresses that do not correspond …
Who is the assignee on this patent?
Nvidia Corp
What technology area does this patent fall under?
Primary CPC classification G06T1/60. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue May 31 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).