Lines Matching +full:page +full:- +full:based

1 .. SPDX-License-Identifier: GPL-2.0
13 - Operations Set: Implements fundamental operations for DAMON that depends on
14 the given monitoring target address-space and available set of
16 - Core: Implements core logics including monitoring overhead/accurach control
17 and access-aware system operations on top of the operations set layer, and
18 - Modules: Implements kernel modules for various purposes that provides
23 ---------------------------
45 --------------------
66 VMA-based Target Address Range Construction
67 -------------------------------------------
73 Only small parts in the super-huge virtual address space of the processes are
85 heap and the uppermost mmap()-ed region, and the gap between the lowermost
86 mmap()-ed region and the stack in most of the cases. Because these gaps are
88 to make a reasonable trade-off. Below shows this in detail::
92 <uppermost mmap()-ed region>
93 (small mmap()-ed regions and munmap()-ed regions)
94 <lowermost mmap()-ed region>
99 PTE Accessed-bit Based Access Check
100 -----------------------------------
103 Accessed-bit for basic access checks. Only one difference is the way of
105 implementation for the virtual address walks the page table for the target task
106 of the address, the implementation for the physical address walks every page
110 subsystems using the Accessed bits, namely Idle page tracking and the reclaim
111 logic. DAMON does nothing to avoid disturbing Idle page tracking, so handling
113 conflict with the reclaim logic using ``PG_idle`` and ``PG_young`` page flags,
114 as Idle page tracking does.
122 ----------
136 access to each page per ``sampling interval`` and aggregates the results. In
137 other words, counts the number of the accesses to each page. After each
140 clears the results. This can be described in below simple pseudo-code::
143 for page in monitoring_target:
144 if accessed(page):
145 nr_accesses[page] += 1
149 for page in monitoring_target:
150 nr_accesses[page] = 0
157 Region Based Sampling
163 one page in the region is required to be checked. Thus, for each ``sampling
164 interval``, DAMON randomly picks one page in each region, waits for one
165 ``sampling interval``, checks whether the page is accessed meanwhile, and
168 to set the minimum and the maximum number of regions for the trade-off.
181 adaptively merges and splits each region based on their access frequency.
187 will not exceed the user-specified maximum number of regions after the split.
189 In this way, DAMON provides its best-effort quality and minimal overhead while
190 keeping the bounds users set for their trade-off.
198 understanding of the access pattern. For example, page placement algorithm
212 be hot-plugged.
216 and applies it to monitoring operations-related data structures such as the
217 abstracted monitoring target memory area only for each of a user-specified time
224 -----------------
226 One common purpose of data access monitoring is access-aware system efficiency
236 One straightforward approach for such schemes would be profile-guided
253 works, DAMON provides a feature called Data Access Monitoring-based Operation
256 the access pattern of interest, and applies the user-desired operation actions
302 DAMOS upper-bound overhead control feature. DAMOS could incur high overhead if
310 To mitigate that situation, DAMOS provides an upper-bound overhead control
313 the action can be applied within a user-specified time duration.
327 rarely accessed (colder) memory regions would be prioritized for page-out
329 page collapse scheme action. Hence, the prioritization mechanisms for each
370 Non-access pattern-based target memory regions filtering. If users run
371 self-written programs or have good profiling tools, they could know something
375 have a list of latency-critical processes.
380 memory, and whether it should exclude the memory of the type (filter-out), or
381 all except the memory of the type (filter-in).
383 Currently, anonymous page, memory cgroup, address range, and DAMON monitoring
390 non-anonymous pages, pages of specific cgroups, all pages excluding those of
396 operations set. If a memory region is filtered by a core layer-handled filter,
398 memory regions is filtered by an operations set layer-handled filter, it is
404 ---------------------------------
406 The programming interface for kernel space data access-aware applications.
409 access-aware applications using DAMON's core features. For this, DAMON exposes
422 for general purpose DAMON control and special purpose data access-aware system
424 user space. The user space can build their efficient data access-aware
429 --------------------------------------
436 user-space. Please note that DAMON debugfs interface is currently deprecated.
442 API, and return the results to the user-space.
446 user space tools. One such Python-written user space tool is available at
449 (https://packages.fedoraproject.org/pkgs/python-damo/damo/).
451 Please refer to the ABI :doc:`document </admin-guide/mm/damon/usage>` for
455 Special-Purpose Access-aware Kernel Modules
456 -------------------------------------------
461 in runtime. For each special-purpose system-wide data access-aware system
464 extended for boot-time and even compile time control. Default values of DAMON
472 (:doc:`/admin-guide/mm/damon/reclaim` and
473 :doc:`/admin-guide/mm/damon/lru_sort`).