The working set model for program behavior

Authors:
Peter J. Denning
Affiliations:
-
Venue:
SOSP '67 Proceedings of the first ACM symposium on Operating System Principles
Year:
1967

Citing 7
Cited 6

Segmentation and the Design of Multiprogrammed Computer Systems

Journal of the ACM (JACM)
Program and Addressing Structure in a Time-Sharing Environment

Journal of the ACM (JACM)
Programming semantics for multiprogrammed computations

Communications of the ACM
Dynamic program behavior under paging

ACM '66 Proceedings of the 1966 21st national conference
The analytic design of a dynamic look ahead and program segmenting system for multiprogrammed computers

ACM '66 Proceedings of the 1966 21st national conference
PROGRAM STRUCTURE IN A MULTI-ACCESS COMPUTER

PROGRAM STRUCTURE IN A MULTI-ACCESS COMPUTER
TRAFFIC CONTROL IN A MULTIPLEXED COMPUTER

TRAFFIC CONTROL IN A MULTIPLEXED COMPUTER

Exploiting Program Branch Probabilities in Hardware Compilation

IEEE Transactions on Computers
The implications of working set analysis on supercomputing memory hierarchy design

Proceedings of the 19th annual international conference on Supercomputing
On the Memory Access Patterns of Supercomputer Applications: Benchmark Selection and Its Implications

IEEE Transactions on Computers
CRAMM: virtual memory support for garbage-collected applications

OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Dynamic scratchpad memory management for code in portable systems with an MMU

ACM Transactions on Embedded Computing Systems (TECS)
Satori: enlightened page sharing

USENIX'09 Proceedings of the 2009 conference on USENIX Annual technical conference

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 is developed, the “working set model”, which enables us to decide which information is in use by a running program and which is not. Such knowledge is vital for dynamic management of paged memories. The working set of pages associated with a process, defined to be the collection of its most recently used pages, is a useful allocation concept. A proposal for an easy-to-implement allocation policy is set forth; this policy is unique, inasmuch as it blends into one decision function the heretofore independent activities of process-scheduling and memory-management.