Random access memory and corresponding method for managing a random access memory
US-2024404613-A1 · Dec 5, 2024 · US
US9715350B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9715350-B2 |
| Application number | US-201615252414-A |
| Country | US |
| Kind code | B2 |
| Filing date | Aug 31, 2016 |
| Priority date | Jun 11, 2015 |
| Publication date | Jul 25, 2017 |
| Grant date | Jul 25, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
In one embodiment, a computer-implemented method includes receiving a large frame area (LFAREA) request, including a request for a plurality of page frame table entries (PFTEs) to back a plurality of frames in an LFAREA of main memory. Each of the plurality of frames has one of a first size and a second size, where the second size is larger than the first size. The method further includes counting how many frames in the main memory have yet to be initialized and have one of the first size and the second size. A size needed for the plurality of PFTEs is calculated, based at least in part on the counting. A storage area is reserved for the plurality of PFTEs, by a computer processor, where a size of the storage area is the size calculated based at least in part on the counting.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method, comprising: receiving a large frame area (LFAREA) request, comprising a request for a plurality of page frame table entries (PFTEs) to back a plurality of frames in an LFAREA of main memory, wherein each of the plurality of frames has one of a first size and a second size, the second size being larger than the first size; determining available main memory by counting how many frames in the main memory have yet to be initialized and have one of the first size and the second size; calculating an actual size of a reserved PFTE area (RPA) to store the plurality of PFTEs, based at least in part on the counting, wherein the calculating the size needed for the RPA comprises: receiving, in the LFAREA request, bounds for the size of the LFAREA; calculating a maximum size of the LFAREA based on the bounds; calculating a maximum size of the RPA, based on the maximum size of the LFAREA; determining that the maximum size of the LFAREA plus the maximum size of the RPA is greater than the available main memory determined by the counting; determining the actual size of the LFAREA, wherein the actual size of the LFAREA is based on the counting, responsive to the maximum size of the LFAREA plus the maximum size of the RPA being greater than the available main memory; and calculating the actual size of the RPA based on the actual size of the LFAREA; and building, by a computer processor, the RPA with the actual size of the RPA by storing the plurality of PFTEs in the RPA.
Free address space management · CPC title
Bootstrapping (security arrangements therefor G06F21/57) · CPC title
using page tables, e.g. page table structures · CPC title
Improving or facilitating administration, e.g. storage management · CPC title
for multiple virtual address spaces, e.g. segmentation (G06F12/1045 takes precedence) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.