Optimum choice of page sizes in a virtual memory with a hardware executive and a rapid-access secondary storage medium
暂无分享,去创建一个
A paged virtual memory system with a finite number n≥1 of page sizes, containing a hardware executive and a rapid-access secondary storage medium is considered. It is postulated that in such a system the smallest page size will be chosen small enough to render internal fragmentation negligible, and that this page size C1 will be fixed independently of the other page sizes. The problem of choosing the remaining page sizes is then cast as a problem of minimizing the bookkeeping space for page tables in the hardware executive, on the average, with the assumption that the probability distribution of segment sizes is known. The mathematical problem is solved for the uniform and exponential distributions and numerical results are given for the Poisson and an empirically determined distribution. These results indicate a rule of thumb which may be used to choose the remaining page sizes. Finally, the results are compared with paging with a single page size.
[1] Eric Wolman,et al. A Fixed Optimum Cell-Size for Records of Various Lengths , 1965, JACM.
[2] Brian Randell,et al. A note on storage fragmentation and program segmentation , 1969, CACM.
[3] David C. Wood,et al. Measurements of segment size , 1969, SOSP '69.
[4] D.C. Gunderson. Some Effects of Advances in Memory System Technology on Computer Organization , 1970, Computer.