Home → Magazine Archive → June 1973 (Vol. 16, No. 6) → Minimizing wasted space in partitioned segmentation → Abstract

Minimizing wasted space in partitioned segmentation

By Erol Gelenbe, J. C. A. Boekhorst, J. L. W. Kessels

Communications of the ACM, Vol. 16 No. 6, Pages 343-349

A paged virtual memory system using a finite number of page sizes is considered. Two algorithms for assigning pages to segments are discussed. Both of these algorithms are simple to implement. The problem of choosing the page sizes to minimize the expected value of total wasted space in internal fragmentation and in a page table, per segment, is then solved for a probability density function of segment size which may be expressed as a convex combination of Erlang densities.

The full text of this article is premium content


No entries found