Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6.8 References and bibliography
A.P. Batson, S. Ju and D. Wood (1970). ‘Measurements of Segment Size’, Communications of the ACM, Vol. 13, No. 3, pp. 155–9.
J.K. Buckle (1978). The ICL2900 Series, Macmillan, London.
P. Calingaert (1967). ‘System Performance Evaluation: Survey and Appraisal’, Communications of the ACM, Vol. 10, pp. 12–18.
W.W. Chu and H. Opderbeck (1974). ‘Performance of Replacement Algorithms with Different Page Sizes’, Computer, Vol. 7, No. 11, pp. 14–21.
R.C. Daley and J.B. Dennis (1968). ‘Virtual Memory, Processes, and Sharing in MULTICS’, Communications of the ACM, Vol. 11, pp. 306–12.
P.J. Denning (1968). ‘The Working Set Model for Program behavior’, Communications of the ACM, Vol. 11, No. 5, pp. 323–33.
T. Kilburn, D. Morris, J.S. Rohl and F.H. Sumner (1968). ‘A System Design Proposal’, Proceedings of the IFIP Conference, Edinburgh.
D.E. Knuth (1973). The Art of Computer Programming, Volume 1 Fundamental Algorithms, Addison-Wesley, Reading, Mass.
H. Lucas (1971). ‘Performance Evaluation and Monitoring’, ACM Computing Surveys, Vol. 3, pp. 79–91.
W.C. Lynch (1972). ‘Operating System Performance’, Communications of the ACM, Vol. 15, pp. 579–85.
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.
Author information
Authors and Affiliations
Copyright information
© 1993 Colin J. Theaker and Graham R. Brookes
About this chapter
Cite this chapter
Theaker, C.J., Brookes, G.R. (1993). Memory Management — Paging Algorithms and Performance. In: Concepts of Operating Systems. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-11511-2_6
Download citation
DOI: https://doi.org/10.1007/978-1-349-11511-2_6
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-52366-7
Online ISBN: 978-1-349-11511-2
eBook Packages: EngineeringEngineering (R0)