The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Enhancing lifetime and security of PCM-based main memory with start-gap wear leveling
Abstract
Phase Change Memory (PCM) is an emerging memory technology that can increase main memory capacity in a cost-effective and power-efficient manner. However, PCM cells can endure only a maximum of 107 - 108 writes, making a PCM based system have a lifetime of only a few years under ideal conditions. Furthermore, we show that non-uniformity in writes to different cells reduces the achievable lifetime of PCM system by 20x. Writes to PCM cells can be made uniform with Wear-Leveling. Unfortunately, existing wear-leveling techniques require large storage tables and indirection, resulting in significant area and latency overheads.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Rapid-phase transitions of GeTe-Sb2Te3 pseudobinary amorphous thin films for an optical disk memory
Yamada, N., Ohno, E., Nishiuchi, K., Akahira, N., & Takao, M. (1991) · Journal of Applied Physics · doi:10.1063/1.348620 · Cited by 1,469
A First Course in Probability.
Sherman, M. J., & Ross, S. (1984) · Journal of the American Statistical Association · doi:10.2307/2288753 · Cited by 1,344
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
Self-citationPhase-change random access memory: A scalable technology
Raoux, S., Burr, G. W., Breitwisch, M. J., Rettner, C. T., Chen, Y.-C., Shelby, R. M., Salinga, M., Krebs, D., Chen, S.-H., Lung, H.-L., et al. (2008) · IBM Journal of Research and Development · doi:10.1147/rd.524.0465 · Cited by 1,010
How to Construct Pseudorandom Permutations from Pseudorandom Functions
Luby, M., & Rackoff, C. (1988) · SIAM Journal on Computing · doi:10.1137/0217022 · Cited by 938
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 912
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
Energy management for commercial servers
Lefurgy, C., Rajamani, K., Rawson, F., Felter, W., Kistler, M., & Keller, T. W. (2003) · Computer · doi:10.1109/mc.2003.1250880 · Cited by 473
Ross, S. M. (2010) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 346
Cited by
Chi, P., Li, S., Xu, C., Zhang, T., Zhao, J., Liu, Y., Wang, Y., & Xie, Y. (2016) · ACM SIGARCH Computer Architecture News · doi:10.1145/3007787.3001140 · Cited by 1,231
PipeLayer: A Pipelined ReRAM-Based Accelerator for Deep Learning
Song, L., Qian, X., Li, H., & Chen, Y. (2017) · 2017 IEEE International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2017.55 · Cited by 833
Mnemosyne: lightweight persistent memory
Volos, H., Tack, A. J., & Swift, M. M. (2011) · Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/1950365.1950379 · Cited by 711
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
Chi, P., Li, S., Xu, C., Zhang, T., Zhao, J., Liu, Y., Wang, Y., & Xie, Y. (2016) · 2016 ACM/IEEE 43rd Annual International Symposium on Computer Architecture (ISCA) · doi:10.1109/isca.2016.13 · Cited by 573
Metadata
- Authors
- Qureshi, M. K., Karidis, J., Franceschini, M., Srinivasan, V., Lastras, L., & Abali, B.
- Venue
- Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture
- Publisher
- ACM
- Published
- 2009-12-12
- Pages
- 14-23
- ISSN
- 1072-4451 (ISSN-L)
- OpenAlex
- W2112753327
- Cited by
- 762
- References
- 11
- FWCI
- 33.74
- 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.