Minimizing wasted space in partitioned segmentation

Authors:
Erol Gelenbe;J. C. A. Boekhorst;J. L. W. Kessels
Affiliations:
Univ. of Michigan, Ann Arbor;Philips Research Labs., Eindhoven, The Netherlands;Philips Research Labs., Eindhoven, The Netherlands
Venue:
Communications of the ACM
Year:
1973

Citing 5
Cited 4

A Fixed Optimum Cell-Size for Records of Various Lengths

Journal of the ACM (JACM)
Program and Addressing Structure in a Time-Sharing Environment

Journal of the ACM (JACM)
Virtual Memory

ACM Computing Surveys (CSUR)
A note on storage fragmentation and program segmentation

Communications of the ACM
Page size in demand-paging systems

SIGME '73 Proceedings of the 1973 ACM SIGME symposium

Performance Measurement and Modeling to Evaluate Various Effects on a Shared memory Multiprocessor

IEEE Transactions on Software Engineering
Anomalous behavior of the fifty-percent rule in dynamic memory allocation

Communications of the ACM
Page size in demand-paging systems

SIGME '73 Proceedings of the 1973 ACM SIGME symposium
An Interview with Erol Gelenbe

Ubiquity

Quantified Score

Hi-index	48.23

Visualization

Abstract

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.