Live briefing
Everything about Persistent memory
Computer science concept
In computer science, persistent memory is any method or apparatus for efficiently storing data structures such that they can continue to be accessed using memory instructions or memory APIs even after the end of the process that created or last modified them. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Persistent memoryA 5-minute orientation
- Skim a recent paper: Persistent Overconfidence and Biased Memory: Evidence from ManagersInfluential work since 2022
- Pick up a classic book: DeleteThe most-reprinted book on the subject
- Read the landmark paper: Persistent Spiking Activity Underlies Working MemoryCited 311 times
- Go sideways: Compare-and-swapA closely related topic
- Go sideways: Mutual exclusionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Persistent Spiking Activity Underlies Working Memory
Persistent LIP Activity in Memory Antisaccades: Working Memory For a Sensorimotor Transformation
Evaluating persistent memory range indexes
PERSISTENT MEMORY DEFECT FOLLOWING ENCEPHALITIS
Memory management techniques for large-scale persistent-main-memory systems
Understanding the idiosyncrasies of real persistent memory
Persistent memory hash indexes
MicroRNA regulation of persistent stress-enhanced memory
🆕 Influential since 2022
Persistent Overconfidence and Biased Memory: Evidence from Managers
Persistent activity during working memory maintenance predicts long-term memory formation in the human hippocampus
An organic memory phototransistor based on oxygen-assisted persistent photoconductivity
Memory Perfectionism is Associated with Persistent Memory Complaints after Concussion
ctFS: Replacing File Indexing with Hardware Memory Translation through Contiguous File Allocation for Persistent Memory
📚 Books worth reading
Delete
DaliRanked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Compare-and-swap In computer science, compare-and-swap (CAS) is an atomic instruction used in multithreading to achieve synchronization. It compares the contents of a memory…
- Mutual exclusion In computer science, mutual exclusion is a property of concurrency control, which is instituted for the purpose of preventing race conditions. It is the…
- NOVA (filesystem) The NOVA (non-volatile memory accelerated) file system is an open-source, log-structured file system for byte-addressable persistent memory (for example…
- ABA problem In multithreaded computing, the ABA problem occurs during synchronization, when a location is read twice, has the same value for both reads, and the read…
- Ctrie A concurrent hash-trie or Ctrie is a concurrent thread-safe lock-free implementation of a hash array mapped trie. It is used to implement the concurrent…
- Segmentation fault In computing, a segmentation fault (often shortened to segfault) or access violation is a failure condition raised by hardware with memory protection,…
- Hazard pointer Hazard pointers, in a multithreaded computing environment, are one approach to solving the problems posed by dynamic memory management of the nodes in…
- Persistent data structure In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when…