Working Sets Past and Present
The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
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.
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
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 795
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-citationOrganick, E. I. (1972) · The MIT Press eBooks · Cited by 471
Denning, P. J. (1970) · ACM Computing Surveys · doi:10.1145/356571.356573 · Cited by 407
Self-citationPrinciples 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 188
Third Generation Computer Systems
Denning, P. J. (1971) · ACM Computing Surveys · doi:10.1145/356593.356595 · Cited by 142
Self-citationA Unified Approach to the Evaluation of a Class of Replacement Algorithms
Erol Gelenbe, A. (1973) · IEEE Transactions on Computers · doi:10.1109/tc.1973.5009115 · Cited by 129
Program Behavior: Models and Measurements
Spirn, J. R. (1977) · Elsevier eBooks · Cited by 125
Characteristics of program localities
Madison, A. W., & Batson, A. P. (1976) · Communications of the ACM · doi:10.1145/360051.360227 · Cited by 119
Denning, P. J., Kahn, K. C., Leroudier, J., Potier, D., & Suri, R. (1976) · Acta Informatica · doi:10.1007/bf00265771 · Cited by 71
Self-citationCold-start vs. warm-start miss ratios
Easton, M. C., & Fagin, R. (1978) · Communications of the ACM · doi:10.1145/359619.359634 · Cited by 56
Adaptive optimization of a time-sharing system's performance
Badel, M., Erol Gelenbe, A., Leroudier, J., & Potier, D. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9861 · Cited by 41
An L=S criterion for optimal multiprogramming
Denning, P. J., & Kahn, K. C. (1976) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/800200.806198 · Cited by 24
Self-citationProgram Behavior at the Symbolic Level
Batson, A. P. (1976) · Computer · doi:10.1109/c-m.1976.218436 · Cited by 18
Working Set and Page Fault Frequency Paging Algorithms: A Performance Comparison
Gupta, & Franklin (1978) · IEEE Transactions on Computers · doi:10.1109/tc.1978.1675177 · Cited by 9
Cited by
Web caching and Zipf-like distributions: evidence and implications
Breslau, L., Cao, P., Fan, L., Phillips, G., & Shenker, S. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.749260 · Cited by 3,467
Live migration of virtual machines
Clark, C. J., Fraser, K. A., Hand, S., Hansen, J. G., Jul, E., Limpach, C., Pratt, I., & Warfield, A. (2005) · doi:10.5555/1251203.1251223 · Cited by 2,562
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
Lightweight causal and atomic group multicast
Birman, K., Schiper, A., & Stephenson, P. (1991) · ACM Transactions on Computer Systems · doi:10.1145/128738.128742 · Cited by 956
Youtube traffic characterization: a view from the edge
Gill, P., Arlitt, M., Li, Z., & Mahanti, A. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298310 · Cited by 852
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
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.