Summary
A queueing network model of a time-sharing multiprogramming virtual memory system is presented including the effect of memory sharing among processes. An approximate explicit solution is obtained using equivalence and decomposition methods.
The influence of system and program behaviour parameters on system performance (mean response time and CPU utilization) is illustrated in the results obtained. The efficiency of controlling the degree of multiprogramming in order to prevent thrashing is also studied using a similar model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Moore, C. G.: Network models for large scale time-sharing systems. University of Michigan, Ph. D. Thesis, 1971
Buzen, J.: Queueing network models of multiprogramming. Harvard University, Ph. D. Thesis, 1971
Arora, S. R., Gallo, A.: The optimal organization of multiprogrammed multilevel memory. Proc. ACM-SIGOPS Workshop on System Performance Evaluation, Harvard University, April 1971, p. 104–141
Scherr, A. L.: An analysis of time-shared computer systems. Cambridge (Mass.):M.I.T. Press 1967
Sekino, A.: Throughput analysis of multiprogrammed virtual-memory computer systems. 1st Annual SICME Symposium on Measurement and Evaluation, Palo Alto, 1973, p. 47–53
Jackson, J. R.: Jobshop-like queueing systems. Management Science 10, 131–142 (1963)
Muntz, R. R., Baskett, F.: Open, closed and mixed networks of queues with different classes of customers. Stanford Electronic Laboratories, Technical Report No. 33, August 1972
Belady, L., Kuehner, C. J.: Dynamic space sharing in computer systems. Comm. ACM 12, 282–288 (1969)
Saltzer, J. H.: A simple linear model of demand paging performance. Massachusetts Institute of Technology, Project MAC Report (to appear)
Chamberlin, D., Fuller, S., Liu, L.: An analysis of page allocation strategies for multiprogramming systems with virtual memory. IBMJ. R and D, September 1973
Simon, H., Ando, A.: Aggregation of variables in dynamic systems. Econometrica 20, 111–138 (1961)
Ando, A., Fisher, F.M.: Near-decomposability, partition and aggregation, and the relevance of stability discussions. International Economic Review 4, 53–67 (1963)
Courtois, P.: On the near-complete-decomposability of networks of queues and of stochastic models of multiprogramming computing systems. Carnegie Melon University, November 1971
Little, J. D.: A proof of the queueing formula L = λW. Operations Research 9, 383–387 (1961)
Brandwajn, A.: Control schemes in queueing networks. Submitted for publication in Management Science
Saaty, T. L.: Elements of queueing theory. New York: MacGraw-Hill 1961
Brandwajn, A., Gelenbe, E., Potier, D., Lenfant, J.: Modèle de système multiprogrammé à mémoire virtuelle paginée. Compte rendu des Journées d'Etudes sur les Recherches en Mesure, Simulation, Modélisation des Systèmes Informatiques, Toulouse (France), 1973, p. 138–153
Gelenbe, E., Potier, D., Brandwajn, A., Lenfant, J.: Gestion optimale d'un ordinateur multiprogrammé à mémoire virtuelle. 5th Conference on Optimization Techniques, Rome, 1971, p. 132–143
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Brandwajn, A. A model of a time sharing virtual memory system solved using equivalence and decomposition methods. Acta Informatica 4, 11–47 (1974). https://doi.org/10.1007/BF00288934
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288934