The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Working Sets Past and Present
Abstract
A program's working set is the collection of segments (or pages) recently referenced. This concept has led to efficient methods for measuring a program's intrinsic memory demand; it has assisted in undetstanding and in modeling program behavior; and it has been used as the basis of optimal multiprogrammed memory management. The total cost of a working set dispatcher is no larger than the total cost of other common dispatchers. This paper outlines the argument why it is unlikely that anyone will find a cheaper nonlookahead memory policy that delivers significantly better performance.
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
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
The working set model for program behavior
Denning, P. J. (1983) · Communications of the ACM · doi:10.1145/357980.357997 · Cited by 845
Self-citationCoffman, E. G., & Denning, P. J. (1973) · Medical Entomology and Zoology · Cited by 694
Self-citationThe working set model for program behavior
Denning, P. J. (1968) · Communications of the ACM · doi:10.1145/363095.363141 · Cited by 662
Self-citationDenning, P. J. (1970) · ACM Computing Surveys · doi:10.1145/356571.356573 · Cited by 407
Self-citationThe multics system: an examination of its structure
(1972) · Cited by 386
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
Self-citationKilburn, T., Edwards, D. B. G., Lanigan, M. J., & Sumner, F. H. (1962) · IEEE Transactions on Electronic Computers · doi:10.1109/tec.1962.5219356 · Cited by 256
Segmentation and the Design of Multiprogrammed Computer Systems
Dennis, J. B. (1965) · Journal of the ACM · doi:10.1145/321296.321310 · Cited by 153
Cited by
Milojičić, D. S., Douglis, F., Paindaveine, Y., Wheeler, R., & Zhou, S. (2000) · ACM Computing Surveys · doi:10.1145/367701.367728 · Cited by 470
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
- Denning, P. J.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 1980-01
- Volume
- SE-6
- Issue
- 1
- Pages
- 64-84
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W2088257029
- Cited by
- 396
- References
- 20
- FWCI
- 36.06
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Working Sets Past and Present. https://app.cochat.ai/papers/10.1109/tse.1980.230464
- The paper
- Denning, P. J. (1980). Working Sets Past and Present. IEEE Transactions on Software Engineering. https://doi.org/10.1109/tse.1980.230464
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.
