The DOI matches its Crossref record.
Principles of Optimal Page Replacement
Open accessAbstract
ABSTP~CT.A formal model is presented for paging algorithms under /-order nonstationary assumptions about program behavior.When processing a program under paging in a given memory, a given paging policy generates a certain (expected) number of page calls, i.e., its "cost."Under usual assumptions about memory system organization, minimum cost is always achieved by a demand paging algorithm.The minimum cost for /-order program behavior assumptions is expressed as a dynamic programming problem whose solution yields an optimal replacement algorithm.Solutions are exhibited in several 0-order cases of interest.Paging algorithms that implement and approximate the minimum cost are discussed.
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
Cited by
Denning, P. J. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.230464 · Cited by 396
Self-citationAgarwal, A., Hennessy, J., & Horowitz, M. (1989) · ACM Transactions on Computer Systems · doi:10.1145/63404.63407 · Cited by 304
Outperforming LRU with an adaptive replacement cache algorithm
Megiddo, N., & Modha, D. S. (2004) · Computer · doi:10.1109/mc.2004.1297303 · Cited by 243
Metadata
- Authors
- Aho, A. V., Denning, P. J., & Ullman, J. D.
- Venue
- Journal of the ACM
- Published
- 1971-01
- Volume
- 18
- Issue
- 1
- Pages
- 80-93
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1985264830
- Cited by
- 289
- References
- 0
- FWCI
- 13.23
- 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: Principles of Optimal Page Replacement. https://app.cochat.ai/papers/10.1145/321623.321632
- The paper
- Aho, A. V., Denning, P. J., & Ullman, J. D. (1971). Principles of Optimal Page Replacement. Journal of the ACM. https://doi.org/10.1145/321623.321632
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.
