Working Sets Past and Present

Author

Denning, Peter J.

Author_Institution

Department of Computer Science, Purdue University

Issue

1

fYear

1980

Firstpage

64

Lastpage

84

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.

Keywords

Dispatchers; lifetime curves; memory management; memory space-time product; multiprogrammed load controllers; multiprogramming; optimal multiprogramming; phase/transition behavior; program behavior; program locality; program measurement; stochastic program models; virtual memory; working set dispatchers; working sets; Adaptive control; Computer science; Costs; Memory management; Operating systems; Optimal control; Phase measurement; Processor scheduling; Space technology; Stochastic processes; Dispatchers; lifetime curves; memory management; memory space-time product; multiprogrammed load controllers; multiprogramming; optimal multiprogramming; phase/transition behavior; program behavior; program locality; program measurement; stochastic program models; virtual memory; working set dispatchers; working sets;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/TSE.1980.230464

Filename

1702696