Memory Management — Paging Algorithms and Performance
In chapter 5 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 processes are being multiprogrammed, since, although all the processes have some of their segments in memory, the number may not be enough to run (or at least to run efficiently).
Unable to display preview. Download preview PDF.
6.8 References and bibliography
- J.K. Buckle (1978). The ICL2900 Series, Macmillan, London.Google Scholar
- T. Kilburn, D. Morris, J.S. Rohl and F.H. Sumner (1968). ‘A System Design Proposal’, Proceedings of the IFIP Conference, Edinburgh.Google Scholar
- D.E. Knuth (1973). The Art of Computer Programming, Volume 1 Fundamental Algorithms, Addison-Wesley, Reading, Mass.Google Scholar