Summary
The paper presents a multiclass network model of a demand paging computer system. The powerful class and class changing mechanism of a multiclass network are used to model the serial co-operation of user and system functions in program execution. The workload itself is modelled as a mix of programs, each with different CPU, I/O, paging and locality characteristics. The effect of paging, I/O and program termination overheads on systems performance is evaluated, as well as the transient overhead of rapid page loading upon program activation. The model is then used to compute the optimal multiprogramming level and the optimal multiprogramming mix as a function of workload composition and system overhead. The model is finally used to confirm certain heuristic load control rules proposed by Denning et al.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baskett, F., et al.: Open, closed and mixed networks of queues with different classes of customers. J. Assoc. Comput. Mach. 22, 248–260 (1975)
Belady, L.A.: A study of replacement algorithms for a virtual storage computer. IBM Systems J. 5, 78–160 (1966)
Brandwajn, A.: A model of a time shared virtual memory system solved using equivalence and decomposition methods. Acta Informat. 4, 11–47 (1974)
Brandwajn, A.: A model of a virtual memory system. Acta Informat. 6, 365–386 (1976)
Chamberlin, D., et al.: An analysts of page allocation strategies for multiprogramming systems. IBM J. Res. Develop. 17, 404–412 (1973)
Denning, P.J., et al.: Optimal multiprogramming. Acta Informat. 7, 197–216(1976)
Denning, P.J., Graham, G.S.: On the relative controllability of memory policies. Int. Symp. on Computer Performance Modelling, Measurement and Evaluation, Yorktown Heights, New York, Aug. 16–18, 1977, pp. 411–428. Amsterdam: North Holland 1977
Kritzinger, P., Krzesinski, A., Teunissen, P.: Efficient computational forms for the normalising constant and the statistical measures of mixed, multiclass queueing networks, with an application. Submitted for publication
Krzesinski, A., Gerber, S., Teunissen, P.: A multiclass network model of a multiprogramming timesharing computer system. Proc. IFIP Congress 1977, Toronto, pp. 481–486. Amsterdam: North Holland 1977
Muntz, R.R., Wong, J.: Efficient computational procedures for closed queueing networks with the product form solution. Computer Science Dept, School of Eng. and Applied Sci., Univ. of California, Los Angeles, Modelling and Measurement Note no. 17, June 1973
Reiser, M.: Numerical methods in separable queueing networks. IBM T.J. Watson Research Centre, Yorktown Heights, New York, IBM Research Report RC 5842, Feb. 1976
Sauer, C.H., Reiser, M., MacNair, E.A.: RESQ—A package for the solution of generalised queueing networks. IBM T.J. Watson Research Centre, Yorktown Heights, New York, IBM Research Report RC 6462, Nov. 1976
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Krzesinski, A., Teunissen, P. A multiclass network model of a demand paging computer system. Acta Informatica 9, 331–343 (1978). https://doi.org/10.1007/BF00289046
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289046