diff options
Diffstat (limited to 'Documentation/vm')
-rw-r--r-- | Documentation/vm/page_migration | 118 |
1 files changed, 82 insertions, 36 deletions
diff --git a/Documentation/vm/page_migration b/Documentation/vm/page_migration index c52820fcf500..0dd4ef30c361 100644 --- a/Documentation/vm/page_migration +++ b/Documentation/vm/page_migration | |||
@@ -12,12 +12,18 @@ is running. | |||
12 | 12 | ||
13 | Page migration allows a process to manually relocate the node on which its | 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 | 14 | pages are located through the MF_MOVE and MF_MOVE_ALL options while setting |
15 | a new memory policy. The pages of process can also be relocated | 15 | a new memory policy via mbind(). The pages of process can also be relocated |
16 | from another process using the sys_migrate_pages() function call. The | 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 | 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. | 18 | process that are located on the from nodes to the destination nodes. |
19 | 19 | Page migration functions are provided by the numactl package by Andi Kleen | |
20 | Manual migration is very useful if for example the scheduler has relocated | 20 | (a version later than 0.9.3 is required. Get it from |
21 | ftp://ftp.suse.com/pub/people/ak). numactl provided libnuma which | ||
22 | provides an interface similar to other numa functionality for page migration. | ||
23 | cat /proc/<pid>/numa_maps allows an easy review of where the pages of | ||
24 | a process are located. See also the numa_maps manpage in the numactl package. | ||
25 | |||
26 | Manual migration is useful if for example the scheduler has relocated | ||
21 | a process to a processor on a distant node. A batch scheduler or an | 27 | a process to a processor on a distant node. A batch scheduler or an |
22 | administrator may detect the situation and move the pages of the process | 28 | administrator may detect the situation and move the pages of the process |
23 | nearer to the new processor. At some point in the future we may have | 29 | nearer to the new processor. At some point in the future we may have |
@@ -25,10 +31,12 @@ some mechanism in the scheduler that will automatically move the pages. | |||
25 | 31 | ||
26 | Larger installations usually partition the system using cpusets into | 32 | Larger installations usually partition the system using cpusets into |
27 | sections of nodes. Paul Jackson has equipped cpusets with the ability to | 33 | sections of nodes. Paul Jackson has equipped cpusets with the ability to |
28 | move pages when a task is moved to another cpuset. This allows automatic | 34 | move pages when a task is moved to another cpuset (See ../cpusets.txt). |
29 | control over locality of a process. If a task is moved to a new cpuset | 35 | Cpusets allows the automation of process locality. If a task is moved to |
30 | then also all its pages are moved with it so that the performance of the | 36 | a new cpuset then also all its pages are moved with it so that the |
31 | process does not sink dramatically (as is the case today). | 37 | performance of the process does not sink dramatically. Also the pages |
38 | of processes in a cpuset are moved if the allowed memory nodes of a | ||
39 | cpuset are changed. | ||
32 | 40 | ||
33 | Page migration allows the preservation of the relative location of pages | 41 | Page migration allows the preservation of the relative location of pages |
34 | within a group of nodes for all migration techniques which will preserve a | 42 | within a group of nodes for all migration techniques which will preserve a |
@@ -37,22 +45,26 @@ process. This is necessary in order to preserve the memory latencies. | |||
37 | Processes will run with similar performance after migration. | 45 | Processes will run with similar performance after migration. |
38 | 46 | ||
39 | Page migration occurs in several steps. First a high level | 47 | Page migration occurs in several steps. First a high level |
40 | description for those trying to use migrate_pages() and then | 48 | description for those trying to use migrate_pages() from the kernel |
41 | a low level description of how the low level details work. | 49 | (for userspace usage see the Andi Kleen's numactl package mentioned above) |
50 | and then a low level description of how the low level details work. | ||
42 | 51 | ||
43 | A. Use of migrate_pages() | 52 | A. In kernel use of migrate_pages() |
44 | ------------------------- | 53 | ----------------------------------- |
45 | 54 | ||
46 | 1. Remove pages from the LRU. | 55 | 1. Remove pages from the LRU. |
47 | 56 | ||
48 | Lists of pages to be migrated are generated by scanning over | 57 | Lists of pages to be migrated are generated by scanning over |
49 | pages and moving them into lists. This is done by | 58 | pages and moving them into lists. This is done by |
50 | calling isolate_lru_page() or __isolate_lru_page(). | 59 | calling isolate_lru_page(). |
51 | Calling isolate_lru_page increases the references to the page | 60 | Calling isolate_lru_page increases the references to the page |
52 | so that it cannot vanish under us. | 61 | so that it cannot vanish while the page migration occurs. |
62 | It also prevents the swapper or other scans to encounter | ||
63 | the page. | ||
53 | 64 | ||
54 | 2. Generate a list of newly allocates page to move the contents | 65 | 2. Generate a list of newly allocates page. These pages will contain the |
55 | of the first list to. | 66 | contents of the pages from the first list after page migration is |
67 | complete. | ||
56 | 68 | ||
57 | 3. The migrate_pages() function is called which attempts | 69 | 3. The migrate_pages() function is called which attempts |
58 | to do the migration. It returns the moved pages in the | 70 | to do the migration. It returns the moved pages in the |
@@ -63,13 +75,17 @@ A. Use of migrate_pages() | |||
63 | 4. The leftover pages of various types are returned | 75 | 4. The leftover pages of various types are returned |
64 | to the LRU using putback_to_lru_pages() or otherwise | 76 | to the LRU using putback_to_lru_pages() or otherwise |
65 | disposed of. The pages will still have the refcount as | 77 | disposed of. The pages will still have the refcount as |
66 | increased by isolate_lru_pages()! | 78 | increased by isolate_lru_pages() if putback_to_lru_pages() is not |
79 | used! The kernel may want to handle the various cases of failures in | ||
80 | different ways. | ||
67 | 81 | ||
68 | B. Operation of migrate_pages() | 82 | B. How migrate_pages() works |
69 | -------------------------------- | 83 | ---------------------------- |
70 | 84 | ||
71 | migrate_pages does several passes over its list of pages. A page is moved | 85 | migrate_pages() does several passes over its list of pages. A page is moved |
72 | if all references to a page are removable at the time. | 86 | if all references to a page are removable at the time. The page has |
87 | already been removed from the LRU via isolate_lru_page() and the refcount | ||
88 | is increased so that the page cannot be freed while page migration occurs. | ||
73 | 89 | ||
74 | Steps: | 90 | Steps: |
75 | 91 | ||
@@ -79,36 +95,40 @@ Steps: | |||
79 | 95 | ||
80 | 3. Make sure that the page has assigned swap cache entry if | 96 | 3. Make sure that the page has assigned swap cache entry if |
81 | it is an anonyous page. The swap cache reference is necessary | 97 | it is an anonyous page. The swap cache reference is necessary |
82 | to preserve the information contain in the page table maps. | 98 | to preserve the information contain in the page table maps while |
99 | page migration occurs. | ||
83 | 100 | ||
84 | 4. Prep the new page that we want to move to. It is locked | 101 | 4. Prep the new page that we want to move to. It is locked |
85 | and set to not being uptodate so that all accesses to the new | 102 | and set to not being uptodate so that all accesses to the new |
86 | page immediately lock while we are moving references. | 103 | page immediately lock while the move is in progress. |
87 | 104 | ||
88 | 5. All the page table references to the page are either dropped (file backed) | 105 | 5. All the page table references to the page are either dropped (file |
89 | or converted to swap references (anonymous pages). This should decrease the | 106 | backed pages) or converted to swap references (anonymous pages). |
90 | reference count. | 107 | This should decrease the reference count. |
91 | 108 | ||
92 | 6. The radix tree lock is taken | 109 | 6. The radix tree lock is taken. This will cause all processes trying |
110 | to reestablish a pte to block on the radix tree spinlock. | ||
93 | 111 | ||
94 | 7. The refcount of the page is examined and we back out if references remain | 112 | 7. The refcount of the page is examined and we back out if references remain |
95 | otherwise we know that we are the only one referencing this page. | 113 | otherwise we know that we are the only one referencing this page. |
96 | 114 | ||
97 | 8. The radix tree is checked and if it does not contain the pointer to this | 115 | 8. The radix tree is checked and if it does not contain the pointer to this |
98 | page then we back out. | 116 | page then we back out because someone else modified the mapping first. |
99 | 117 | ||
100 | 9. The mapping is checked. If the mapping is gone then a truncate action may | 118 | 9. The mapping is checked. If the mapping is gone then a truncate action may |
101 | be in progress and we back out. | 119 | be in progress and we back out. |
102 | 120 | ||
103 | 10. The new page is prepped with some settings from the old page so that accesses | 121 | 10. The new page is prepped with some settings from the old page so that |
104 | to the new page will be discovered to have the correct settings. | 122 | accesses to the new page will be discovered to have the correct settings. |
105 | 123 | ||
106 | 11. The radix tree is changed to point to the new page. | 124 | 11. The radix tree is changed to point to the new page. |
107 | 125 | ||
108 | 12. The reference count of the old page is dropped because the reference has now | 126 | 12. The reference count of the old page is dropped because the radix tree |
109 | been removed. | 127 | reference is gone. |
110 | 128 | ||
111 | 13. The radix tree lock is dropped. | 129 | 13. The radix tree lock is dropped. With that lookups become possible again |
130 | and other processes will move from spinning on the tree lock to sleeping on | ||
131 | the locked new page. | ||
112 | 132 | ||
113 | 14. The page contents are copied to the new page. | 133 | 14. The page contents are copied to the new page. |
114 | 134 | ||
@@ -119,11 +139,37 @@ Steps: | |||
119 | 139 | ||
120 | 17. Queued up writeback on the new page is triggered. | 140 | 17. Queued up writeback on the new page is triggered. |
121 | 141 | ||
122 | 18. If swap pte's were generated for the page then remove them again. | 142 | 18. If swap pte's were generated for the page then replace them with real |
143 | ptes. This will reenable access for processes not blocked by the page lock. | ||
144 | |||
145 | 19. The page locks are dropped from the old and new page. | ||
146 | Processes waiting on the page lock can continue. | ||
147 | |||
148 | 20. The new page is moved to the LRU and can be scanned by the swapper | ||
149 | etc again. | ||
150 | |||
151 | TODO list | ||
152 | --------- | ||
153 | |||
154 | - Page migration requires the use of swap handles to preserve the | ||
155 | information of the anonymous page table entries. This means that swap | ||
156 | space is reserved but never used. The maximum number of swap handles used | ||
157 | is determined by CHUNK_SIZE (see mm/mempolicy.c) per ongoing migration. | ||
158 | Reservation of pages could be avoided by having a special type of swap | ||
159 | handle that does not require swap space and that would only track the page | ||
160 | references. Something like that was proposed by Marcelo Tosatti in the | ||
161 | past (search for migration cache on lkml or linux-mm@kvack.org). | ||
123 | 162 | ||
124 | 19. The locks are dropped from the old and new page. | 163 | - Page migration unmaps ptes for file backed pages and requires page |
164 | faults to reestablish these ptes. This could be optimized by somehow | ||
165 | recording the references before migration and then reestablish them later. | ||
166 | However, there are several locking challenges that have to be overcome | ||
167 | before this is possible. | ||
125 | 168 | ||
126 | 20. The new page is moved to the LRU. | 169 | - Page migration generates read ptes for anonymous pages. Dirty page |
170 | faults are required to make the pages writable again. It may be possible | ||
171 | to generate a pte marked dirty if it is known that the page is dirty and | ||
172 | that this process has the only reference to that page. | ||
127 | 173 | ||
128 | Christoph Lameter, December 19, 2005. | 174 | Christoph Lameter, March 8, 2006. |
129 | 175 | ||