Proceedings of the ACM International Conference on Computing Frontiers 2013
DOI: 10.1145/2482767.2482806
|View full text |Cite
|
Sign up to set email alerts
|

Bridging the programming gap between persistent and volatile memory using WrAP

Abstract: Advances in memory technology are promising the availability of byte-addressable persistent memory as an integral component of future computing platforms. This change has significant implications for software that has traditionally made a sharp distinction between durable and volatile storage. In this paper we describe a softwarehardware architecture, WrAP, for persistent memory that provides atomicity and durability while simultaneously ensuring that fast paths through the cache, DRAM, and persistent memory l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
3
1

Relationship

2
7

Authors

Journals

citations
Cited by 29 publications
(21 citation statements)
references
References 16 publications
0
21
0
Order By: Relevance
“…Persistent processor caches [17,36] and system-level persistence [25] would guarantee pending writes to NVM can be recovered after failures. It also eliminates the overhead of flushing caches for persistence [5].…”
Section: Related Workmentioning
confidence: 99%
“…Persistent processor caches [17,36] and system-level persistence [25] would guarantee pending writes to NVM can be recovered after failures. It also eliminates the overhead of flushing caches for persistence [5].…”
Section: Related Workmentioning
confidence: 99%
“…Adding a small DRAM buffer in front of SCM to improve latency and to coalesce writes was proposed in [2]. The use of a volatile victim cache to prevent uncontrolled cache evictions from reaching SCM was described in [4]. However the controller in that work assumes sequential executions of wraps; it also required complicated comparison of victim cache and log data entries during pruning, and log searching to handle overflows.…”
Section: Related Workmentioning
confidence: 99%
“…Low-level memory scheduling to improve efficiency of persistent memory access was studied in [3]. Except for [4], none of these works deal with the issues of atomicity or durability of write sequences. Analysis of consistency models for persistent memory was considered in [6].…”
Section: Related Workmentioning
confidence: 99%
“…Flush of the log writes to SCM is done through bflush. Hardware support for committing transactions [12,24] would reduce the overhead of consistency.…”
Section: Infrastructure Servicesmentioning
confidence: 99%