The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
An analytical cache model
Open accessAbstract
Trace-driven simulation and hardware measurement are the techniques most often used to obtain accurate performance figures for caches. The former requires a large amount of simulation time to evaluate each cache configuration while the latter is restricted to measurements of existing caches. An analytical cache model that uses parameters extracted from address traces of programs can efficiently provide estimates of cache performance and show the effects of varying cache parameters. By representing the factors that affect cache performance, we develop an analytical model that gives miss rates for a given trace as a function of cache size, degree of associativity, block size, subblock size, multiprogramming level, task switch interval, and observation interval. The predicted values closely approximate the results of trace-driven simulations, while requiring only a small fraction of the computation cost.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Smith, A. J. (1982) · ACM Computing Surveys · doi:10.1145/356887.356892 · Cited by 1,722
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
(1984) · Prentice-Hall, Inc eBooks · Cited by 1,141
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
Using cache memory to reduce processor-memory traffic
Goodman, J. R. (1998) · doi:10.1145/285930.285984 · Cited by 395
Principles of Optimal Page Replacement
Aho, A. V., Denning, P. J., & Ullman, J. D. (1971) · Journal of the ACM · doi:10.1145/321623.321632 · Cited by 289
ATUM: a new technique for capturing address traces using microcode
Agarwal, A. K., Sites, R. L., & Horowitz, M. (1986) · ACM SIGARCH Computer Architecture News · doi:10.1145/17356.17370 · Cited by 196
Self-citationProgram Behavior: Models and Measurements
Spirn, J. R. (1977) · Elsevier eBooks · Cited by 125
Smith, A. J. (1978) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1978.231482 · Cited by 113
Cited by
Evaluating associativity in CPU caches
Hill, M. D., & Smith, A. J. (1989) · IEEE Transactions on Computers · doi:10.1109/12.40842 · Cited by 606
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
Metadata
- Authors
- Agarwal, A., Hennessy, J., & Horowitz, M.
- Venue
- ACM Transactions on Computer Systems
- Published
- 1989-05
- Volume
- 7
- Issue
- 2
- Pages
- 184-215
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2144954274
- Cited by
- 304
- References
- 12
- FWCI
- 8.33
- Type
- journal article
- Language
- en
- Open access
- bronze
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: An analytical cache model. https://app.cochat.ai/papers/10.1145/63404.63407
- The paper
- Agarwal, A., Hennessy, J., & Horowitz, M. (1989). An analytical cache model. ACM Transactions on Computer Systems. https://doi.org/10.1145/63404.63407
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.
