An endogenous priority model for load control in combined batch - interactive computer systems

ABSTRACT

A relatively high level analytical model for computer systems serving both batch and interactive users is presented. The model is unusual in its employment of an endogenous priority scheme to represent a class of strategies for controlling service to the two types of customers. Numerical methods developed by V. L. Wallace are used to generate steady state probability distributions for the infinite state Markov chain formed by the model. Data from the Michigan Terminal System, which includes a load controlling mechanism of the type modelled, is used to validate the model. Finally, additional parameter studies indicate that the model reflects the dynamic behavior of such system in a reasonable way.

REFERENCES

• 1: Badel, M., Gelenbe, E., Leroudier, J., and Potier, D., Adaptive optimization of a time-sharing system's performance. Proc. of the IEEE 63, 6 (June 1975), 958-965.
• 2: Boettner, D. W., and Alexander, M.T., The Michigan Terminal System. Proc. of the IEEE 63, 6 (June 1975), 912-918.
• 3: Brandwajn, A., A model of a time sharing virtual memory system solved using equivalence and decomposition methods. Acta Informatica 4, 1 (1974), 11-48.
• 4: A. Brandwain , J. Buzen , E. Gelenbe , D. Potier, A model of performance for virtual memory systems, ACM SIGMETRICS Performance Evaluation Review, v.3 n.4, p.9, December 1974
• 5: Peter J. Denning, The working set model for program behavior, Communications of the ACM, v.11 n.5, p.323-333, May 1968 [doi>10.1145/363095.363141]
• 6: Peter J. Denning, Virtual Memory, ACM Computing Surveys (CSUR), v.2 n.3, p.153-189, Sept. 1970 [doi>10.1145/356571.356573]
• 7: Peter J. Denning, Third Generation Computer Systems, ACM Computing Surveys (CSUR), v.3 n.4, p.175-216, Dec. 1971 [doi>10.1145/356593.356595]
• 8: Marc H. Fogel, The VMOS paging algorithm: a practical implementation of the working set model, ACM SIGOPS Operating Systems Review, v.8 n.1, p.8-17, January 1974 [doi>10.1145/775265.775267]
• 9: Jaiswal, N.K., Priority Queues. Academic Press, New York, 1968.
• 10: Landwehr, C.E., Load Sharing in Computer Networks: A Queueing Model. MERIT Computer Network MCN-1174-TR-18 (Nov. 1974), Ann Arbor, Michigan.
• 11: Carl E. Landwehr, Usage statistics for MTS, ACM SIGMETRICS Performance Evaluation Review, v.4 n.2, p.13-23, April 1975 [doi>10.1145/1041701.1041703]
• 12: Little, J., A proof of the queueing formula L &equil; &lgr;W. Operations Research 9, 3 (1961), 383-387.
• 13: Charles Gilbert Moore, III, Network models for large-scale time-sharing systems, 1971
• 14: James B. Morris, Demand paging through utilization of working sets onr the MANIAC II, Communications of the ACM, v.15 n.10, p.867-872, Oct. 1972 [doi>10.1145/355604.361592]
• 15: Pirkola, G.A., A file system for a general purpose time-sharing environment. Proc. of the IEEE 63, 6 (June 1975), 918-924.
• 16: Juan Rodriguez-Rosell , Jean-Pierre Dupuy, The design, implementation, and evaluation of a working set dispatcher, Communications of the ACM, v.16 n.4, p.247-253, April 1973 [doi>10.1145/362003.362032]
• 17: Victor Lew Wallace, The solution of quasi birth and death processes arising from multiple access computer systems, 1969

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS
      Subjects: Distribution functions

Additional Classification:
  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS
      Subjects: Markov processes

General Terms:
Theory