The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
The working set model for program behavior
Open accessAbstract
Probably the most basic reason behind the absence of a general treatment of resource allocation in modern computer systems is an adequate model for program behavior. In this paper a new model, the “working set model,” is developed. The working set of pages associated with a process, defined to be the collection of its most recently used pages, provides knowledge vital to the dynamic management of paged memories. “Process” and “working set” are shown to be manifestations of the same ongoing computational activity; then “processor demand” and “memory demand” are defined; and resource allocation is formulated as the problem of balancing demands against available equipment.
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
Programming semantics for multiprogrammed computations
Dennis, J. B., & Van Horn, E. C. (1983) · Communications of the ACM · doi:10.1145/357980.357993 · Cited by 676
Programming semantics for multiprogrammed computations
Dennis, J. B., & Van Horn, E. C. (1966) · Communications of the ACM · doi:10.1145/365230.365252 · Cited by 575
Kilburn, 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
The Challenge of the Computer Utility
Ellison, F., & Parkhill, D. F. (1967) · OR · doi:10.2307/3006988 · Cited by 163
Segmentation and the Design of Multiprogrammed Computer Systems
Dennis, J. B. (1965) · Journal of the ACM · doi:10.1145/321296.321310 · Cited by 153
An optimization model for time-sharing
Fife, D. W. (1966) · AFIPS Spring Joint Computer Conference (SJCC) · doi:10.1145/1464182.1464193 · Cited by 16
Cited by
The SPLASH-2 programs: characterization and methodological considerations
Woo, S. C., Ohara, M., Torrie, E., Singh, J. P., & Gupta, A. (1995) · Proceedings of the 22nd annual international symposium on Computer architecture - ISCA '95 · doi:10.1145/223982.223990 · Cited by 3,624
Smith, A. J. (1982) · ACM Computing Surveys · doi:10.1145/356887.356892 · Cited by 1,722
EXPERT SYSTEMS WITH APPLICATIONS
(2005) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.10.010 · Cited by 1,656
Discovery of Frequent Episodes in Event Sequences
Mannila, H., Toivonen, H., & Inkeri Verkamo, A. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009748302351 · Cited by 1,463
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
Systems Development in Information Systems Research
Nunamaker, J. F., Chen, M., & Purdin, T. D. M. (1990) · Journal of Management Information Systems · doi:10.1080/07421222.1990.11517898 · Cited by 1,215
Qureshi, M., & Patt, Y. (2006) · 2006 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'06) · doi:10.1109/micro.2006.49 · Cited by 1,094
Hierarchical geometric models for visible surface algorithms
Clark, J. H. (1976) · Communications of the ACM · doi:10.1145/360349.360354 · Cited by 778
Data mining techniques and applications – A decade review from 2000 to 2011
Liao, S.-H., Chu, P.-H., & Hsiao, P.-Y. (2012) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.02.063 · Cited by 665
Henderson, D. A., & Card, S. (1986) · ACM Transactions on Graphics · doi:10.1145/24054.24056 · Cited by 522
Jiang, S., & Zhang, X. (2002) · Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/511334.511340 · Cited by 489
FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness
Dao, T., Fu, D. Y., Ermon, S., Rudra, A., & Ré, C. (2022) · arXiv · doi:10.48550/arxiv.2205.14135 · Cited by 1,214
“We draw the most direct connection to the literature of analyzing I/O complexity in this work [1], but concepts of memory hierarchies are fundamental and has appeared in many forms, from the working set model [20], to data locality [83], to the Roofline model of arithmetic intensity [82], to analyses of scalability [5…”
MethodPost-copy based live virtual machine migration using adaptive pre-paging and dynamic self-ballooning
Hines, M. R., & Gopalan, K. (2009) · Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments · doi:10.1145/1508293.1508301 · Cited by 409
Denning, P. J. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.230464 · Cited by 396
Self-citationCFLRU: a replacement algorithm for flash memory
Park, S.-Y., Jung, D., Kang, J.-U., Kim, J.-S., & Lee, J. (2006) · Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems · doi:10.1145/1176760.1176789 · Cited by 385
Post-copy live migration of virtual machines
Hines, M. R., Deshpande, U., & Gopalan, K. (2009) · ACM SIGOPS Operating Systems Review · doi:10.1145/1618525.1618528 · Cited by 369
Cooperative Caching for Chip Multiprocessors
Chang, J., & Sohi, G. S. (2006) · ACM SIGARCH Computer Architecture News · doi:10.1145/1150019.1136509 · Cited by 355
Agarwal, A., Hennessy, J., & Horowitz, M. (1989) · ACM Transactions on Computer Systems · doi:10.1145/63404.63407 · Cited by 304
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-citationPage 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
Denning, P. J. (2005) · Communications of the ACM · doi:10.1145/1070838.1070856 · Cited by 277
Self-citationCache 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
Albers, S. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0436-0 · Cited by 259
Competitive Caching with Machine Learned Advice
Lykouris, T., & Vassilvitskii, S. (2021) · Journal of the ACM · doi:10.1145/3447579 · Cited by 172
Metadata
- Authors
- Denning, P. J.
- Venue
- Communications of the ACM
- Published
- 1983-01
- Volume
- 26
- Issue
- 1
- Pages
- 43-48
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2142098074
- Cited by
- 845
- References
- 7
- FWCI
- 25.38
- 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
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.