By Topic

Multiprogrammed memory management

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Denning, P.J. ; Purdue University, West Lafayette, Ind. ; Graham, G.S.

A queueing network is used to show that the page-fault-rate functions of active programs axe the critical factors in system processing efficiency. Properties of page-fault functions are set forth in tenns of a locality model of program behavior. Memory management policies are grouped into two fixed-partition and three variable-partition classes acording to their methods of allocating memory and controlling the multiprogramming load. It is concluded that the so-called working set policies can be expected to yield the lowest paging rates and highest processing efficiency of all the classes.

Published in:

Proceedings of the IEEE  (Volume:63 ,  Issue: 6 )