bpfs · research · also BPFS file system

BPFS

BPFS is a research file system that uses short-circuit shadow paging to commit persistent-memory updates below the file-system root.

Related Observatory article: BPFS on hesela.com

The design combines aligned eight-byte failure-atomic writes, in-place appends and partial copy-on-write. Epoch barriers order persistence across epochs without forcing immediate durability. [1]

Relations

related
Persistent memory, Epoch persistency, Persistence ordering, Crash consistency, NOVA file system

Limitations

  • The proposed hardware contract is not implied by ordinary memory barriers or DAX support. [1]

Citations

  1. Condit et al. Better I/O Through Byte-Addressable, Persistent Memory. SOSP 2009, sections 3.2, 4.3-4.4 and 5. (accessed 2026-11-13)

Further reading

  1. Hesela: BPFS commit points and persistence barriers. (accessed 2026-11-13)
Sources & caveats
  • Source synthesis of the SOSP 2009 research design. Evaluation used DRAM and PCM simulation, not current persistent-memory hardware. No prototype execution or benchmark replication.

JSON: /data/terms/bpfs.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. BPFS. Hesela. 2026-11-13. https://hesela.dev/terms/bpfs/