The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Approximate storage in solid-state memories
Abstract
Memories today expose an all-or-nothing correctness model that incurs significant costs in performance, energy, area, and design complexity. But not all applications need high-precision storage for all of their data structures all of the time. This paper proposes mechanisms that enable applications to store data approximately and shows that doing so can improve the performance, lifetime, or density of solid-state memories. We propose two mechanisms. The first allows errors in multi-level cells by reducing the number of programming pulses used to write them. The second mechanism mitigates wear-out failures and extends memory endurance by mapping approximate data onto blocks that have exhausted their hardware error correction resources. Simulations show that reduced-precision writes in multi-level phase-change memory cells can be 1.7x faster on average and using failed blocks can improve array lifetime by 23% on average with quality loss under 10%.
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
Programming algorithms for multilevel phase-change memory
Papandreou, N., Pozidis, H., Pantazi, A., Sebastian, A., Breitwisch, M., Lam, C., & Eleftheriou, E. (2011) · 2011 IEEE International Symposium of Circuits and Systems (ISCAS) · doi:10.1109/iscas.2011.5937569 · Cited by 124 · cited 1×
“Each constituent write pulse in an PCM write can either increase or decrease resistance [28,29,31].”
Background
Cited by
A Survey of Techniques for Approximate Computing
Mittal, S. (2016) · ACM Computing Surveys · doi:10.1145/2893356 · Cited by 1,058
A DNA-Based Archival Storage System
Bornholt, J., Lopez, R., Carmean, D. M., Ceze, L., Seelig, G., & Strauss, K. (2016) · Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/2872362.2872397 · Cited by 316
Self-citationA DNA-Based Archival Storage System
Bornholt, J., Lopez, R., Carmean, D. M., Ceze, L., Seelig, G., & Strauss, K. (2016) · ACM SIGOPS Operating Systems Review · doi:10.1145/2954680.2872397 · Cited by 77
Self-citationA DNA-Based Archival Storage System
Bornholt, J., Lopez, R., Carmean, D. M., Ceze, L., Seelig, G., & Strauss, K. (2016) · ACM SIGPLAN Notices · doi:10.1145/2954679.2872397 · Cited by 54
Self-citation
Metadata
- Authors
- Sampson, A., Nelson, J., Strauss, K., & Ceze, L.
- Venue
- Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture
- Publisher
- ACM
- Published
- 2013-12-07
- Pages
- 25-36
- ISSN
- 1072-4451 (ISSN-L)
- OpenAlex
- W2033982707
- Cited by
- 215
- References
- 1
- FWCI
- 27.96
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Approximate storage in solid-state memories. https://app.cochat.ai/papers/10.1145/2540708.2540712
- The paper
- Sampson, A., Nelson, J., Strauss, K., & Ceze, L. (2013). Approximate storage in solid-state memories. Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture. https://doi.org/10.1145/2540708.2540712
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.