numa_memory_policy.txt 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471
  1. What is Linux Memory Policy?
  2. In the Linux kernel, "memory policy" determines from which node the kernel will
  3. allocate memory in a NUMA system or in an emulated NUMA system. Linux has
  4. supported platforms with Non-Uniform Memory Access architectures since 2.4.?.
  5. The current memory policy support was added to Linux 2.6 around May 2004. This
  6. document attempts to describe the concepts and APIs of the 2.6 memory policy
  7. support.
  8. Memory policies should not be confused with cpusets (Documentation/cpusets.txt)
  9. which is an administrative mechanism for restricting the nodes from which
  10. memory may be allocated by a set of processes. Memory policies are a
  11. programming interface that a NUMA-aware application can take advantage of. When
  12. both cpusets and policies are applied to a task, the restrictions of the cpuset
  13. takes priority. See "MEMORY POLICIES AND CPUSETS" below for more details.
  14. MEMORY POLICY CONCEPTS
  15. Scope of Memory Policies
  16. The Linux kernel supports _scopes_ of memory policy, described here from
  17. most general to most specific:
  18. System Default Policy: this policy is "hard coded" into the kernel. It
  19. is the policy that governs all page allocations that aren't controlled
  20. by one of the more specific policy scopes discussed below. When the
  21. system is "up and running", the system default policy will use "local
  22. allocation" described below. However, during boot up, the system
  23. default policy will be set to interleave allocations across all nodes
  24. with "sufficient" memory, so as not to overload the initial boot node
  25. with boot-time allocations.
  26. Task/Process Policy: this is an optional, per-task policy. When defined
  27. for a specific task, this policy controls all page allocations made by or
  28. on behalf of the task that aren't controlled by a more specific scope.
  29. If a task does not define a task policy, then all page allocations that
  30. would have been controlled by the task policy "fall back" to the System
  31. Default Policy.
  32. The task policy applies to the entire address space of a task. Thus,
  33. it is inheritable, and indeed is inherited, across both fork()
  34. [clone() w/o the CLONE_VM flag] and exec*(). This allows a parent task
  35. to establish the task policy for a child task exec()'d from an
  36. executable image that has no awareness of memory policy. See the
  37. MEMORY POLICY APIS section, below, for an overview of the system call
  38. that a task may use to set/change it's task/process policy.
  39. In a multi-threaded task, task policies apply only to the thread
  40. [Linux kernel task] that installs the policy and any threads
  41. subsequently created by that thread. Any sibling threads existing
  42. at the time a new task policy is installed retain their current
  43. policy.
  44. A task policy applies only to pages allocated after the policy is
  45. installed. Any pages already faulted in by the task when the task
  46. changes its task policy remain where they were allocated based on
  47. the policy at the time they were allocated.
  48. VMA Policy: A "VMA" or "Virtual Memory Area" refers to a range of a task's
  49. virtual adddress space. A task may define a specific policy for a range
  50. of its virtual address space. See the MEMORY POLICIES APIS section,
  51. below, for an overview of the mbind() system call used to set a VMA
  52. policy.
  53. A VMA policy will govern the allocation of pages that back this region of
  54. the address space. Any regions of the task's address space that don't
  55. have an explicit VMA policy will fall back to the task policy, which may
  56. itself fall back to the System Default Policy.
  57. VMA policies have a few complicating details:
  58. VMA policy applies ONLY to anonymous pages. These include pages
  59. allocated for anonymous segments, such as the task stack and heap, and
  60. any regions of the address space mmap()ed with the MAP_ANONYMOUS flag.
  61. If a VMA policy is applied to a file mapping, it will be ignored if
  62. the mapping used the MAP_SHARED flag. If the file mapping used the
  63. MAP_PRIVATE flag, the VMA policy will only be applied when an
  64. anonymous page is allocated on an attempt to write to the mapping--
  65. i.e., at Copy-On-Write.
  66. VMA policies are shared between all tasks that share a virtual address
  67. space--a.k.a. threads--independent of when the policy is installed; and
  68. they are inherited across fork(). However, because VMA policies refer
  69. to a specific region of a task's address space, and because the address
  70. space is discarded and recreated on exec*(), VMA policies are NOT
  71. inheritable across exec(). Thus, only NUMA-aware applications may
  72. use VMA policies.
  73. A task may install a new VMA policy on a sub-range of a previously
  74. mmap()ed region. When this happens, Linux splits the existing virtual
  75. memory area into 2 or 3 VMAs, each with it's own policy.
  76. By default, VMA policy applies only to pages allocated after the policy
  77. is installed. Any pages already faulted into the VMA range remain
  78. where they were allocated based on the policy at the time they were
  79. allocated. However, since 2.6.16, Linux supports page migration via
  80. the mbind() system call, so that page contents can be moved to match
  81. a newly installed policy.
  82. Shared Policy: Conceptually, shared policies apply to "memory objects"
  83. mapped shared into one or more tasks' distinct address spaces. An
  84. application installs a shared policies the same way as VMA policies--using
  85. the mbind() system call specifying a range of virtual addresses that map
  86. the shared object. However, unlike VMA policies, which can be considered
  87. to be an attribute of a range of a task's address space, shared policies
  88. apply directly to the shared object. Thus, all tasks that attach to the
  89. object share the policy, and all pages allocated for the shared object,
  90. by any task, will obey the shared policy.
  91. As of 2.6.22, only shared memory segments, created by shmget() or
  92. mmap(MAP_ANONYMOUS|MAP_SHARED), support shared policy. When shared
  93. policy support was added to Linux, the associated data structures were
  94. added to hugetlbfs shmem segments. At the time, hugetlbfs did not
  95. support allocation at fault time--a.k.a lazy allocation--so hugetlbfs
  96. shmem segments were never "hooked up" to the shared policy support.
  97. Although hugetlbfs segments now support lazy allocation, their support
  98. for shared policy has not been completed.
  99. As mentioned above [re: VMA policies], allocations of page cache
  100. pages for regular files mmap()ed with MAP_SHARED ignore any VMA
  101. policy installed on the virtual address range backed by the shared
  102. file mapping. Rather, shared page cache pages, including pages backing
  103. private mappings that have not yet been written by the task, follow
  104. task policy, if any, else System Default Policy.
  105. The shared policy infrastructure supports different policies on subset
  106. ranges of the shared object. However, Linux still splits the VMA of
  107. the task that installs the policy for each range of distinct policy.
  108. Thus, different tasks that attach to a shared memory segment can have
  109. different VMA configurations mapping that one shared object. This
  110. can be seen by examining the /proc/<pid>/numa_maps of tasks sharing
  111. a shared memory region, when one task has installed shared policy on
  112. one or more ranges of the region.
  113. Components of Memory Policies
  114. A Linux memory policy consists of a "mode", optional mode flags, and an
  115. optional set of nodes. The mode determines the behavior of the policy,
  116. the optional mode flags determine the behavior of the mode, and the
  117. optional set of nodes can be viewed as the arguments to the policy
  118. behavior.
  119. Internally, memory policies are implemented by a reference counted
  120. structure, struct mempolicy. Details of this structure will be discussed
  121. in context, below, as required to explain the behavior.
  122. Linux memory policy supports the following 4 behavioral modes:
  123. Default Mode--MPOL_DEFAULT: The behavior specified by this mode is
  124. context or scope dependent.
  125. As mentioned in the Policy Scope section above, during normal
  126. system operation, the System Default Policy is hard coded to
  127. contain the Default mode.
  128. In this context, default mode means "local" allocation--that is
  129. attempt to allocate the page from the node associated with the cpu
  130. where the fault occurs. If the "local" node has no memory, or the
  131. node's memory can be exhausted [no free pages available], local
  132. allocation will "fallback to"--attempt to allocate pages from--
  133. "nearby" nodes, in order of increasing "distance".
  134. Implementation detail -- subject to change: "Fallback" uses
  135. a per node list of sibling nodes--called zonelists--built at
  136. boot time, or when nodes or memory are added or removed from
  137. the system [memory hotplug]. These per node zonelist are
  138. constructed with nodes in order of increasing distance based
  139. on information provided by the platform firmware.
  140. When a task/process policy or a shared policy contains the Default
  141. mode, this also means "local allocation", as described above.
  142. In the context of a VMA, Default mode means "fall back to task
  143. policy"--which may or may not specify Default mode. Thus, Default
  144. mode can not be counted on to mean local allocation when used
  145. on a non-shared region of the address space. However, see
  146. MPOL_PREFERRED below.
  147. It is an error for the set of nodes specified for this policy to
  148. be non-empty.
  149. MPOL_BIND: This mode specifies that memory must come from the
  150. set of nodes specified by the policy. Memory will be allocated from
  151. the node in the set with sufficient free memory that is closest to
  152. the node where the allocation takes place.
  153. MPOL_PREFERRED: This mode specifies that the allocation should be
  154. attempted from the single node specified in the policy. If that
  155. allocation fails, the kernel will search other nodes, exactly as
  156. it would for a local allocation that started at the preferred node
  157. in increasing distance from the preferred node. "Local" allocation
  158. policy can be viewed as a Preferred policy that starts at the node
  159. containing the cpu where the allocation takes place.
  160. Internally, the Preferred policy uses a single node--the
  161. preferred_node member of struct mempolicy. A "distinguished
  162. value of this preferred_node, currently '-1', is interpreted
  163. as "the node containing the cpu where the allocation takes
  164. place"--local allocation. This is the way to specify
  165. local allocation for a specific range of addresses--i.e. for
  166. VMA policies.
  167. It is possible for the user to specify that local allocation is
  168. always preferred by passing an empty nodemask with this mode.
  169. If an empty nodemask is passed, the policy cannot use the
  170. MPOL_F_STATIC_NODES or MPOL_F_RELATIVE_NODES flags described
  171. below.
  172. MPOL_INTERLEAVED: This mode specifies that page allocations be
  173. interleaved, on a page granularity, across the nodes specified in
  174. the policy. This mode also behaves slightly differently, based on
  175. the context where it is used:
  176. For allocation of anonymous pages and shared memory pages,
  177. Interleave mode indexes the set of nodes specified by the policy
  178. using the page offset of the faulting address into the segment
  179. [VMA] containing the address modulo the number of nodes specified
  180. by the policy. It then attempts to allocate a page, starting at
  181. the selected node, as if the node had been specified by a Preferred
  182. policy or had been selected by a local allocation. That is,
  183. allocation will follow the per node zonelist.
  184. For allocation of page cache pages, Interleave mode indexes the set
  185. of nodes specified by the policy using a node counter maintained
  186. per task. This counter wraps around to the lowest specified node
  187. after it reaches the highest specified node. This will tend to
  188. spread the pages out over the nodes specified by the policy based
  189. on the order in which they are allocated, rather than based on any
  190. page offset into an address range or file. During system boot up,
  191. the temporary interleaved system default policy works in this
  192. mode.
  193. Linux memory policy supports the following optional mode flags:
  194. MPOL_F_STATIC_NODES: This flag specifies that the nodemask passed by
  195. the user should not be remapped if the task or VMA's set of allowed
  196. nodes changes after the memory policy has been defined.
  197. Without this flag, anytime a mempolicy is rebound because of a
  198. change in the set of allowed nodes, the node (Preferred) or
  199. nodemask (Bind, Interleave) is remapped to the new set of
  200. allowed nodes. This may result in nodes being used that were
  201. previously undesired.
  202. With this flag, if the user-specified nodes overlap with the
  203. nodes allowed by the task's cpuset, then the memory policy is
  204. applied to their intersection. If the two sets of nodes do not
  205. overlap, the Default policy is used.
  206. For example, consider a task that is attached to a cpuset with
  207. mems 1-3 that sets an Interleave policy over the same set. If
  208. the cpuset's mems change to 3-5, the Interleave will now occur
  209. over nodes 3, 4, and 5. With this flag, however, since only node
  210. 3 is allowed from the user's nodemask, the "interleave" only
  211. occurs over that node. If no nodes from the user's nodemask are
  212. now allowed, the Default behavior is used.
  213. MPOL_F_STATIC_NODES cannot be combined with the
  214. MPOL_F_RELATIVE_NODES flag. It also cannot be used for
  215. MPOL_PREFERRED policies that were created with an empty nodemask
  216. (local allocation).
  217. MPOL_F_RELATIVE_NODES: This flag specifies that the nodemask passed
  218. by the user will be mapped relative to the set of the task or VMA's
  219. set of allowed nodes. The kernel stores the user-passed nodemask,
  220. and if the allowed nodes changes, then that original nodemask will
  221. be remapped relative to the new set of allowed nodes.
  222. Without this flag (and without MPOL_F_STATIC_NODES), anytime a
  223. mempolicy is rebound because of a change in the set of allowed
  224. nodes, the node (Preferred) or nodemask (Bind, Interleave) is
  225. remapped to the new set of allowed nodes. That remap may not
  226. preserve the relative nature of the user's passed nodemask to its
  227. set of allowed nodes upon successive rebinds: a nodemask of
  228. 1,3,5 may be remapped to 7-9 and then to 1-3 if the set of
  229. allowed nodes is restored to its original state.
  230. With this flag, the remap is done so that the node numbers from
  231. the user's passed nodemask are relative to the set of allowed
  232. nodes. In other words, if nodes 0, 2, and 4 are set in the user's
  233. nodemask, the policy will be effected over the first (and in the
  234. Bind or Interleave case, the third and fifth) nodes in the set of
  235. allowed nodes. The nodemask passed by the user represents nodes
  236. relative to task or VMA's set of allowed nodes.
  237. If the user's nodemask includes nodes that are outside the range
  238. of the new set of allowed nodes (for example, node 5 is set in
  239. the user's nodemask when the set of allowed nodes is only 0-3),
  240. then the remap wraps around to the beginning of the nodemask and,
  241. if not already set, sets the node in the mempolicy nodemask.
  242. For example, consider a task that is attached to a cpuset with
  243. mems 2-5 that sets an Interleave policy over the same set with
  244. MPOL_F_RELATIVE_NODES. If the cpuset's mems change to 3-7, the
  245. interleave now occurs over nodes 3,5-6. If the cpuset's mems
  246. then change to 0,2-3,5, then the interleave occurs over nodes
  247. 0,3,5.
  248. Thanks to the consistent remapping, applications preparing
  249. nodemasks to specify memory policies using this flag should
  250. disregard their current, actual cpuset imposed memory placement
  251. and prepare the nodemask as if they were always located on
  252. memory nodes 0 to N-1, where N is the number of memory nodes the
  253. policy is intended to manage. Let the kernel then remap to the
  254. set of memory nodes allowed by the task's cpuset, as that may
  255. change over time.
  256. MPOL_F_RELATIVE_NODES cannot be combined with the
  257. MPOL_F_STATIC_NODES flag. It also cannot be used for
  258. MPOL_PREFERRED policies that were created with an empty nodemask
  259. (local allocation).
  260. MEMORY POLICY REFERENCE COUNTING
  261. To resolve use/free races, struct mempolicy contains an atomic reference
  262. count field. Internal interfaces, mpol_get()/mpol_put() increment and
  263. decrement this reference count, respectively. mpol_put() will only free
  264. the structure back to the mempolicy kmem cache when the reference count
  265. goes to zero.
  266. When a new memory policy is allocated, it's reference count is initialized
  267. to '1', representing the reference held by the task that is installing the
  268. new policy. When a pointer to a memory policy structure is stored in another
  269. structure, another reference is added, as the task's reference will be dropped
  270. on completion of the policy installation.
  271. During run-time "usage" of the policy, we attempt to minimize atomic operations
  272. on the reference count, as this can lead to cache lines bouncing between cpus
  273. and NUMA nodes. "Usage" here means one of the following:
  274. 1) querying of the policy, either by the task itself [using the get_mempolicy()
  275. API discussed below] or by another task using the /proc/<pid>/numa_maps
  276. interface.
  277. 2) examination of the policy to determine the policy mode and associated node
  278. or node lists, if any, for page allocation. This is considered a "hot
  279. path". Note that for MPOL_BIND, the "usage" extends across the entire
  280. allocation process, which may sleep during page reclaimation, because the
  281. BIND policy nodemask is used, by reference, to filter ineligible nodes.
  282. We can avoid taking an extra reference during the usages listed above as
  283. follows:
  284. 1) we never need to get/free the system default policy as this is never
  285. changed nor freed, once the system is up and running.
  286. 2) for querying the policy, we do not need to take an extra reference on the
  287. target task's task policy nor vma policies because we always acquire the
  288. task's mm's mmap_sem for read during the query. The set_mempolicy() and
  289. mbind() APIs [see below] always acquire the mmap_sem for write when
  290. installing or replacing task or vma policies. Thus, there is no possibility
  291. of a task or thread freeing a policy while another task or thread is
  292. querying it.
  293. 3) Page allocation usage of task or vma policy occurs in the fault path where
  294. we hold them mmap_sem for read. Again, because replacing the task or vma
  295. policy requires that the mmap_sem be held for write, the policy can't be
  296. freed out from under us while we're using it for page allocation.
  297. 4) Shared policies require special consideration. One task can replace a
  298. shared memory policy while another task, with a distinct mmap_sem, is
  299. querying or allocating a page based on the policy. To resolve this
  300. potential race, the shared policy infrastructure adds an extra reference
  301. to the shared policy during lookup while holding a spin lock on the shared
  302. policy management structure. This requires that we drop this extra
  303. reference when we're finished "using" the policy. We must drop the
  304. extra reference on shared policies in the same query/allocation paths
  305. used for non-shared policies. For this reason, shared policies are marked
  306. as such, and the extra reference is dropped "conditionally"--i.e., only
  307. for shared policies.
  308. Because of this extra reference counting, and because we must lookup
  309. shared policies in a tree structure under spinlock, shared policies are
  310. more expensive to use in the page allocation path. This is expecially
  311. true for shared policies on shared memory regions shared by tasks running
  312. on different NUMA nodes. This extra overhead can be avoided by always
  313. falling back to task or system default policy for shared memory regions,
  314. or by prefaulting the entire shared memory region into memory and locking
  315. it down. However, this might not be appropriate for all applications.
  316. MEMORY POLICY APIs
  317. Linux supports 3 system calls for controlling memory policy. These APIS
  318. always affect only the calling task, the calling task's address space, or
  319. some shared object mapped into the calling task's address space.
  320. Note: the headers that define these APIs and the parameter data types
  321. for user space applications reside in a package that is not part of
  322. the Linux kernel. The kernel system call interfaces, with the 'sys_'
  323. prefix, are defined in <linux/syscalls.h>; the mode and flag
  324. definitions are defined in <linux/mempolicy.h>.
  325. Set [Task] Memory Policy:
  326. long set_mempolicy(int mode, const unsigned long *nmask,
  327. unsigned long maxnode);
  328. Set's the calling task's "task/process memory policy" to mode
  329. specified by the 'mode' argument and the set of nodes defined
  330. by 'nmask'. 'nmask' points to a bit mask of node ids containing
  331. at least 'maxnode' ids. Optional mode flags may be passed by
  332. combining the 'mode' argument with the flag (for example:
  333. MPOL_INTERLEAVE | MPOL_F_STATIC_NODES).
  334. See the set_mempolicy(2) man page for more details
  335. Get [Task] Memory Policy or Related Information
  336. long get_mempolicy(int *mode,
  337. const unsigned long *nmask, unsigned long maxnode,
  338. void *addr, int flags);
  339. Queries the "task/process memory policy" of the calling task, or
  340. the policy or location of a specified virtual address, depending
  341. on the 'flags' argument.
  342. See the get_mempolicy(2) man page for more details
  343. Install VMA/Shared Policy for a Range of Task's Address Space
  344. long mbind(void *start, unsigned long len, int mode,
  345. const unsigned long *nmask, unsigned long maxnode,
  346. unsigned flags);
  347. mbind() installs the policy specified by (mode, nmask, maxnodes) as
  348. a VMA policy for the range of the calling task's address space
  349. specified by the 'start' and 'len' arguments. Additional actions
  350. may be requested via the 'flags' argument.
  351. See the mbind(2) man page for more details.
  352. MEMORY POLICY COMMAND LINE INTERFACE
  353. Although not strictly part of the Linux implementation of memory policy,
  354. a command line tool, numactl(8), exists that allows one to:
  355. + set the task policy for a specified program via set_mempolicy(2), fork(2) and
  356. exec(2)
  357. + set the shared policy for a shared memory segment via mbind(2)
  358. The numactl(8) tool is packages with the run-time version of the library
  359. containing the memory policy system call wrappers. Some distributions
  360. package the headers and compile-time libraries in a separate development
  361. package.
  362. MEMORY POLICIES AND CPUSETS
  363. Memory policies work within cpusets as described above. For memory policies
  364. that require a node or set of nodes, the nodes are restricted to the set of
  365. nodes whose memories are allowed by the cpuset constraints. If the nodemask
  366. specified for the policy contains nodes that are not allowed by the cpuset and
  367. MPOL_F_RELATIVE_NODES is not used, the intersection of the set of nodes
  368. specified for the policy and the set of nodes with memory is used. If the
  369. result is the empty set, the policy is considered invalid and cannot be
  370. installed. If MPOL_F_RELATIVE_NODES is used, the policy's nodes are mapped
  371. onto and folded into the task's set of allowed nodes as previously described.
  372. The interaction of memory policies and cpusets can be problematic when tasks
  373. in two cpusets share access to a memory region, such as shared memory segments
  374. created by shmget() of mmap() with the MAP_ANONYMOUS and MAP_SHARED flags, and
  375. any of the tasks install shared policy on the region, only nodes whose
  376. memories are allowed in both cpusets may be used in the policies. Obtaining
  377. this information requires "stepping outside" the memory policy APIs to use the
  378. cpuset information and requires that one know in what cpusets other task might
  379. be attaching to the shared region. Furthermore, if the cpusets' allowed
  380. memory sets are disjoint, "local" allocation is the only valid policy.