The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Cache Memories
Abstract
Cache memories are used in modern, medium and high-speed CPUs to hold temporarily those portions of the contents of main memory which are {believed to be) currently in use. Since instructions and data in cache memories can usually be referenced in 10 to 25 percent of the time required to access main memory, cache memories permit the
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
A study of replacement algorithms for a virtual-storage computer
Belady, L. A. (1966) · IBM Systems Journal · doi:10.1147/sj.52.0078 · Cited by 1,659
Evaluation techniques for storage hierarchies
Mattson, R. L., Gecsei, J., Slutz, D. R., & Traiger, I. L. (1970) · IBM Systems Journal · doi:10.1147/sj.92.0078 · Cited by 1,302
An Efficient Algorithm for Exploiting Multiple Arithmetic Units
Tomasulo, R. M. (1967) · IBM Journal of Research and Development · doi:10.1147/rd.111.0025 · Cited by 898
The working set model for program behavior
Denning, P. J. (1983) · Communications of the ACM · doi:10.1145/357980.357997 · Cited by 845
The working set model for program behavior
Denning, P. J. (1968) · Communications of the ACM · doi:10.1145/363095.363141 · Cited by 662
Structural aspects of the System/360 Model 85, II: The cache
Liptay, J. S. (1968) · IBM Systems Journal · doi:10.1147/sj.71.0015 · Cited by 236
Sequentiality and prefetching in database systems
Smith, A. J. (1978) · ACM Transactions on Database Systems · doi:10.1145/320263.320276 · Cited by 194
Self-citationSmith, A. J. (1978) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1978.231482 · Cited by 113
Self-citationCache Performance in the VAX-11/780
Clark, D. W. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357353.357356 · Cited by 107
Kaplan, K., & Winder, R. O. (1973) · Computer · doi:10.1109/c-m.1973.217037 · Cited by 107
Cited by
(2016) · IACR Cryptology ePrint Archive · Cited by 1,288
Memory coherence in shared virtual memory systems
Li, K., & Hudak, P. (1989) · ACM Transactions on Computer Systems · doi:10.1145/75104.75105 · Cited by 1,167
Value locality and load value prediction
Lipasti, M. H., Wilkerson, C. B., & Shen, J. P. (1996) · Proceedings of the seventh international conference on Architectural support for programming languages and operating systems · doi:10.1145/237090.237173 · Cited by 672
Evaluating associativity in CPU caches
Hill, M. D., & Smith, A. J. (1989) · IEEE Transactions on Computers · doi:10.1109/12.40842 · Cited by 606
Self-citationAn effective on-chip preloading scheme to reduce data access penalty
Baer, J.-L., & Chen, T.-F. (1991) · Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91 · doi:10.1145/125826.125932 · Cited by 466
Characterizing reference locality in the WWW
Almeida, V., Bestavros, A., Crovella, M., & de Oliveira, A. (2002) · Fourth International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568672 · Cited by 464
A low-overhead coherence solution for multiprocessors with private cache memories
Papamarcos, M. S., & Patel, J. H. (1998) · 25 years of the international symposia on Computer architecture (selected papers) · doi:10.1145/285930.285987 · Cited by 405
Tile size selection using cache organization and data layout
Coleman, S., & McKinley, K. S. (1995) · Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation · doi:10.1145/207110.207162 · Cited by 402
Data cache management using frequency-based replacement
Robinson, J. T., & Devarakonda, M. V. (1990) · Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems - SIGMETRICS '90 · doi:10.1145/98457.98523 · Cited by 394
Memory bandwidth limitations of future microprocessors
Burger, D., Goodman, J. R., & Kägi, A. (1996) · Proceedings of the 23rd annual international symposium on Computer architecture · doi:10.1145/232973.232983 · Cited by 392
Optimally profiling and tracing programs
Ball, T., & Larus, J. R. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/183432.183527 · Cited by 362
Cache-conscious structure layout
Chilimbi, T. M., Hill, M. D., & Larus, J. R. (1999) · Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation · doi:10.1145/301618.301633 · Cited by 334
Hip and trendy: Characterizing emerging trends on Twitter
Naaman, M., Becker, H., & Gravano, L. (2011) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21489 · Cited by 322
Agarwal, A., Hennessy, J., & Horowitz, M. (1989) · ACM Transactions on Computer Systems · doi:10.1145/63404.63407 · Cited by 304
Caching strategies to improve disk system performance
Karedla, R., Love, J. S., & Wherry, B. G. (1994) · Computer · doi:10.1109/2.268884 · Cited by 293
Page placement algorithms for large real-indexed caches
Kessler, R. E., & Hill, M. D. (1992) · ACM Transactions on Computer Systems · doi:10.1145/138873.138876 · Cited by 285
Cache performance of operating system and multiprogramming workloads
Agarwal, A., Hennessy, J., & Horowitz, M. (1988) · ACM Transactions on Computer Systems · doi:10.1145/48012.48037 · Cited by 268
A case for direct-mapped caches
Hill, M. D. (1988) · Computer · doi:10.1109/2.16187 · Cited by 254
Mining query logs: turning search usage data into knowledge
Silvestri, F. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000013 · Cited by 194
Metadata
- Authors
- Smith, A. J.
- Venue
- ACM Computing Surveys
- Published
- 1982-09
- Volume
- 14
- Issue
- 3
- Pages
- 473-530
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2294693415
- Cited by
- 1,722
- References
- 15
- FWCI
- 26.08
- Type
- journal article
- 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.