Multiprogrammed memory management for random-sized programs

  • Bernhard Walke
Computer Architecture And Computer Systems Structure
Part of the Lecture Notes in Computer Science book series (LNCS, volume 44)


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].


Main Memory Memory Size Allocation Policy Program Size Page Fault 
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.


  1. [1]
    P.J. Courtois, Decomposability, instabilities and saturation in multiprogramming systems, Comm. ACM, Vol. 18, No. 7 (1975) pp. 371–77.CrossRefGoogle Scholar
  2. [2]
    P.J. Denning, G.S. Graham, Multiprogrammed memory management, Proc. IEEE, Vol. 63, No. 6, June 1975, pp. 924–39.Google Scholar
  3. [3]
    C.J. Kuehner, B. Randell, Demand paging in perspective, Am. Fed. Inform. Proc. FJCC, 1968, pp. 1011–1018.Google Scholar
  4. [4]
    R.R. Muntz, Analytic models for computer systems analysis, Lecture Notes Comp. Science, 8, 1974, Springer Berlin/Heidelberg/New York, pp. 246–65.Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    B. Walke, Queueing networks with degenerate exponential servers, Wiss. Ber. AEG-TELEFUNKEN 48, 1975, H.4, S. 153–57.Google Scholar
  7. [7]
    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).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Bernhard Walke
    • 1
  1. 1.AEG-TELEFUNKEN, Research InstituteUlmW-Germany

Personalised recommendations