Question

When the number of these things available in a zone drops below the min watermark, a process called “direct reclaim” is initiated. The KVM hypervisor implements a feature that detects duplicate examples of these things and merges them; that feature is abbreviated KSM. When implementing ASLR on Linux, the last 12 bits are not actually randomized to avoid breaking alignment with these things. (15[2])Though these things have a default size of (*) 4 kilobytes, (10[1])Linux also supports 2 megabyte and 1 gigabyte sizes, which are denoted “huge”. Upon a translation lookaside buffer miss, the CPU or hardware has to “walk” a table named for these things to find the correct entry. It’s not segments, but MMUs raise a “fault” named for these things when a process tries to access memory that isn’t in RAM. For 10 points, virtual memory (10[1])is often implemented by dividing the address space into fixed-size blocks known by what name? ■END■

Back to tossups