Abstract
The previous three chapters have discussed the development of the memory management systems leading to a paging system. The performance of a paging system will now be considered.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
11.8 References
L.A. Belady (1966). ‘A Study of Replacement Algorithms for a Virtual-storage Computer’. IBM Systems Journal. Vol. 5, pp. 78–101.
P. Calingaert (1967). ‘System Performance Evaluation: Survey and Appraisal’, Communications of the ACM. Vol. 10, pp. 12–8.
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’. Communication of the ACM. Vol. 15, pp. 579–85.
Author information
Authors and Affiliations
Copyright information
© 1983 Colin J. Theaker and Graham R. Brookes
About this chapter
Cite this chapter
Theaker, C.J., Brookes, G.R. (1983). Memory Management — Algorithms and Performance. In: A Practical Course on Operating Systems. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-17138-5_11
Download citation
DOI: https://doi.org/10.1007/978-1-349-17138-5_11
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-34678-5
Online ISBN: 978-1-349-17138-5
eBook Packages: Computer ScienceComputer Science (R0)