Lines Matching +full:execution +full:- +full:memory

7 memory as required by current execution context. The physical memory is
8 conceptually divided in page-sized page frames as regions to hold data.
11   one of the page frames, the execution continues without any interruptions.
15   the corresponding data page from backing store into physical memory if
25   page into the free page frame. Now the data page is in physical memory
26   and execution can continue.
33 memory, and thus minimizing latency. :c:func:`k_mem_page_out()` can be
43   A data page is a page-sized region of data. It may exist in a page frame,
50   A page frame is a page-sized physical memory region in RAM. It is a
60   * ``K_MEM_PAGE_FRAME_PINNED`` indicates a page frame is pinned in memory
67     virtual memory address.
70     a page-in/out operation.
81   However the data page itself may only be mapped as read-only in virtual
82   address space. If this page is provided as-is to backing store,
83   the data page must be re-mapped as read/write which has security
84   implications as the data page is no longer read-only to other parts of
95 * Per-thread statistics via :c:func:`k_mem_paging_thread_stats_get()`
98 * Execution time histogram can be obtained when
107   * Execution time histogram of eviction algorithm via
110   * Execution time histogram of backing store doing page-in via
113   * Execution time histogram of backing store doing page-out via
143 There is one additional function which is called by the architecture's memory
150 * An NRU (Not-Recently-Used) eviction algorithm has been implemented as a
154 * An LRU (Least-Recently-Used) eviction algorithm is also available. It is
188   mapped and paged-in on demand. Most useful with
202   a no-op.
212 .. doxygengroup:: mem-demand-paging
217 .. doxygengroup:: mem-demand-paging-eviction
222 .. doxygengroup:: mem-demand-paging-backing-store