Memory allocation in paging systems

Abstract

We discuss in this paper three major problems related to the allocation of memory resources in paging systems. These are the problems of deciding how best to distribute program code and data into pages (pagination), of deciding which pages residing in main memory should next be removed (replacement), and of deciding how many pages of each of several competing programs should be permitted in main memory (allotment). We do not provide definitive solutions to these problems, as indeed no one has as yet. Instead, we suggest novel approaches to the problems, based primarily on their interrelationships, and describe specific techniques to illustrate our ideas. Our main contention is that a joint consideration of these problems is feasible and more realistic and would lead ultimately to practical and more efficient solutions.