Synthesis of a Feedback Queueing Discipline for Computer Operation

ABSTRACT

Considerable effort has been invested in devising and analyzing sequencing rules for multiprogrammed or time-shared systems. A much studied discipline of this kind is the so-called system with feedback to lower priority queues. This discipline contains many parameters, in general, which must be fixed in order to achieve the desired waiting-time performance of the discipline. In this paper the problem of synthesizing a system of the above type is solved, by setting parameter values so that prespecified waiting time criteria are satisfied, assuming Poisson arrival and general service time parameters are known.

REFERENCES

• 1: Edward G. Coffman , Leonard Kleinrock, Feedback Queueing Models for Time-Shared Systems, Journal of the ACM (JACM), v.15 n.4, p.549-576, Oct. 1968 [doi>10.1145/321479.321483]
• 2: CORBATO, F. J., DAGGETT, M. M.~ AND DALEY, R. C. An experimental time-sharing system. Proc. AFIPS 1962 SJCC, Vol. 21, Spartan Books, New York, pp. 335-344.
• 3: Jerome Alan Michel, Synthesis of priority queueing systems, 1972
• 4: MUNTZ, R. R. Waiting time distribution for round-robin queueing systems. Proc. Symp. on Computer-Communications, Networks, and Teletraffic, Microwave Research Inst., Polytechnic Institute of Brooklyn, April 1972, pp. 429-439.
• 5: SCHRAGE, L. E. The M/G/1 queue with feedback to lower priority queues. Manage. Sci. 13 (1967), 466-474.
• 6: VAN DEN HEEVER, R. Computer Time Sharing Priority Systems. Tech. Rep. ORC 69-22 (Ph.D. Thesis), Operations Research Center, University of California at Berkeley, Aug. 1969.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS
      Subjects: Queueing theory

Additional Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.8 Performance
          Subjects: Queueing theory

General Terms:
Algorithms, Design, Performance, Theory, Verification