Summary
We define and analyse in this paper the concept of modified life time function. This concept is introduced in order to take into account both internal and external factors which influence the mean time between page faults of a program executing on a page-on-demand multiprogramming system. The analysis is based on a probabilistic model of a program paging activity during its execution. The intrinsic behaviour of the program in its adress space as well as the memory allotment and the swapping policy are considered in the model, and the interactions of these different factors are analysed. The results point out that the influence of the external factors on the life time function of a program is significant, and provide some insight on the non-convex shape of observed life time functions. Numerical illustrations are presented, and it is shown that the analysis can be used to quantify the performance of preloading policies.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adams, M. C., Millard, G. E.: Performance measurements on the Edinburgh Multi Access System (EMAS). Proc. International Computing Symposium 75, Antibes, June 1975
Badel, M., Gelenbe, E., Leroudier, J., Potier, D.: Adaptive optimization of a time sharing system's performance. Proc. IEEE 63, 958–965 (1975)
Bard, Y.: An analytic model of CP-67 and VM/370. Proc. ACM SIGARCH-SIGOPS Workshop on Virtual Computer Systems, 1973, pp. 170–176
Baskett, F., Chandy, K. M., Muntz, R. R., Palacios, F. G.: Open, closed and mixed networks of queues with different classes of customers. J. Assoc. Comput. Mach. 22, 248–260 (1976)
Belady, L.A., Kuehner, C.J.: Dynamic space sharing in computer systems. Comm. ACM 12, 282–288 (1969)
Buzen, J. P., Potier, D.: Accuracy of the exponential assumptions in closed queueing models. IRIA-Laboria, Rapport de Recherche, June 1977
Buzen, J. P.: Queueing network models of multiprogramming. Harvard University, Ph. D. Thesis, 1971
Courtois, P. J., Vantilborgh, H.: A decomposable model of program paging behaviour. Acta Informat. 6, 257–275 (1977)
Denning, P. J., Kahn, K.: A study of program locality and lifetime functions. Proc. 5th ACM Symp. on Operating System Principles November 1975, pp. 207–216
Denning, P. J., Kahn, K. C., Leroudier, J., Potier, D., Suri, R.: Optimal multiprogramming. Acta Informat. 7, 197–216 (1976)
Easton, M. C., Fagin, R.: Cold start vs. warm start miss ratios and multiprogramming performance. IBM T. J. Watson Research Center, Yorktown Heights (N.Y.), Report RC 5715, November 1975
Gelenbe, E.: An unified approach to the evaluation of a class of replacement algorithms. IEEE Trans. Computers 22, 611–618 (1973)
Leroudier, J., Potier, D.: Principles of optimality for multiprogramming. Proc. Int'l Symp. on Computer Performance Modeling, Measurement and Evaluation ACM-SIGMETRICS and IFIP WG 7.3, Cambridge (Mass.), March 1976, pp. 211–218
Leroudier, J., Burgevin, P.: Characterization and models of program behaviour. Proc. ACM 1976, pp. 344–350
Muntz, R. R.: Analytic modeling of interactive systems. Proc. IEEE 63, 946–953 (1975)
Potier, D.: Analysis of demand paging policies with swapped working-sets. Proc. 6th Symposium on Operating Systems Principles, Purdue University (Ind.), November 1977
Potier, D., Leroudier, J., Badel, M.: Un modèle d'analyse des performances d'ordinateurs multiprogrammés à mémoire virtuelle. Rapport de Recherche n∘ 152, IRIA-LABORIA, Janvier 1976
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Parent, M., Potier, D. A note on the influence of program loading on the page fault rate. Acta Informatica 8, 359–370 (1977). https://doi.org/10.1007/BF00271344
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00271344