The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
ACM Computing Surveys (CSUR)
A note on storage fragmentation and program segmentation
Communications of the ACM
Operating Systems
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
This paper examines minimum memory wastage strategies for partitioning and allocating main memory to a stream of jobs, in a context where each job resides throughout its execution in a frame to which it is assigned. In contrast to usual approaches, the present one considers core memory as the main limiting resource, and assumes that job competition for other resources can be neglected. From job mix characteristics, a condition for a given memory partition to avoid system saturation is postulated. Then, among such partitions avoiding saturation, we are interested in 1) those requiring the least amount of space, 2) those leading to the lowest core fragmentation. Concerning the first problem, we give a simple method for generating the smallest partition, and show that “exact fit” allocation should be used. As for the second problem, if a partition is given so that exact fit meets the overload constraint then this algorithm is optimal; otherwise, best fit would be the best algorithm.