Accelerating boot time zeroing of memory based on non-volatile memory (nvm) technology
US-2015378615-A1 · Dec 31, 2015 · US
US2016378399A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2016378399-A1 |
| Application number | US-201614987151-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jan 4, 2016 |
| Priority date | Jun 25, 2015 |
| Publication date | Dec 29, 2016 |
| Grant date | — |
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.
Embodiments disclosed herein generally relate to techniques for zeroing memory in computing systems where access to memory is non-uniform. One embodiment provides a method which includes receiving, via a system call, a request to delete a memory region. The method also includes sorting, after receiving the request, one or more pages of the memory region according to each of the one or more pages associated affinity domain. The method further includes sending requests to zero the sorted one or more pages to one or more zeroing threads that are attached to the respective affinity domain. The method further yet includes waiting, after sending the requests, to return to the system caller until a message is received, from the worker threads in each affinity domain, indicating that all the page zeroing requests have been processed.
Opening claim text (preview).
What is claimed is: 1 . A method for zeroing pages of memory in a computing system where access to memory is non-uniform, the method comprising: receiving, via a system call, a request to delete a memory region; sorting, after receiving the request, one or more pages of the memory region according to each of the one or more pages associated affinity domain, wherein each affinity domain comprises a cluster of processors and memory local to the cluster of processors; sending requests to zero the sorted one or more pages to one or more software threads that are attached to the respective affinity domain; and waiting, after sending the requests, to return to a system caller until a message is received, from the software threads in each affinity domain, indicating that all requests to zero have been processed. 2 . The method of claim 1 , wherein the local memory in each affinity domain has the same access characteristics for each of the processors in the cluster. 3 . The method of claim 1 , wherein, before receiving the request to delete the memory region, the method further comprises: analyzing a distribution of one or more processors and memory in the computing system; and identifying each affinity domain, based on the analysis. 4 . The method of claim 1 , wherein the one or more software threads zero the sorted one or more pages in parallel. 5 . The method of claim 1 , wherein sending the requests to zero the sorted one or more pages to the one or more software threads comprises sending the requests to zero to request queues in each affinity domain. 6 . The method of claim 3 , wherein analyzing the distribution of the one or more processors and memory in the computing system occurs upon at least one of the following: an addition of physical memory, removal of physical memory, addition of a processor, or removal of a processor.
Non-uniform memory access [NUMA] architecture · CPC title
Management of space entities, e.g. partitions, extents, pools · CPC title
Space efficiency improvement · CPC title
specifically adapted to achieve a particular effect · CPC title
Free address space management · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.