Abstract
This note presents a queueing model of a paged multiprogrammed computer system. The behavior of a process acquiring pages after admission into primary memory is explicitly taken into account. An approximate analysis of the model is carried out under exponential assumptions on service times. The numerical results obtained from the model are used to study optimal multiprogramming in a page-on-demand system.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Belady, L.A., Kuehner, C.J.: Dynamic space sharing in computer systems. Comm. ACM 12, 5, 282–288 (1969).
Denning, P.J., Kahn, K.C.: An L = S criterion for optimal multiprogramming. Proc. Int. Symp. on Computer Performance Modeling, Measurement and Evaluation, March 29–31, 1976, Harvard University, 219–229.
Brandwajn, A., Buzen, J., Gelenbe, E., Potier, D.: A model of performance for virtual memory systems. Proc. ACM SIGMETRICS Symp., October 1974, 9.
Chamberlin, D., Fuller, S., Liu, L.: An analysis of page allocation strategies for multiprogramming systems with virtual memory. IBM J. Res. and Develop., 17, 404–412 (1973).
Denning, P.J., et al.: Optimal multiprogramming. Acta Informatica 7, 197–216 (1976).
Smith, J.L.: Multiprogramming under a page on demand strategy. Comm. ACM 10, 10, 636–646 (1967).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Brandwajn, A. (1977). A Study of a Page-On-Demand System. In: Spies, P.P. (eds) Modelle für Rechensysteme. Informatik — Fachberichte, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45499-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-45499-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08206-4
Online ISBN: 978-3-642-45499-8
eBook Packages: Springer Book Archive