page_migration 5.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129
  1. Page migration
  2. --------------
  3. Page migration allows the moving of the physical location of pages between
  4. nodes in a numa system while the process is running. This means that the
  5. virtual addresses that the process sees do not change. However, the
  6. system rearranges the physical location of those pages.
  7. The main intend of page migration is to reduce the latency of memory access
  8. by moving pages near to the processor where the process accessing that memory
  9. is running.
  10. Page migration allows a process to manually relocate the node on which its
  11. pages are located through the MF_MOVE and MF_MOVE_ALL options while setting
  12. a new memory policy. The pages of process can also be relocated
  13. from another process using the sys_migrate_pages() function call. The
  14. migrate_pages function call takes two sets of nodes and moves pages of a
  15. process that are located on the from nodes to the destination nodes.
  16. Manual migration is very useful if for example the scheduler has relocated
  17. a process to a processor on a distant node. A batch scheduler or an
  18. administrator may detect the situation and move the pages of the process
  19. nearer to the new processor. At some point in the future we may have
  20. some mechanism in the scheduler that will automatically move the pages.
  21. Larger installations usually partition the system using cpusets into
  22. sections of nodes. Paul Jackson has equipped cpusets with the ability to
  23. move pages when a task is moved to another cpuset. This allows automatic
  24. control over locality of a process. If a task is moved to a new cpuset
  25. then also all its pages are moved with it so that the performance of the
  26. process does not sink dramatically (as is the case today).
  27. Page migration allows the preservation of the relative location of pages
  28. within a group of nodes for all migration techniques which will preserve a
  29. particular memory allocation pattern generated even after migrating a
  30. process. This is necessary in order to preserve the memory latencies.
  31. Processes will run with similar performance after migration.
  32. Page migration occurs in several steps. First a high level
  33. description for those trying to use migrate_pages() and then
  34. a low level description of how the low level details work.
  35. A. Use of migrate_pages()
  36. -------------------------
  37. 1. Remove pages from the LRU.
  38. Lists of pages to be migrated are generated by scanning over
  39. pages and moving them into lists. This is done by
  40. calling isolate_lru_page() or __isolate_lru_page().
  41. Calling isolate_lru_page increases the references to the page
  42. so that it cannot vanish under us.
  43. 2. Generate a list of newly allocates page to move the contents
  44. of the first list to.
  45. 3. The migrate_pages() function is called which attempts
  46. to do the migration. It returns the moved pages in the
  47. list specified as the third parameter and the failed
  48. migrations in the fourth parameter. The first parameter
  49. will contain the pages that could still be retried.
  50. 4. The leftover pages of various types are returned
  51. to the LRU using putback_to_lru_pages() or otherwise
  52. disposed of. The pages will still have the refcount as
  53. increased by isolate_lru_pages()!
  54. B. Operation of migrate_pages()
  55. --------------------------------
  56. migrate_pages does several passes over its list of pages. A page is moved
  57. if all references to a page are removable at the time.
  58. Steps:
  59. 1. Lock the page to be migrated
  60. 2. Insure that writeback is complete.
  61. 3. Make sure that the page has assigned swap cache entry if
  62. it is an anonyous page. The swap cache reference is necessary
  63. to preserve the information contain in the page table maps.
  64. 4. Prep the new page that we want to move to. It is locked
  65. and set to not being uptodate so that all accesses to the new
  66. page immediately lock while we are moving references.
  67. 5. All the page table references to the page are either dropped (file backed)
  68. or converted to swap references (anonymous pages). This should decrease the
  69. reference count.
  70. 6. The radix tree lock is taken
  71. 7. The refcount of the page is examined and we back out if references remain
  72. otherwise we know that we are the only one referencing this page.
  73. 8. The radix tree is checked and if it does not contain the pointer to this
  74. page then we back out.
  75. 9. The mapping is checked. If the mapping is gone then a truncate action may
  76. be in progress and we back out.
  77. 10. The new page is prepped with some settings from the old page so that accesses
  78. to the new page will be discovered to have the correct settings.
  79. 11. The radix tree is changed to point to the new page.
  80. 12. The reference count of the old page is dropped because the reference has now
  81. been removed.
  82. 13. The radix tree lock is dropped.
  83. 14. The page contents are copied to the new page.
  84. 15. The remaining page flags are copied to the new page.
  85. 16. The old page flags are cleared to indicate that the page does
  86. not use any information anymore.
  87. 17. Queued up writeback on the new page is triggered.
  88. 18. If swap pte's were generated for the page then remove them again.
  89. 19. The locks are dropped from the old and new page.
  90. 20. The new page is moved to the LRU.
  91. Christoph Lameter, December 19, 2005.