strict-persistency · research

Strict persistency

Strict persistency couples persistent memory order to the underlying volatile memory order.

Strictness is relative to the memory consistency model, not a synonym for sequential consistency. Under the paper's SC case, a thread's persistent stores follow its program order, while unordered events in different threads may remain concurrent. Buffered strict persistency can let execution run ahead of durable state; ordering alone does not imply immediate completion. [1]

Relations

related
Memory persistency, Epoch persistency, Strand persistency, Persistence ordering

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)

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. Steven Pelley, Peter M. Chen and Thomas F. Wenisch. RETROSPECTIVE: Memory Persistency. ISCA retrospective, 2023; sections I-II. (accessed 2026-10-19)
  3. Hesela. Persistent memory: DAX is not a durable commit. (accessed 2026-10-19)

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

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

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