Dynamic partitioning of the main memory using the working set concept

Authors:
M. Z. Ghanem
Affiliations:
IBM Thomas J. Watson Research Center, Yorktown Heights, New York
Venue:
IBM Journal of Research and Development
Year:
1975

Citing 7
Cited 0

A study of storage partitioning using a mathematical model of locality

Communications of the ACM
Properties of the working-set model

Communications of the ACM
A model of memory contention in a paging machine

Communications of the ACM
Dynamic space-sharing in computer systems

Communications of the ACM
The working set model for program behavior

Communications of the ACM
On modeling program behavior

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
The page fault frequency replacement algorithm

AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm to divide the main memory among N competing programs with different characteristics, running in a multiprogramming and virtual memory environment, is proposed. The algorithm is based on an optimal allocation policy, which is derived in this paper, using the concept of the working set. A brief description of the hardware implementation of the algorithm is also presented. It is shown that under this optimal allocation policy "the value of a page-frame" (the amount of reduction in the page fault rate if an additional page frame is allocated to that program) to each program is the same.