Minimizing wasted space in partitioned segmentation
- 1 June 1973
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 16 (6) , 343-349
- https://doi.org/10.1145/362248.362253
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.Keywords
This publication has 5 references indexed in Scilit:
- Page size in demand-paging systemsPublished by Association for Computing Machinery (ACM) ,1973
- Virtual MemoryACM Computing Surveys, 1970
- A note on storage fragmentation and program segmentationCommunications of the ACM, 1969
- Program and Addressing Structure in a Time-Sharing EnvironmentJournal of the ACM, 1966
- A Fixed Optimum Cell-Size for Records of Various LengthsJournal of the ACM, 1965