Off-line affinity-aware parallel zeroing of memory in non-uniform memory access (NUMA) servers

Patent metadata

Field	Value
Publication number	US-10248175-B2
Application number	US-201815865506-A
Country	US
Kind code	B2
Filing date	Jan 9, 2018
Priority date	Jun 25, 2015
Publication date	Apr 2, 2019
Grant date	Apr 2, 2019

Abstract

A method for zeroing memory in computing systems where access to memory is non-uniform includes receiving, via a system call, a request to delete a memory region, forwarding the request to an intermediate software thread, and using the intermediate software thread to perform the request as a background process. The method further includes, upon receiving a message from the intermediate software thread, returning to a system caller, while performing the request, via the intermediate software thread, continues in the background.

First claim

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;
forwarding the request to an intermediate software thread;
using the intermediate software thread to perform the request as a background process, comprising:
sorting one or more pages of the memory region according to each associated affinity domain of each page, 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 additional software threads that are attached to the respective affinity domain; and
receiving, from each of the one or more additional software threads, notifications that the requests to zero the sorted one or more pages have been processed; and

upon receiving a message from the intermediate software thread, returning to a system caller, while performing the request, via the intermediate software thread, continues in the background.

2. The method of claim 1 , wherein the message from the intermediate software thread indicates that a count of an amount of memory pending free has been updated.

3. The method of claim 2 , further comprising:
receiving, from a process, a request for a page of memory, wherein a size of the requested page is above a predetermined threshold;
determining that an amount of available memory is lower than the size of the requested page; and
transmitting an indication of the amount of memory pending free to the process, wherein the process determines whether to wait for the request to be granted, based at least in part, on the indicated amount of memory pending free.

4. The method of claim 1 , further comprising executing another process while pages of the memory region are zeroed in the background.

5. The method of claim 1 , wherein the one or more additional software threads zero the sorted one or more pages in parallel.

6. A system, comprising:
a processor; and
a memory containing a program which, when executed on the processor, performs an operation for zeroing pages of memory in a computing system where access to memory is non-uniform, the operation comprising:
receiving, via a system call, a request to delete a memory region;
forwarding the request to an intermediate software thread;
using the intermediate software thread to perform the request as a background process, comprising:
sorting one or more pages of the memory region according to each associated affinity domain of each page, 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 additional software threads that are attached to the respective affinity domain; and
receiving, from each of the one or more additional software threads, notifications that the requests to zero the sorted one or more pages have been processed; and

upon receiving a message from the intermediate software thread, returning to a system caller, while performing the request, via the intermediate software thread, continues in the background.

7. The system of claim 6 , wherein the message from the intermediate software thread indicates that a count of an amount of memory pending free has been updated.

8. The system of claim 7 , wherein the operation further comprises:
receiving, from a process, a request for a page of memory, wherein a size of the requested page is above a predetermined threshold;
determining that an amount of available memory is lower than the size of the requested page; and
transmitting an indication of the amount of memory pending free to the process, wherein the process determines whether to wait for the request to be granted, based at least in part, on the indicated amount of memory pending free.

9. The system of claim 6 , wherein the operation further comprises executing another process while pages of the memory region are zeroed in the background.

10. The system of claim 6 , wherein the one or more additional software threads zero the sorted one or more pages in parallel.

11. A non-transitory computer-readable storage medium storing instructions, which, when executed on a processor, perform an operation for zeroing pages of memory in a computing system where access to memory is non-uniform, the operation comprising:
receiving, via a system call, a request to delete a memory region;
forwarding the request to an intermediate software thread;
using the intermediate software thread to perform the request as a background process, comprising:
sorting one or more pages of the memory region according to each associated affinity domain of each page, 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 additional software threads that are attached to the respective affinity domain; and
receiving, from each of the one or more additional software threads, notifications that the requests to zero the sorted one or more pages have been processed; and

upon receiving a message from the intermediate software thread, returning to a system caller, while performing the request, via the intermediate software thread, continues in the background.

12. The non-transitory computer-readable storage medium of claim 11 , wherein the message from the intermediate software thread indicates that a count of an amount of memory pending free has been updated.

13. The non-transitory computer-readable storage medium of claim 12 , wherein the operation further comprises:
receiving, from a process, a request for a page of memory, wherein a size of the requested page is above a predetermined threshold;
determining that an amount of available memory is lower than the size of the requested page; and
transmitting an indication of the amount of memory pending free to the process, wherein the process determines whether to wait for the request to be granted, based at least in part, on the indicated amount of memory pending free.

14. The non-transitory computer-readable storage medium of claim 11 , wherein the operation further comprises executing another process while pages of the memory region are zeroed in the background.

15. The non-transitory computer-readable storage medium of claim 11 , wherein the one or more additional software threads zero the sorted one or more pages in parallel.

Assignees

• IBM

Inventors

• Hegde Nikhil
• Rogers Mark
• Mealey Bruce

Classifications

• G06F3/0602

  specifically adapted to achieve a particular effect · CPC title

• G06F3/0629

  Configuration or reconfiguration of storage systems · CPC title

• G06F12/1009 Primary

  using page tables, e.g. page table structures · CPC title

• G06F3/067

  Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS] · CPC title

• G06F12/023

  Free address space management · CPC title