Lines Matching refs:a
109 # Architecture platforms which require a two level mem_section in SPARSEMEM
125 SPARSEMEM_VMEMMAP uses a virtually mapped memmap to optimise
216 used within a guest, thus imposing performance penalties associated
235 disable this option unless there really is a strong reason for
251 pages as migration can relocate pages to satisfy a huge page
296 the many instances by a single page with that content, so
300 until a program has madvised that an area is MADV_MERGEABLE, and
309 from userspace allocation. Keeping a user from writing to low pages
313 a value of 65536 is reasonable and should cause no problems.
333 with MCA recovery. This allows a system to continue running
355 if there are a lot of transient processes.
360 Trimming can be dynamically controlled through a sysctl option
396 memory footprint of applications without a guaranteed
402 Enabling Transparent Hugepage madvise, will only provide a
405 memory footprint of applications without a guaranteed
437 Cleancache can be thought of as a page-granularity victim cache
440 memory. So when the PFRA "evicts" a page, it first attempts to use
444 time-varying size. And when a cleancache-enabled
445 filesystem wishes to access a page in a file on disk, it first
447 the page is copied into the kernel and a disk access is avoided.
448 When a transcendent memory driver is available (such as zcache or
449 Xen transcendent memory), a significant I/O reduction
451 are reduced to a single pointer-compare-against-NULL resulting
452 in a negligible performance hit.
461 of a "backing" store for a swap device. The data is stored into
465 a significant swap I/O reduction may be achieved. When none is
466 available, all frontswap calls are reduced to a single pointer-
467 compare-against-NULL resulting in a negligible performance hit
480 CMA reserves a region of memory and allows only movable pages to
482 pagecache and when a subsystem requests for contiguous area, the
518 This option enables memory changes tracking by introducing a
520 into a page just as regular dirty bit, but unlike the latter
533 compress them into a dynamically allocated RAM-based memory pool.
534 This can result in a significant I/O reduction on swap device and,
538 This is marked experimental because it is a new feature (as of
556 deterministic reclaim properties that make it preferable to a higher
565 page. It is a ZBUD derivative so the simplicity and determinism are
572 zsmalloc is a slab-based memory allocator designed to store
574 in order to reduce fragmentation. However, this results in a
575 non-standard allocator interface where a handle, not a pointer, is
583 By default, zsmalloc uses a copy-based object mapping method to
584 access allocations that span two pages. However, if a particular
614 the given value, unless the RLIMIT_STACK hard limit is changed to a
625 Ordinarily all struct pages are initialised during early boot in a
626 single thread. On very large machines this can take a considerable
628 a subset of memmap at boot and then initialise the rest in parallel
630 has a potential performance impact on processes running early in the
640 not been touched during a given period of time. This information can
642 within a compute cluster.
662 "device-physical" addresses which is needed for using a DAX
671 # Helpers to mirror range of the CPU page tables of a process into device page
722 This is marked experimental because it is a new feature. Write
730 # Some architectures require a special hugepage directory format that is
733 # introduced it on powerpc. This allows for a more flexible hugepage