Dynamic storage partitioning

Authors:
Peter J. Denning;Jeffrey R. Spirn
Affiliations:
Department of Computer Sciences, Purdue University, W. Lafayette, IN;Division of Engineering, Brown University, Providence, RI
Venue:
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
Year:
1973

Citing 3
Cited 5

Dynamic space-sharing in computer systems

Communications of the ACM
Further experimental data on the behavior of programs in a paging environment

Communications of the ACM
Program locality and dynamic memory management.

Program locality and dynamic memory management.

An Approach to Program Behavior Modeling and Optimal Memory Control

Journal of the ACM (JACM)
Bibliography on paging and related topics

ACM SIGOPS Operating Systems Review
Multiprogramming and program behavior

SIGMETRICS '74 Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation
An analysis of a use bit page replacement algorithm

ACM '75 Proceedings of the 1975 annual conference
Study of memory partitioning for multiprogramming systems with virtual memory

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

A model of paged multiprogramming computer systems using variable storage partitioning is considered. A variable storage partitioning policy is one which allocates storage among the active tasks according to a sequence of fixed partitions of main storage. The basic result obtained is, mean processing efficiency is increased and mean fault-rate decreased under a variable partition, provided that the curves of efficiency and fault-rate as a function of allocated space are concave up.