memory-persistency · research · also memory persistency model

Memory persistency

Memory persistency specifies the permitted ordering of durable updates relative to other memory events and system failure.

The recovery observer captures surviving state; it is distinct from the observers used to reason about inter-thread visibility. A persistence domain describes protected components, whereas a persistency model describes ordering. [3] Strict, epoch and strand models differ in which dependencies they preserve. They are not names for media types or blanket hardware guarantees. [1]

Relations

related
Persistence domain, Persistence ordering, Persistent memory, Strict persistency, Epoch persistency, Strand persistency

Citations

  1. Pelley, Chen and Wenisch. Memory Persistency. ISCA 2014, pp. 265-276; sections 4-5 and 7-8, Table 1. (accessed 2026-10-19)
  2. Steven Pelley, Peter M. Chen and Thomas F. Wenisch. RETROSPECTIVE: Memory Persistency. ISCA retrospective, 2023; sections I-II. (accessed 2026-10-19)

Further reading

  1. Han and Kimura. Durable Queue Implementations Built on a Formally Defined Strand Persistency Model. JIP 29 (2021), pp. 823-838, sections 2-3. (accessed 2026-10-19)
  2. Hesela. Persistent memory: DAX is not a durable commit. (accessed 2026-10-19)

JSON: /data/terms/memory-persistency.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Memory persistency. Hesela. 2026-10-19. https://hesela.dev/terms/memory-persistency/