Memory Management — Paging Systems
Colin J. Theaker, Graham R. Brookes · 1983
In chapters 8 and 9 it was shown how the multiple base-limit system evolved in an effort to solve the problems inherent in the single base-limit register system. The problems of sharing and sparseness have largely been resolved, although in the case of dynamic sparseness the solution is not entirely satisfactory as whole segments have to be transferred in and out of memory in order to access just a single location. However, there are still problems with the segmented system, namely: (a) fragmentation and (b) a potential deadlock situation when a number of jobs are being multiprogrammed, since although all the processes have some of their segments in store, the number may not be enough to run (or at least to run efficiently).