Dynamic memory repacking

Authors:
E. Balkovich;W. Chiu;L. Presser;R. Wood
Affiliations:
Univ. of California, Santa Barbara;Univ. of California, Santa Barbara;Univ. of California, Santa Barbara;Univ. of California, Santa Barbara
Venue:
Communications of the ACM
Year:
1974

Citing 8
Cited 0

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Probability Models for Multiprogramming Computer Systems

Journal of the ACM (JACM)
Comments on a Paper by Gaver

Journal of the ACM (JACM)
Virtual Memory

ACM Computing Surveys (CSUR)
Linkers and Loaders

ACM Computing Surveys (CSUR)
An analysis of some time-sharing techniques

Communications of the ACM
Mathematical models of multiprogrammed computer systems

Mathematical models of multiprogrammed computer systems
Analysis and applications of probabilistic models of multiprogrammed computer systems.

Analysis and applications of probabilistic models of multiprogrammed computer systems.

Quantified Score

Hi-index	48.22

Visualization

Abstract

A probabilistic model of a multiprogramming system is exercised in order to determine the conditions under which the dynamic repacking of main memory is beneficial. An expression is derived for the maximum interference that a repacking process may introduce before the original performance of the system is degraded. Alternative approaches to repacking are discussed, and the operating conditions that lead to improved system throughput through repacking are delineated.