Lines Matching full:pages
43 The physical system memory is divided into page frames, or pages. The
50 pages. These mappings are described by page tables that allow
55 addresses of actual pages used by the software. The tables at higher
56 levels contain physical addresses of the pages belonging to the lower
66 Huge Pages
77 Many modern CPU architectures allow mapping of the memory pages
79 it is possible to map 2M and even 1G pages using entries in the second
80 and the third level page tables. In Linux such pages are called
81 `huge`. Usage of huge pages significantly reduces pressure on TLB,
85 memory with the huge pages. The first one is `HugeTLB filesystem`, or
88 the memory and mapped using huge pages. The hugetlbfs is described at
91 Another, more recent, mechanism that enables use of the huge pages is
94 the system memory should and can be mapped by the huge pages, THP
108 groups memory pages into `zones` according to their possible
112 contain normally addressed pages.
126 own set of zones, lists of free and used pages and various statistics
139 storage device. The written pages are marked as `dirty` and when Linux
166 memory management. The pages that can be freed at any time, either
170 reclaimable pages are page cache and anonymous memory.
172 In most cases, the pages holding internal kernel data and used as DMA
174 their user. Such pages are called `unreclaimable`. However, in certain
175 circumstances, even pages occupied with kernel data structures can be
181 The process of freeing the reclaimable physical memory pages and
183 pages either asynchronously or synchronously, depending on the state
186 pages supply. As the load increases, the amount of the free pages goes
189 asynchronously scan memory pages and either just free them if the data
191 device (remember those dirty pages?). As memory usage increases even
194 until enough memory pages are reclaimed to satisfy the request.
201 scattered physical pages as virtually contiguous range, sometimes it is
205 addresses the fragmentation issue. This mechanism moves occupied pages
206 from the lower part of a memory zone to free pages in the upper part
207 of the zone. When a compaction scan is finished free pages are grouped