article

Free access

Properties of the working-set model

Authors:

Peter J. Denning,

Stuart C. SchwartzAuthors Info & Claims

Communications of the ACM, Volume 15, Issue 3

Pages 191 - 198

https://doi.org/10.1145/361268.361281

Published: 01 March 1972 Publication History

Abstract

A program's working set W(t, T) at time t is the set of distinct pages among the T most recently referenced pages. Relations between the average working-set size, the missing-page rate, and the interreference-interval distribution may be derived both from time-average definitions and from ensemble-average (statistical) definitions. An efficient algorithm for estimating these quantities is given. The relation to LRU (lease recently used) paging is characterized. The independent-reference model, in which page references are statistically independent, is used to assess the effects of interpage dependencies on working-set size observations. Under general assumptions, working-set size is shown to be normally distributed.

References

[1]

Aho, A., Denning, P., and Ullman, J. Principles of optimal page replacement. J. ACM 18, 1 (Jan. 1971), 80-93.

Digital Library

[2]

Belady, L. A study of replacement algorithms for virtual storage computers. IBM Syst. J. 5, 2 (1966), 78-101.

Digital Library

[3]

Brawn, B., and Gustavson, F. Program behavior in a paging environment. Proc. AFIPS 1968 FJCC Vol. 33, Pt. 2, AFIPS Press, Montvale, N.J., pp. 1019-1032.

[4]

Coffman, E.G. Jr., and Wood, R.C. lnterarrival statistics for time sharing systems. Comm. ACM 9, 7 (July 1966), 500-503.

Digital Library

[5]

Coffman, E.G. Jr., and Ryan, T. A study of storage partitioning using a mathematical model of locality. Comm. ACM 15, 3 (Mar. 1972), 185-190.

Digital Library

[6]

Denning, P. The working set model for program behavior. Comm. ACM5, 11 (May 1968), 323-333.

Digital Library

[7]

Denning, P. Resource allocation in multiprocess computer systems. MIT Project MAC Rep. MAC-TR-50 (May 1968), Ph.D. th.

Digital Library

[8]

Denning, P. Virtual memory. Computing Surveys 2, 3 (Sept. 1970), 153-189.

Digital Library

[9]

Doherty, W. Scheduling TSS/360 for responsiveness. Proc. AFIPS 1970 FJCC Vol. 37, AFIPS Press, Montvale, N.J., pp. 97-112.

[10]

Fuchs, E., and Jackson, P.E. Estimates of distributions of random variables for certain computer communications traffic models. Comm. ACM 13, 12 (Dec. 1970), 752-757.

Digital Library

[11]

Liptay, J. The cache, lBMSyst. J. 7, 1 (1968), 15-21.

[12]

Mattson, R., Gecsei, J., Slutz, D., and Traiger, I. Evaluation techniques for storage hierarchies. IBM Syst. J. 9, 2 (1970), 78-117.

Digital Library

[13]

Rosenblatt, M. A central limit theorem and a strong mixing condition. Proc. Nat. Acad. Sci. 42 (1956), 43-47.

[14]

Sayre, D. Is automatic folding of programs efficient enough to displace manual? Comm. ACM 12, 12 (Dec. 1969), 656-660.

Digital Library

[15]

Yaglom, A.M. Stationary Random Functions. Prentice-Hall, Englewood Cliffs, N.J., 1962.

[16]

Weizer, N., and Oppenheimer, G. Virtual memory management in a paging environment. Proc. 1969 SJCC Vol. 34, AFIPS Press, Montvale, N.J., p. 234.

Cited By

Denning P(2021)Working Set AnalyticsACM Computing Surveys10.1145/339970953:6(1-36)Online publication date: 2-Feb-2021
https://dl.acm.org/doi/10.1145/3399709
Lebeck NKrishnamurthy ALevy HZhang IGavrilovska AZadok E(2020)End the senseless killingProceedings of the 2020 USENIX Conference on Usenix Annual Technical Conference10.5555/3489146.3489206(873-887)Online publication date: 15-Jul-2020
https://dl.acm.org/doi/10.5555/3489146.3489206
Alfares NKesidis GLi XUrgaonkar BKandemir MKonstantopoulos T(2020)On a Caching System with Object SharingProceedings of the International Workshop on Middleware and Applications for the Internet of Things10.1145/3429881.3430107(1-6)Online publication date: 7-Dec-2020
https://dl.acm.org/doi/10.1145/3429881.3430107
Show More Cited By

Recommendations

Working Set Analytics
Invited Tutorial and Regular Papers

The working set model for program behavior was invented in 1965. It has stood the test of time in virtual memory management for over 50 years. It is considered the ideal for managing memory in operating systems and caches. Its superior performance was ...
An Associativity Threshold Phenomenon in Set-Associative Caches
SPAA '23: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures

In an α-way set-associative cache, the cache is partitioned into disjoint sets of size α, and each item can only be cached in one set, typically selected via a hash function. Set-associative caches are widely used and have many benefits, e.g., in terms ...
Internal Scheduling and Memory Contention

It has been suggested that the algorithm used to schedule those processes active and in main memory can have an effect on memory contention. We create models for memory contention in a system that uses global LRU replacement and either round robin or ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Communications of the ACM

Communications of the ACM Volume 15, Issue 3

March 1972

69 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/361268

Editor:
M. Stuart Lynn
Rice Univ., Houston, TX

Issue’s Table of Contents

Copyright © 1972 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1972

Published in CACM Volume 15, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

205
Total Citations
View Citations
1,548
Total Downloads

Downloads (Last 12 months)205
Downloads (Last 6 weeks)41

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Denning P(2021)Working Set AnalyticsACM Computing Surveys10.1145/339970953:6(1-36)Online publication date: 2-Feb-2021
https://dl.acm.org/doi/10.1145/3399709
Lebeck NKrishnamurthy ALevy HZhang IGavrilovska AZadok E(2020)End the senseless killingProceedings of the 2020 USENIX Conference on Usenix Annual Technical Conference10.5555/3489146.3489206(873-887)Online publication date: 15-Jul-2020
https://dl.acm.org/doi/10.5555/3489146.3489206
Alfares NKesidis GLi XUrgaonkar BKandemir MKonstantopoulos T(2020)On a Caching System with Object SharingProceedings of the International Workshop on Middleware and Applications for the Internet of Things10.1145/3429881.3430107(1-6)Online publication date: 7-Dec-2020
https://dl.acm.org/doi/10.1145/3429881.3430107
Feldmann MScheideler CSchmid S(2020)Survey on Algorithms for Self-stabilizing Overlay NetworksACM Computing Surveys10.1145/339719053:4(1-24)Online publication date: 11-Jul-2020
https://dl.acm.org/doi/10.1145/3397190
Ali ICaprolu MPietro R(2020)Foundations, Properties, and Security Applications of PuzzlesACM Computing Surveys10.1145/339637453:4(1-38)Online publication date: 20-Aug-2020
https://dl.acm.org/doi/10.1145/3396374
Ngamakeur KYongchareon SYu JRehman S(2020)A Survey on Device-free Indoor Localization and Tracking in the Multi-resident EnvironmentACM Computing Surveys10.1145/339630253:4(1-29)Online publication date: 11-Jul-2020
https://dl.acm.org/doi/10.1145/3396302
Yuan LDing CSmith WDenning PZhang Y(2019)A Relational Theory of LocalityACM Transactions on Architecture and Code Optimization10.1145/334110916:3(1-26)Online publication date: 20-Aug-2019
https://dl.acm.org/doi/10.1145/3341109
Li PPronovost CWilson WTait BZhou JDing CCriswell JBahar IHerlihy MWitchel ELebeck A(2019)Beating OPT with Statistical Clairvoyance and Variable Size CachingProceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3297858.3304067(243-256)Online publication date: 4-Apr-2019
https://dl.acm.org/doi/10.1145/3297858.3304067
Chen HZhang YCaramanis MCoskun A(2019)EnergyQAREACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/32431724:1(1-31)Online publication date: 24-Jan-2019
https://dl.acm.org/doi/10.1145/3243172
Yuan LSmith WFan SChen ZDing CZhang Y(2019)Footmark: A New Formulation for Working Set StatisticsLanguages and Compilers for Parallel Computing10.1007/978-3-030-34627-0_5(61-69)Online publication date: 13-Nov-2019
https://doi.org/10.1007/978-3-030-34627-0_5
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents