optimistic-crash-consistency · research

Optimistic crash consistency

Optimistic crash consistency is a research approach that permits write reordering while preserving a recoverable consistent prefix.

Related Observatory article: Optimistic crash consistency on hesela.com

OptFS distinguishes ordering-only osync from durable dsync. Checksums alone are insufficient: reuse and checkpointing also need control. Its timing-based durability approximation is an explicit prototype assumption, not a portable device guarantee. [1]

Relations

related
Persistence ordering, Crash consistency, External synchrony

Citations

  1. Chidambaram et al. Optimistic Crash Consistency. SOSP 2013, sections 4-6. DOI: 10.1145/2517349.2522726. (accessed 2026-10-20)

JSON: /data/terms/optimistic-crash-consistency.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Optimistic crash consistency. Hesela. 2026-10-20. https://hesela.dev/terms/optimistic-crash-consistency/