Memory management and response time

ABSTRACT

This paper presents a computationally tractable methodology for including accurately the effects of finite memory size and workload memory requirements in queueing network models of computer systems. Empirical analyses and analytic studies based on applying this methodology to an actual multiaccess interactive system are reported. Relations between workload variables such as memory requirement distribution and job swap time, and performance measures such as response time and memory utilization are graphically displayed. A multiphase, analytically soluble model is proposed as being broadly applicable to the analysis of interactive computer systems which use nonpaged memories.

REFERENCES

• 1: Knight, D.C. An algorithm for scheduling storage on a non-paged computer. Computer J. 11 (1968), 17-22.
• 2: Kurt Fuchel, Considerations in the design of a multiple computer system with extended core storage, Communications of the ACM, v.11 n.5, p.334-340, May 1968 [doi>10.1145/363095.363142]
• 3: John H. Howard, Jr., A large-scale dual operating system, Proceedings of the annual conference, p.242-248, August 27-29, 1973, Atlanta, Georgia, United States [doi>10.1145/800192.805712]
• 4: J. E. Thornton, Design of a Computer—The Control Data 6600, Scott Foresman & Co, 1970
• 5: Control Data 64/65/6600 Computer System Reference Manual. Pub. No. 6 00100000, Control Data Corp., Sunnyvale, Calif., 1967.
• 6: Johnson, D.S. A process-oriented model of resoucce demands in large multiprocessing computer utilities. Comput. Ctr. Rep. TSN-29, U. of Texas at Austin, 1972.
• 7: Sherman, S.W. Trace-driven modeling studies of the performance of computer systems. Comput. Ctr. Rep. TSN-30, U. of Texas at Austin, 1972.
• 8: B. Krishnamoorthi , Roger C. Wood, Time-Shared Computer Operations With Both Interarrival and Service Times Exponential, Journal of the ACM (JACM), v.13 n.3, p.317-338, July 1966 [doi>10.1145/321341.321342]
• 9: James Martin, Design of Real-Time Computer Systems, Prentice-Hall, Inc., Upper Saddle River, NJ, 1967
• 10: Chandy, K.M. The Analysis and Solutions for General Queueing Networks, Proc. Sixth Annual Princeton Conf. on Inform. Sci. and Systems, Princeton U., Princeton, N.J., March 1972.
• 11: Chandy, K.M., Herzog, U., and Woo, L. Parametric analysis of queueing networks. IBM J. Res. and Develop. 19, 1 (Jan. 1975), 43-49.
• 12: Forest Baskett , K. Mani Chandy , Richard R. Muntz , Fernando G. Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM (JACM), v.22 n.2, p.248-260, April 1975 [doi>10.1145/321879.321887]
• 13: Herzog, U., Woo, L., and Chandy, K.M., Solution of Queueing Problems by a Recursive Technique, IBM J. Res. and Develop. 19, 3 (May 1975), 295-300.
• 14: Browne, J.C., Chandy, K.M., Brown, R.M., Keller, T.W., Towsley, D.F., and Dissly, C.W. Hierarchical techniques for the development of realistic models of complex computer systems. Proc. IEEE63, 6 (June 1975), 966-976.
• 15: R. M. Brown, Analytic Model of a Large Scale Interactive System Including the Effects OfFinite Main Memory, University of Texas at Austin, Austin, TX, 1974

INDEX TERMS

Keywords:
interactive computer systems, memory management, queueing network models, system performance