Persistent Data Retention Models
Tiancong Wang, James Tuck

TL;DR
This paper explores persistent data retention models for non-volatile memory, introducing a new automatic model that reduces overhead and programming complexity compared to existing manual and reset models.
Contribution
It defines and compares existing data retention models, introduces the Automatic Model, and presents an automatic approach using language extensions and compiler support.
Findings
Manual Model incurs 2.90% to 4.10% overhead.
LEDS reduces overhead to 0.45% to 10.27%.
LEDS decreases write operations by 26.36%.
Abstract
Non-Volatile Memory devices may soon be a part of main memory, and programming models that give programmers direct access to persistent memory through loads and stores are sought to maximize the performance benefits of these new devices. Direct access introduces new challenges. In this work, we identify an important aspect of programming for persistent memory: the persistent data retention model. A Persistent Data Retention Model describes what happens to persistent data when code that uses it is modified. We identify two models present in prior work but not described as such, the Reset and Manual Model, and we propose a new one called the Automatic Model. The Reset model discards all persistent data when a program changes leading to performance overheads and write amplification. In contrast, if data is to be retained, the Manual Model relies on the programmer to implement code that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Advanced Data Storage Technologies · Distributed systems and fault tolerance
