Thumbnail
Access Restriction
Subscribed

Author Boekhorst, J. C. A. ♦ Kessels, J. L. W. ♦ Gelenbe, Erol
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Segmentation ♦ Virtual memory ♦ Multiple page sizes ♦ Paging ♦ Dynamic storage allocation ♦ Fragmentation
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.
Description Affiliation: Univ. of Michigan, Ann Arbor (Gelenbe, Erol) || Philips Research Labs., Eindhoven, The Netherlands (Boekhorst, J. C. A.; Kessels, J. L. W.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 16
Issue Number 6
Page Count 7
Starting Page 343
Ending Page 349


Open content in new tab

   Open content in new tab
Source: ACM Digital Library