On the Design of Bayesian Storage Allocation Algorithms for Paging and Segmentation

This short note focuses attention upon techniques for dynamic memory allocation in multiprogrammed systems which employ the addressing mechanisms of paging and segmentation. Here, event indicators and mathematical tools are presented which supply characterizations of the paging and segmentation addr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers Jg. C-18; H. 7; S. 644 - 651
Hauptverfasser: Shemer, J.E., Someshwar, Gupta, C.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.07.1969
Schlagworte:
Adaptive algorithms
demand paging
dynamic memory management
multiprogramming
operating systems
paging and segmentation
statistical software characterizations
storage allocation
time-sharing
ISSN:0018-9340
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This short note focuses attention upon techniques for dynamic memory allocation in multiprogrammed systems which employ the addressing mechanisms of paging and segmentation. Here, event indicators and mathematical tools are presented which supply characterizations of the paging and segmentation addressing processes. It is shown that these statistical characterizations form data bases which can be used to derive Bayesian storage allocation algorithms conditionally based upon usage, demand, and processing history. It is argued that these characterizations, and algorithms similar to those constructed here, provide a flexible basis for efficient memory management in multiprogrammed, and by extension, time-shared environments. Although emphasis is directed to managing primary (main) memory residence, the techniques could be extended to govern memory management for a hierarchy of storage devices.
ISSN:0018-9340
DOI:10.1109/T-C.1969.222733