Taking advantage of the unique characteristics of persistent memory, such as byte addressability, persistence, and update in place, allows us to build data structures that are much faster than any data structure requiring serialization or flushing to a disk. However, this comes at a cost. Algorithms must be carefully designed to properly persist data by flushing CPU caches or using non-temporal stores and memory barriers to maintain data consistency. This chapter describes how to design such data structures and algorithms and shows what properties they ...
© The Author(s) 2020
S. ScargallProgramming Persistent Memoryhttps://doi.org/10.1007/978-1-4842-4932-1_1111. Designing Data Structures for Persistent Memory
Steve Scargall1
(1)
Santa Clara, CA, USA
Get Programming Persistent Memory: A Comprehensive Guide for Developers now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
