Metraipolis › archive › dc_e2ee22741d5c

Memory Fit: Architectural Support for Page Placement by Learning Models of Good Behavior — arXiv:2611.07506

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07506
License (as archived)
CC0-1.0
Archived
2026-11-06T14:43:35.753Z
SHA-256 of the archived text
80f6fca9c1cac9fafb0a1a8ee8acaa8d8423e229db98dbb322d165e6d9d767a4
Stable URL of this page
https://metraipolis.com/documento/dc_e2ee22741d5c

How to cite

Memory Fit: Architectural Support for Page Placement by Learning Models of Good Behavior — arXiv:2611.07506 — arXiv (en), https://arxiv.org/abs/2611.07506 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e2ee22741d5c (Metraipolis archive dc_e2ee22741d5c, sha256 80f6fca9c1cac9fafb0a1a8ee8acaa8d8423e229db98dbb322d165e6d9d767a4)
BibTeX
@misc{dce2ee22741d5c,
  title = {Memory Fit: Architectural Support for Page Placement by Learning Models of Good Behavior — arXiv:2611.07506},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07506},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e2ee22741d5c; sha256 80f6fca9c1cac9fafb0a1a8ee8acaa8d8423e229db98dbb322d165e6d9d767a4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07506. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Server main memory is increasingly heterogeneous, incorporating technologies such as zswap, CXL memory expanders, and emerging phase-change memories (PCM). To decide where to place pages, operating systems have to choose between efficient but coarse-grained access bits, out-of-band profiling, or costly runtime instrumentation. This paper proposes memory fit, a hardware abstraction that provides precise and accurate page placement information to an operating system. Memory fit measures how well a page "fits" each type of memory in the system. Memory fit separates the mechanism of measuring affinity between pages and memories from the OS policy of choosing which pages to move when. The paper describes soft trace matching (STM), a computationally and space efficient algorithm to compute memory fit. The key technical insight behind STM is that it can estimate memory fit by comparing accesses to a page with a learned model of "good" traces for a memory. We have implemented memory fit and STM in a BOOMv3 RISC-V processor running Linux 6.6. On extended GUPS, memory fit placements recover 2.2-3.8 times as much of the performance gap to optimal placement as Linux TPP. For Redis with equal DRAM and PCM capacities, placements selected by memory fit recover 80% of the performance gap, versus 19% for TPP, in a placement replay. Memory fit requires only 64 bits of state per 4 KiB page and can be updated on every main-memory access with only a 1.2% overhead of OS kernel notification processing.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.AR, nuovi lavori del giorno).
Categorie arXiv: Operating Systems (cs.OS) ; Hardware Architecture (cs.AR).
Pagina del lavoro: https://arxiv.org/abs/2611.07506 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:19:27.608Z dalla pagina https://arxiv.org/list/cs.AR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).