Memory Management — Paging Algorithms and Performance

  • Colin J. Theaker
  • Graham R. Brookes
Part of the Macmillan Computer Science Series book series (COMPSS)


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.

Unable to display preview. Download preview PDF.

6.8 References and bibliography

  1. A.P. Batson, S. Ju and D. Wood (1970). ‘Measurements of Segment Size’, Communications of the ACM, Vol. 13, No. 3, pp. 155–9.CrossRefGoogle Scholar
  2. J.K. Buckle (1978). The ICL2900 Series, Macmillan, London.Google Scholar
  3. P. Calingaert (1967). ‘System Performance Evaluation: Survey and Appraisal’, Communications of the ACM, Vol. 10, pp. 12–18.CrossRefGoogle Scholar
  4. W.W. Chu and H. Opderbeck (1974). ‘Performance of Replacement Algorithms with Different Page Sizes’, Computer, Vol. 7, No. 11, pp. 14–21.CrossRefGoogle Scholar
  5. R.C. Daley and J.B. Dennis (1968). ‘Virtual Memory, Processes, and Sharing in MULTICS’, Communications of the ACM, Vol. 11, pp. 306–12.CrossRefGoogle Scholar
  6. P.J. Denning (1968). ‘The Working Set Model for Program behavior’, Communications of the ACM, Vol. 11, No. 5, pp. 323–33.CrossRefGoogle Scholar
  7. T. Kilburn, D. Morris, J.S. Rohl and F.H. Sumner (1968). ‘A System Design Proposal’, Proceedings of the IFIP Conference, Edinburgh.Google Scholar
  8. D.E. Knuth (1973). The Art of Computer Programming, Volume 1 Fundamental Algorithms, Addison-Wesley, Reading, Mass.Google Scholar
  9. H. Lucas (1971). ‘Performance Evaluation and Monitoring’, ACM Computing Surveys, Vol. 3, pp. 79–91.CrossRefGoogle Scholar
  10. W.C. Lynch (1972). ‘Operating System Performance’, Communications of the ACM, Vol. 15, pp. 579–85.CrossRefGoogle Scholar
  11. R.L. Mattson, J. Gecsei, D.R. Slutz and I.L. Traiger (1970). ‘Evaluation Techniques for Storage Hierarchies’, IBM Systems Journal, Vol. 9, No. 2, pp. 78–117.CrossRefGoogle Scholar

Copyright information

© Colin J. Theaker and Graham R. Brookes 1993

Authors and Affiliations

  • Colin J. Theaker
    • 1
  • Graham R. Brookes
    • 2
  1. 1.Staffordshire UniversityUK
  2. 2.Hull UniversityUK

Personalised recommendations