Abstract
We consider a probabilistic model of a computer system with multipro-gramming and paging. The applied work-load is derived from measurements in scientific computer applications and is characterized by a great variance of compute time. Throughput of a cyclic model is computed approximately presuming program sizes with negative exponential distribution. After a review of previous results for a memory allocation policy with prescribed number, n, of working sets at least to be loaded, an adaptive memory allocation policy is introduced which dynamically changes the number, n. Thereby, it is possible to reach the goal of having always enough memory available to load the parachor of each program. Simulation results establish our approximations as being very good. CPU scheduling is chosen to be through-put optimal. Our results are useful to demonstrate the benefits of allocation policies with adaptive controlled degree of multiprogramming. Previous contributions to this problem are to that date only by means of simulation [5].
This work was partly supported by the 2nd EDP-Program of the Federal Republic of Germany.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P.J. Courtois, Decomposability, instabilities and saturation in multiprogramming systems, Comm. ACM, Vol. 18, No. 7 (1975) pp. 371–77.
P.J. Denning, G.S. Graham, Multiprogrammed memory management, Proc. IEEE, Vol. 63, No. 6, June 1975, pp. 924–39.
C.J. Kuehner, B. Randell, Demand paging in perspective, Am. Fed. Inform. Proc. FJCC, 1968, pp. 1011–1018.
R.R. Muntz, Analytic models for computer systems analysis, Lecture Notes Comp. Science, 8, 1974, Springer Berlin/Heidelberg/New York, pp. 246–65.
H. Opderbeck, W.W. Chu, Performance of the page fault frequency replacement algorithm in a multiprogramming, environment, IFIP congress 1974, Stockholm, Inf. Process. 74, North Holland Publishing Company (1974), pp. 235–41.
B. Walke, Queueing networks with degenerate exponential servers, Wiss. Ber. AEG-TELEFUNKEN 48, 1975, H.4, S. 153–57.
B. Walke, Durchsatzberechnung für Rechenanlagen bei wählbarer Aufteilung des Arbeitsspeichers unter mehrere Programme unterschiedlichen Platzbedarfs, PhD-Thesis, University of Stuttgart, 1975 (in German).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walke, B. (1976). Multiprogrammed memory management for random-sized programs. In: Samelson, K. (eds) ECI Conference 1976. ECI 1976. Lecture Notes in Computer Science, vol 44. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07804-5_23
Download citation
DOI: https://doi.org/10.1007/3-540-07804-5_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07804-3
Online ISBN: 978-3-540-38215-7
eBook Packages: Springer Book Archive