page_migration.rst 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192
  1. ==============
  2. Page migration
  3. ==============
  4. Page migration allows moving the physical location of pages between
  5. nodes in a NUMA system while the process is running. This means that the
  6. virtual addresses that the process sees do not change. However, the
  7. system rearranges the physical location of those pages.
  8. Also see Documentation/mm/hmm.rst for migrating pages to or from device
  9. private memory.
  10. The main intent of page migration is to reduce the latency of memory accesses
  11. by moving pages near to the processor where the process accessing that memory
  12. is running.
  13. Page migration allows a process to manually relocate the node on which its
  14. pages are located through the MF_MOVE and MF_MOVE_ALL options while setting
  15. a new memory policy via mbind(). The pages of a process can also be relocated
  16. from another process using the sys_migrate_pages() function call. The
  17. migrate_pages() function call takes two sets of nodes and moves pages of a
  18. process that are located on the from nodes to the destination nodes.
  19. Page migration functions are provided by the numactl package by Andi Kleen
  20. (a version later than 0.9.3 is required. Get it from
  21. https://github.com/numactl/numactl.git). numactl provides libnuma
  22. which provides an interface similar to other NUMA functionality for page
  23. migration. cat ``/proc/<pid>/numa_maps`` allows an easy review of where the
  24. pages of a process are located. See also the numa_maps documentation in the
  25. proc(5) man page.
  26. Manual migration is useful if for example the scheduler has relocated
  27. a process to a processor on a distant node. A batch scheduler or an
  28. administrator may detect the situation and move the pages of the process
  29. nearer to the new processor. The kernel itself only provides
  30. manual page migration support. Automatic page migration may be implemented
  31. through user space processes that move pages. A special function call
  32. "move_pages" allows the moving of individual pages within a process.
  33. For example, A NUMA profiler may obtain a log showing frequent off-node
  34. accesses and may use the result to move pages to more advantageous
  35. locations.
  36. Larger installations usually partition the system using cpusets into
  37. sections of nodes. Paul Jackson has equipped cpusets with the ability to
  38. move pages when a task is moved to another cpuset (See
  39. :ref:`CPUSETS <cpusets>`).
  40. Cpusets allow the automation of process locality. If a task is moved to
  41. a new cpuset then also all its pages are moved with it so that the
  42. performance of the process does not sink dramatically. Also the pages
  43. of processes in a cpuset are moved if the allowed memory nodes of a
  44. cpuset are changed.
  45. Page migration allows the preservation of the relative location of pages
  46. within a group of nodes for all migration techniques which will preserve a
  47. particular memory allocation pattern generated even after migrating a
  48. process. This is necessary in order to preserve the memory latencies.
  49. Processes will run with similar performance after migration.
  50. Page migration occurs in several steps. First a high level
  51. description for those trying to use migrate_pages() from the kernel
  52. (for userspace usage see the Andi Kleen's numactl package mentioned above)
  53. and then a low level description of how the low level details work.
  54. In kernel use of migrate_pages()
  55. ================================
  56. 1. Remove folios from the LRU.
  57. Lists of folios to be migrated are generated by scanning over
  58. folios and moving them into lists. This is done by
  59. calling folio_isolate_lru().
  60. Calling folio_isolate_lru() increases the references to the folio
  61. so that it cannot vanish while the folio migration occurs.
  62. It also prevents the swapper or other scans from encountering
  63. the folio.
  64. 2. We need to have a function of type new_folio_t that can be
  65. passed to migrate_pages(). This function should figure out
  66. how to allocate the correct new folio given the old folio.
  67. 3. The migrate_pages() function is called which attempts
  68. to do the migration. It will call the function to allocate
  69. the new folio for each folio that is considered for moving.
  70. How migrate_pages() works
  71. =========================
  72. migrate_pages() does several passes over its list of folios. A folio is moved
  73. if all references to a folio are removable at the time. The folio has
  74. already been removed from the LRU via folio_isolate_lru() and the refcount
  75. is increased so that the folio cannot be freed while folio migration occurs.
  76. Steps:
  77. 1. Lock the page to be migrated.
  78. 2. Ensure that writeback is complete.
  79. 3. Lock the new page that we want to move to. It is locked so that accesses to
  80. this (not yet up-to-date) page immediately block while the move is in progress.
  81. 4. All the page table references to the page are converted to migration
  82. entries. This decreases the mapcount of a page. If the resulting
  83. mapcount is not zero then we do not migrate the page. All user space
  84. processes that attempt to access the page will now wait on the page lock
  85. or wait for the migration page table entry to be removed.
  86. 5. The i_pages lock is taken. This will cause all processes trying
  87. to access the page via the mapping to block on the spinlock.
  88. 6. The refcount of the page is examined and we back out if references remain.
  89. Otherwise, we know that we are the only one referencing this page.
  90. 7. The radix tree is checked and if it does not contain the pointer to this
  91. page then we back out because someone else modified the radix tree.
  92. 8. The new page is prepped with some settings from the old page so that
  93. accesses to the new page will discover a page with the correct settings.
  94. 9. The radix tree is changed to point to the new page.
  95. 10. The reference count of the old page is dropped because the address space
  96. reference is gone. A reference to the new page is established because
  97. the new page is referenced by the address space.
  98. 11. The i_pages lock is dropped. With that lookups in the mapping
  99. become possible again. Processes will move from spinning on the lock
  100. to sleeping on the locked new page.
  101. 12. The page contents are copied to the new page.
  102. 13. The remaining page flags are copied to the new page.
  103. 14. The old page flags are cleared to indicate that the page does
  104. not provide any information anymore.
  105. 15. Queued up writeback on the new page is triggered.
  106. 16. If migration entries were inserted into the page table, then replace them
  107. with real ptes. Doing so will enable access for user space processes not
  108. already waiting for the page lock.
  109. 17. The page locks are dropped from the old and new page.
  110. Processes waiting on the page lock will redo their page faults
  111. and will reach the new page.
  112. 18. The new page is moved to the LRU and can be scanned by the swapper,
  113. etc. again.
  114. Non-LRU page migration
  115. ======================
  116. Although migration originally aimed for reducing the latency of memory
  117. accesses for NUMA, compaction also uses migration to create high-order
  118. pages. For compaction purposes, it is also useful to be able to move
  119. non-LRU pages, such as zsmalloc and virtio-balloon pages.
  120. If a driver wants to make its pages movable, it should define a struct
  121. movable_operations. It then needs to call __SetPageMovable() on each
  122. page that it may be able to move. This uses the ``page->mapping`` field,
  123. so this field is not available for the driver to use for other purposes.
  124. Monitoring Migration
  125. =====================
  126. The following events (counters) can be used to monitor page migration.
  127. 1. PGMIGRATE_SUCCESS: Normal page migration success. Each count means that a
  128. page was migrated. If the page was a non-THP and non-hugetlb page, then
  129. this counter is increased by one. If the page was a THP or hugetlb, then
  130. this counter is increased by the number of THP or hugetlb subpages.
  131. For example, migration of a single 2MB THP that has 4KB-size base pages
  132. (subpages) will cause this counter to increase by 512.
  133. 2. PGMIGRATE_FAIL: Normal page migration failure. Same counting rules as for
  134. PGMIGRATE_SUCCESS, above: this will be increased by the number of subpages,
  135. if it was a THP or hugetlb.
  136. 3. THP_MIGRATION_SUCCESS: A THP was migrated without being split.
  137. 4. THP_MIGRATION_FAIL: A THP could not be migrated nor it could be split.
  138. 5. THP_MIGRATION_SPLIT: A THP was migrated, but not as such: first, the THP had
  139. to be split. After splitting, a migration retry was used for its sub-pages.
  140. THP_MIGRATION_* events also update the appropriate PGMIGRATE_SUCCESS or
  141. PGMIGRATE_FAIL events. For example, a THP migration failure will cause both
  142. THP_MIGRATION_FAIL and PGMIGRATE_FAIL to increase.
  143. Christoph Lameter, May 8, 2006.
  144. Minchan Kim, Mar 28, 2016.
  145. .. kernel-doc:: include/linux/migrate.h