The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Mnemosyne: lightweight persistent memory
Abstract
New storage-class memory (SCM) technologies, such as phase-change memory, STT-RAM, and memristors, promise user-level access to non-volatile storage through regular memory instructions. These memory devices enable fast user-mode access to persistence, allowing regular in-memory data structures to survive system crashes.In this paper, we present Mnemosyne, a simple interface for programming with persistent memory. Mnemosyne addresses two challenges: how to create and manage such memory, and how to ensure consistency in the presence of failures. Without additional mechanisms, a system failure may leave data structures in SCM in an invalid state, crashing the program the next time it starts.In Mnemosyne, programmers declare global persistent data with the keyword pstatic or allocate it dynamically. Mnemosyne provides primitives for directly modifying persistent variables and supports consistent updates through a lightweight transaction mechanism. Compared to past work on disk-based persistent memory, Mnemosyne reduces latency to storage by writing data directly to memory at the granularity of an update rather than writing memory pages back to disk through the file system. In tests emulating the performance characteristics of forthcoming SCMs, we show that Mnemosyne can persist data as fast as 3 microseconds. Furthermore, it provides a 35 percent performance increase when applied in the OpenLDAP directory server. In microbenchmark studies we find that Mnemosyne can be up to 1400% faster than alternative persistence strategies, such as Berkeley DB or Boost serialization, that are designed for disks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Strukov, D. B., Snider, G. S., Stewart, D. R., & Williams, R. S. (2008) · Nature · doi:10.1038/nature06932 · Cited by 11,828
Transactional memory: architectural support for lock-free data structures
Herlihy, M., & Moss, J. E. B. (1993) · Proceedings of the 20th annual international symposium on Computer architecture - ISCA '93 · doi:10.1145/165123.165164 · Cited by 2,141
Architecting phase change memory as a scalable dram alternative
Lee, B. C., İpek, E., Mutlu, O., & Burger, D. (2009) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/1555754.1555758 · Cited by 1,494
Scalable high performance main memory system using phase-change memory technology
Qureshi, M. K., Srinivasan, V., & Rivers, J. A. (2009) · Proceedings of the 36th annual international symposium on Computer architecture · doi:10.1145/1555754.1555760 · Cited by 1,277
The design and implementation of a log-structured file system
Rosenblum, M., & Ousterhout, J. K. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146943 · Cited by 1,268
Proving the Correctness of Multiprocess Programs
Lamport, L. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.229904 · Cited by 1,138
Mohan, C., Haderle, D., Lindsay, B., Pirahesh, H., & Schwarz, P. (1992) · ACM Transactions on Database Systems · doi:10.1145/128765.128770 · Cited by 1,043
The design and implementation of a log-structured file system
Rosenblum, M., & Ousterhout, J. K. (1991) · Proceedings of the thirteenth ACM symposium on Operating systems principles · doi:10.1145/121132.121137 · Cited by 970
A durable and energy efficient main memory using phase change memory technology
Zhou, P., Zhao, B., Yang, J., & Zhang, Y. (2009) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/1555754.1555759 · Cited by 867
Better I/O through byte-addressable, persistent memory
Condit, J., Nightingale, E. B., Frost, C., Ipek, E., Lee, B., Burger, D., & Coetzee, D. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629589 · Cited by 824
Enhancing lifetime and security of PCM-based main memory with start-gap wear leveling
Qureshi, M. K., Karidis, J., Franceschini, M., Srinivasan, V., Lastras, L., & Abali, B. (2009) · Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/1669112.1669117 · Cited by 762
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
Coburn, J., Caulfield, A. M., Akel, A., Grupp, L. M., Gupta, R. K., Jhala, R., & Swanson, S. (2011) · Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/1950365.1950380 · Cited by 646
Garbage collection in an uncooperative environment
Boehm, H., & Weiser, M. (1988) · Software: Practice and Experience · doi:10.1002/spe.4380180902 · Cited by 627
Paxos made live: an engineering perspective
Chandra, T. D., Griesemer, R., & Redstone, J. (2007) · Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing · doi:10.1145/1281100.1281103 · Cited by 619
The transaction concept: virtues and limitations
Gray, J. (1988) · Cited by 608
The ObjectStore database system
Lamb, C., Landis, G., Orenstein, J., & Weinreb, D. (1991) · Communications of the ACM · doi:10.1145/125223.125244 · Cited by 548
Storage-class memory: The next storage system technology
Freitas, R. F., & Wilcke, W. W. (2008) · IBM Journal of Research and Development · doi:10.1147/rd.524.0439 · Cited by 510
Shoring up persistent applications
Carey, M. J., DeWitt, D. J., Franklin, M. J., Hall, N. E., McAuliffe, M. L., Naughton, J. F., Schuh, D. T., Solomon, M. H., Tan, C. K., Tsatalos, O. G., et al. (1994) · Proceedings of the 1994 ACM SIGMOD international conference on Management of data · doi:10.1145/191839.191915 · Cited by 420
The transaction concept: virtues and limitations (invited paper)
Gray, J. (1981) · Very Large Data Bases · Cited by 221
Prabhakaran, V., Bairavasundaram, L. N., Agrawal, N., Gunawi, H. S., Arpaci-Dusseau, A. C., & Arpaci-Dusseau, R. H. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095830 · Cited by 189
Prabhakaran, V., Bairavasundaram, L. N., Agrawal, N., Gunawi, H. S., Arpaci-Dusseau, A. C., & Arpaci-Dusseau, R. H. (2005) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/1095810.1095830 · Cited by 177
Dynamically replicated memory: building reliable systems from nanoscale resistive memories
Ipek, E., Condit, J., Nightingale, E. B., Burger, D., & Moscibroda, T. (2010) · ACM SIGARCH Computer Architecture News · doi:10.1145/1735970.1736023 · Cited by 160
Safe and efficient sharing of persistent objects in Thor
Liskov, B. H., Adya, A., Castro, M., Ghemawat, S., Gruber, R. E., Maheshwari, U., Myers, A. C., Day, M., & Shrira, L. (1996) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/233269.233346 · Cited by 153
Design and implementation of transactional constructs for C/C++
Ni, Y., Welc, A., Adl-Tabatabai, A.-R., Bach, M., Berkowits, S., Cownie, J. H., Geva, R. Y., Kozhukow, S., Narayanaswamy, R., Olivier, J., et al. (2008) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/1449764.1449780 · Cited by 136
İpek, E., Condit, J., Nightingale, E. B., Burger, D., & Moscibroda, T. (2010) · doi:10.1145/1736020.1736023 · Cited by 129
Beyond block I/O: Rethinking traditional storage primitives
Ouyang, X., Nellans, D. W., Wipfel, R., Flynn, D., & Panda, D. K. D. (2011) · Proceedings - International Symposium on High-Performance Computer Architecture/Proceedings · doi:10.1109/hpca.2011.5749738 · Cited by 119
A 45nm 1Gb 1.8V phase-change memory
Villa, C., Mills, D., Barkley, G., Giduturi, H., Schippers, S., & Vimercati, D. (2010) · Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference · doi:10.1109/isscc.2010.5433916 · Cited by 103
An 8Mb demonstrator for high-density 1.8V Phase-Change Memories
Bedeschi, F., Resta, C., Khouri, O., Buda, E., Costa, L., Ferraro, M., Pellizzer, F., Ottogalli, F., Pirovano, A., Tosi, M., et al. (2004) · Symposium on VLSI Circuits · doi:10.1109/vlsic.2004.1346644 · Cited by 95
Shoring up persistent applications
Carey, M. J., DeWitt, D. J., Franklin, M. J., Hall, N. E., McAuliffe, M. L., Naughton, J. F., Schuh, D. T., Solomon, M. H., Tan, C. K., Tsatalos, O. G., et al. (1994) · ACM SIGMOD Record · doi:10.1145/191843.191915 · Cited by 44
Cited by
Kambatla, K., Kollias, G., Kumar, V., & Grama, A. (2014) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2014.01.003 · Cited by 819
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
Coburn, J., Caulfield, A. M., Akel, A., Grupp, L. M., Gupta, R. K., Jhala, R., & Swanson, S. (2011) · Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/1950365.1950380 · Cited by 646
System software for persistent memory
Dulloor, S. R., Kumar, S., Keshavamurthy, A., Lantz, P., Reddy, D., Sankaran, R., & Jackson, J. (2014) · Proceedings of the Ninth European Conference on Computer Systems · doi:10.1145/2592798.2592814 · Cited by 617
PUMA: A Programmable Ultra-efficient Memristor-based Accelerator for Machine Learning Inference
Ankit, A., Hajj, I. E., Chalamalasetti, S. R., Ndu, G., Foltin, M., Williams, R. S., Faraboschi, P., Hwu, W.-M. W., Strachan, J. P., Roy, K., et al. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304049 · Cited by 424
In-Memory Big Data Management and Processing: A Survey
Zhang, H., Chen, G., Ooi, B. C., Tan, K.-L., & Zhang, M. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2427795 · Cited by 414
Metadata
- Authors
- Volos, H., Tack, A. J., & Swift, M. M.
- Venue
- Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
- Publisher
- ACM
- Published
- 2011-03-05
- Pages
- 91-104
- OpenAlex
- W2113637091
- Cited by
- 711
- References
- 29
- FWCI
- 26.85
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.