memory.txt 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453
  1. Memory Resource Controller
  2. NOTE: The Memory Resource Controller has been generically been referred
  3. to as the memory controller in this document. Do not confuse memory controller
  4. used here with the memory controller that is used in hardware.
  5. Salient features
  6. a. Enable control of Anonymous, Page Cache (mapped and unmapped) and
  7. Swap Cache memory pages.
  8. b. The infrastructure allows easy addition of other types of memory to control
  9. c. Provides *zero overhead* for non memory controller users
  10. d. Provides a double LRU: global memory pressure causes reclaim from the
  11. global LRU; a cgroup on hitting a limit, reclaims from the per
  12. cgroup LRU
  13. Benefits and Purpose of the memory controller
  14. The memory controller isolates the memory behaviour of a group of tasks
  15. from the rest of the system. The article on LWN [12] mentions some probable
  16. uses of the memory controller. The memory controller can be used to
  17. a. Isolate an application or a group of applications
  18. Memory hungry applications can be isolated and limited to a smaller
  19. amount of memory.
  20. b. Create a cgroup with limited amount of memory, this can be used
  21. as a good alternative to booting with mem=XXXX.
  22. c. Virtualization solutions can control the amount of memory they want
  23. to assign to a virtual machine instance.
  24. d. A CD/DVD burner could control the amount of memory used by the
  25. rest of the system to ensure that burning does not fail due to lack
  26. of available memory.
  27. e. There are several other use cases, find one or use the controller just
  28. for fun (to learn and hack on the VM subsystem).
  29. 1. History
  30. The memory controller has a long history. A request for comments for the memory
  31. controller was posted by Balbir Singh [1]. At the time the RFC was posted
  32. there were several implementations for memory control. The goal of the
  33. RFC was to build consensus and agreement for the minimal features required
  34. for memory control. The first RSS controller was posted by Balbir Singh[2]
  35. in Feb 2007. Pavel Emelianov [3][4][5] has since posted three versions of the
  36. RSS controller. At OLS, at the resource management BoF, everyone suggested
  37. that we handle both page cache and RSS together. Another request was raised
  38. to allow user space handling of OOM. The current memory controller is
  39. at version 6; it combines both mapped (RSS) and unmapped Page
  40. Cache Control [11].
  41. 2. Memory Control
  42. Memory is a unique resource in the sense that it is present in a limited
  43. amount. If a task requires a lot of CPU processing, the task can spread
  44. its processing over a period of hours, days, months or years, but with
  45. memory, the same physical memory needs to be reused to accomplish the task.
  46. The memory controller implementation has been divided into phases. These
  47. are:
  48. 1. Memory controller
  49. 2. mlock(2) controller
  50. 3. Kernel user memory accounting and slab control
  51. 4. user mappings length controller
  52. The memory controller is the first controller developed.
  53. 2.1. Design
  54. The core of the design is a counter called the res_counter. The res_counter
  55. tracks the current memory usage and limit of the group of processes associated
  56. with the controller. Each cgroup has a memory controller specific data
  57. structure (mem_cgroup) associated with it.
  58. 2.2. Accounting
  59. +--------------------+
  60. | mem_cgroup |
  61. | (res_counter) |
  62. +--------------------+
  63. / ^ \
  64. / | \
  65. +---------------+ | +---------------+
  66. | mm_struct | |.... | mm_struct |
  67. | | | | |
  68. +---------------+ | +---------------+
  69. |
  70. + --------------+
  71. |
  72. +---------------+ +------+--------+
  73. | page +----------> page_cgroup|
  74. | | | |
  75. +---------------+ +---------------+
  76. (Figure 1: Hierarchy of Accounting)
  77. Figure 1 shows the important aspects of the controller
  78. 1. Accounting happens per cgroup
  79. 2. Each mm_struct knows about which cgroup it belongs to
  80. 3. Each page has a pointer to the page_cgroup, which in turn knows the
  81. cgroup it belongs to
  82. The accounting is done as follows: mem_cgroup_charge() is invoked to setup
  83. the necessary data structures and check if the cgroup that is being charged
  84. is over its limit. If it is then reclaim is invoked on the cgroup.
  85. More details can be found in the reclaim section of this document.
  86. If everything goes well, a page meta-data-structure called page_cgroup is
  87. allocated and associated with the page. This routine also adds the page to
  88. the per cgroup LRU.
  89. 2.2.1 Accounting details
  90. All mapped anon pages (RSS) and cache pages (Page Cache) are accounted.
  91. (some pages which never be reclaimable and will not be on global LRU
  92. are not accounted. we just accounts pages under usual vm management.)
  93. RSS pages are accounted at page_fault unless they've already been accounted
  94. for earlier. A file page will be accounted for as Page Cache when it's
  95. inserted into inode (radix-tree). While it's mapped into the page tables of
  96. processes, duplicate accounting is carefully avoided.
  97. A RSS page is unaccounted when it's fully unmapped. A PageCache page is
  98. unaccounted when it's removed from radix-tree.
  99. At page migration, accounting information is kept.
  100. Note: we just account pages-on-lru because our purpose is to control amount
  101. of used pages. not-on-lru pages are tend to be out-of-control from vm view.
  102. 2.3 Shared Page Accounting
  103. Shared pages are accounted on the basis of the first touch approach. The
  104. cgroup that first touches a page is accounted for the page. The principle
  105. behind this approach is that a cgroup that aggressively uses a shared
  106. page will eventually get charged for it (once it is uncharged from
  107. the cgroup that brought it in -- this will happen on memory pressure).
  108. Exception: If CONFIG_CGROUP_CGROUP_MEM_RES_CTLR_SWAP is not used..
  109. When you do swapoff and make swapped-out pages of shmem(tmpfs) to
  110. be backed into memory in force, charges for pages are accounted against the
  111. caller of swapoff rather than the users of shmem.
  112. 2.4 Swap Extension (CONFIG_CGROUP_MEM_RES_CTLR_SWAP)
  113. Swap Extension allows you to record charge for swap. A swapped-in page is
  114. charged back to original page allocator if possible.
  115. When swap is accounted, following files are added.
  116. - memory.memsw.usage_in_bytes.
  117. - memory.memsw.limit_in_bytes.
  118. usage of mem+swap is limited by memsw.limit_in_bytes.
  119. * why 'mem+swap' rather than swap.
  120. The global LRU(kswapd) can swap out arbitrary pages. Swap-out means
  121. to move account from memory to swap...there is no change in usage of
  122. mem+swap. In other words, when we want to limit the usage of swap without
  123. affecting global LRU, mem+swap limit is better than just limiting swap from
  124. OS point of view.
  125. * What happens when a cgroup hits memory.memsw.limit_in_bytes
  126. When a cgroup his memory.memsw.limit_in_bytes, it's useless to do swap-out
  127. in this cgroup. Then, swap-out will not be done by cgroup routine and file
  128. caches are dropped. But as mentioned above, global LRU can do swapout memory
  129. from it for sanity of the system's memory management state. You can't forbid
  130. it by cgroup.
  131. 2.5 Reclaim
  132. Each cgroup maintains a per cgroup LRU that consists of an active
  133. and inactive list. When a cgroup goes over its limit, we first try
  134. to reclaim memory from the cgroup so as to make space for the new
  135. pages that the cgroup has touched. If the reclaim is unsuccessful,
  136. an OOM routine is invoked to select and kill the bulkiest task in the
  137. cgroup.
  138. The reclaim algorithm has not been modified for cgroups, except that
  139. pages that are selected for reclaiming come from the per cgroup LRU
  140. list.
  141. NOTE: Reclaim does not work for the root cgroup, since we cannot set any
  142. limits on the root cgroup.
  143. 2. Locking
  144. The memory controller uses the following hierarchy
  145. 1. zone->lru_lock is used for selecting pages to be isolated
  146. 2. mem->per_zone->lru_lock protects the per cgroup LRU (per zone)
  147. 3. lock_page_cgroup() is used to protect page->page_cgroup
  148. 3. User Interface
  149. 0. Configuration
  150. a. Enable CONFIG_CGROUPS
  151. b. Enable CONFIG_RESOURCE_COUNTERS
  152. c. Enable CONFIG_CGROUP_MEM_RES_CTLR
  153. 1. Prepare the cgroups
  154. # mkdir -p /cgroups
  155. # mount -t cgroup none /cgroups -o memory
  156. 2. Make the new group and move bash into it
  157. # mkdir /cgroups/0
  158. # echo $$ > /cgroups/0/tasks
  159. Since now we're in the 0 cgroup,
  160. We can alter the memory limit:
  161. # echo 4M > /cgroups/0/memory.limit_in_bytes
  162. NOTE: We can use a suffix (k, K, m, M, g or G) to indicate values in kilo,
  163. mega or gigabytes.
  164. NOTE: We can write "-1" to reset the *.limit_in_bytes(unlimited).
  165. NOTE: We cannot set limits on the root cgroup any more.
  166. # cat /cgroups/0/memory.limit_in_bytes
  167. 4194304
  168. NOTE: The interface has now changed to display the usage in bytes
  169. instead of pages
  170. We can check the usage:
  171. # cat /cgroups/0/memory.usage_in_bytes
  172. 1216512
  173. A successful write to this file does not guarantee a successful set of
  174. this limit to the value written into the file. This can be due to a
  175. number of factors, such as rounding up to page boundaries or the total
  176. availability of memory on the system. The user is required to re-read
  177. this file after a write to guarantee the value committed by the kernel.
  178. # echo 1 > memory.limit_in_bytes
  179. # cat memory.limit_in_bytes
  180. 4096
  181. The memory.failcnt field gives the number of times that the cgroup limit was
  182. exceeded.
  183. The memory.stat file gives accounting information. Now, the number of
  184. caches, RSS and Active pages/Inactive pages are shown.
  185. 4. Testing
  186. Balbir posted lmbench, AIM9, LTP and vmmstress results [10] and [11].
  187. Apart from that v6 has been tested with several applications and regular
  188. daily use. The controller has also been tested on the PPC64, x86_64 and
  189. UML platforms.
  190. 4.1 Troubleshooting
  191. Sometimes a user might find that the application under a cgroup is
  192. terminated. There are several causes for this:
  193. 1. The cgroup limit is too low (just too low to do anything useful)
  194. 2. The user is using anonymous memory and swap is turned off or too low
  195. A sync followed by echo 1 > /proc/sys/vm/drop_caches will help get rid of
  196. some of the pages cached in the cgroup (page cache pages).
  197. 4.2 Task migration
  198. When a task migrates from one cgroup to another, it's charge is not
  199. carried forward. The pages allocated from the original cgroup still
  200. remain charged to it, the charge is dropped when the page is freed or
  201. reclaimed.
  202. 4.3 Removing a cgroup
  203. A cgroup can be removed by rmdir, but as discussed in sections 4.1 and 4.2, a
  204. cgroup might have some charge associated with it, even though all
  205. tasks have migrated away from it.
  206. Such charges are freed(at default) or moved to its parent. When moved,
  207. both of RSS and CACHES are moved to parent.
  208. If both of them are busy, rmdir() returns -EBUSY. See 5.1 Also.
  209. Charges recorded in swap information is not updated at removal of cgroup.
  210. Recorded information is discarded and a cgroup which uses swap (swapcache)
  211. will be charged as a new owner of it.
  212. 5. Misc. interfaces.
  213. 5.1 force_empty
  214. memory.force_empty interface is provided to make cgroup's memory usage empty.
  215. You can use this interface only when the cgroup has no tasks.
  216. When writing anything to this
  217. # echo 0 > memory.force_empty
  218. Almost all pages tracked by this memcg will be unmapped and freed. Some of
  219. pages cannot be freed because it's locked or in-use. Such pages are moved
  220. to parent and this cgroup will be empty. But this may return -EBUSY in
  221. some too busy case.
  222. Typical use case of this interface is that calling this before rmdir().
  223. Because rmdir() moves all pages to parent, some out-of-use page caches can be
  224. moved to the parent. If you want to avoid that, force_empty will be useful.
  225. 5.2 stat file
  226. memory.stat file includes following statistics
  227. cache - # of bytes of page cache memory.
  228. rss - # of bytes of anonymous and swap cache memory.
  229. pgpgin - # of pages paged in (equivalent to # of charging events).
  230. pgpgout - # of pages paged out (equivalent to # of uncharging events).
  231. active_anon - # of bytes of anonymous and swap cache memory on active
  232. lru list.
  233. inactive_anon - # of bytes of anonymous memory and swap cache memory on
  234. inactive lru list.
  235. active_file - # of bytes of file-backed memory on active lru list.
  236. inactive_file - # of bytes of file-backed memory on inactive lru list.
  237. unevictable - # of bytes of memory that cannot be reclaimed (mlocked etc).
  238. The following additional stats are dependent on CONFIG_DEBUG_VM.
  239. inactive_ratio - VM internal parameter. (see mm/page_alloc.c)
  240. recent_rotated_anon - VM internal parameter. (see mm/vmscan.c)
  241. recent_rotated_file - VM internal parameter. (see mm/vmscan.c)
  242. recent_scanned_anon - VM internal parameter. (see mm/vmscan.c)
  243. recent_scanned_file - VM internal parameter. (see mm/vmscan.c)
  244. Memo:
  245. recent_rotated means recent frequency of lru rotation.
  246. recent_scanned means recent # of scans to lru.
  247. showing for better debug please see the code for meanings.
  248. Note:
  249. Only anonymous and swap cache memory is listed as part of 'rss' stat.
  250. This should not be confused with the true 'resident set size' or the
  251. amount of physical memory used by the cgroup. Per-cgroup rss
  252. accounting is not done yet.
  253. 5.3 swappiness
  254. Similar to /proc/sys/vm/swappiness, but affecting a hierarchy of groups only.
  255. Following cgroups' swapiness can't be changed.
  256. - root cgroup (uses /proc/sys/vm/swappiness).
  257. - a cgroup which uses hierarchy and it has child cgroup.
  258. - a cgroup which uses hierarchy and not the root of hierarchy.
  259. 6. Hierarchy support
  260. The memory controller supports a deep hierarchy and hierarchical accounting.
  261. The hierarchy is created by creating the appropriate cgroups in the
  262. cgroup filesystem. Consider for example, the following cgroup filesystem
  263. hierarchy
  264. root
  265. / | \
  266. / | \
  267. a b c
  268. | \
  269. | \
  270. d e
  271. In the diagram above, with hierarchical accounting enabled, all memory
  272. usage of e, is accounted to its ancestors up until the root (i.e, c and root),
  273. that has memory.use_hierarchy enabled. If one of the ancestors goes over its
  274. limit, the reclaim algorithm reclaims from the tasks in the ancestor and the
  275. children of the ancestor.
  276. 6.1 Enabling hierarchical accounting and reclaim
  277. The memory controller by default disables the hierarchy feature. Support
  278. can be enabled by writing 1 to memory.use_hierarchy file of the root cgroup
  279. # echo 1 > memory.use_hierarchy
  280. The feature can be disabled by
  281. # echo 0 > memory.use_hierarchy
  282. NOTE1: Enabling/disabling will fail if the cgroup already has other
  283. cgroups created below it.
  284. NOTE2: This feature can be enabled/disabled per subtree.
  285. 7. Soft limits
  286. Soft limits allow for greater sharing of memory. The idea behind soft limits
  287. is to allow control groups to use as much of the memory as needed, provided
  288. a. There is no memory contention
  289. b. They do not exceed their hard limit
  290. When the system detects memory contention or low memory control groups
  291. are pushed back to their soft limits. If the soft limit of each control
  292. group is very high, they are pushed back as much as possible to make
  293. sure that one control group does not starve the others of memory.
  294. Please note that soft limits is a best effort feature, it comes with
  295. no guarantees, but it does its best to make sure that when memory is
  296. heavily contended for, memory is allocated based on the soft limit
  297. hints/setup. Currently soft limit based reclaim is setup such that
  298. it gets invoked from balance_pgdat (kswapd).
  299. 7.1 Interface
  300. Soft limits can be setup by using the following commands (in this example we
  301. assume a soft limit of 256 megabytes)
  302. # echo 256M > memory.soft_limit_in_bytes
  303. If we want to change this to 1G, we can at any time use
  304. # echo 1G > memory.soft_limit_in_bytes
  305. NOTE1: Soft limits take effect over a long period of time, since they involve
  306. reclaiming memory for balancing between memory cgroups
  307. NOTE2: It is recommended to set the soft limit always below the hard limit,
  308. otherwise the hard limit will take precedence.
  309. 8. TODO
  310. 1. Add support for accounting huge pages (as a separate controller)
  311. 2. Make per-cgroup scanner reclaim not-shared pages first
  312. 3. Teach controller to account for shared-pages
  313. 4. Start reclamation in the background when the limit is
  314. not yet hit but the usage is getting closer
  315. Summary
  316. Overall, the memory controller has been a stable controller and has been
  317. commented and discussed quite extensively in the community.
  318. References
  319. 1. Singh, Balbir. RFC: Memory Controller, http://lwn.net/Articles/206697/
  320. 2. Singh, Balbir. Memory Controller (RSS Control),
  321. http://lwn.net/Articles/222762/
  322. 3. Emelianov, Pavel. Resource controllers based on process cgroups
  323. http://lkml.org/lkml/2007/3/6/198
  324. 4. Emelianov, Pavel. RSS controller based on process cgroups (v2)
  325. http://lkml.org/lkml/2007/4/9/78
  326. 5. Emelianov, Pavel. RSS controller based on process cgroups (v3)
  327. http://lkml.org/lkml/2007/5/30/244
  328. 6. Menage, Paul. Control Groups v10, http://lwn.net/Articles/236032/
  329. 7. Vaidyanathan, Srinivasan, Control Groups: Pagecache accounting and control
  330. subsystem (v3), http://lwn.net/Articles/235534/
  331. 8. Singh, Balbir. RSS controller v2 test results (lmbench),
  332. http://lkml.org/lkml/2007/5/17/232
  333. 9. Singh, Balbir. RSS controller v2 AIM9 results
  334. http://lkml.org/lkml/2007/5/18/1
  335. 10. Singh, Balbir. Memory controller v6 test results,
  336. http://lkml.org/lkml/2007/8/19/36
  337. 11. Singh, Balbir. Memory controller introduction (v6),
  338. http://lkml.org/lkml/2007/8/17/69
  339. 12. Corbet, Jonathan, Controlling memory use in cgroups,
  340. http://lwn.net/Articles/243795/