Cyclic Queues with Bulk Arrivals

ABSTRACT

This paper deals with a single-server station (a computer) where each customer's demand comprises an independent random number of jobs (programs). Under certain assumptions, two cyclic disciplines are mathematically analyzed: (a) continuous job service—a round-robin discipline where the quantum's length is distributed as the service requirement of a job; (b) intermittent job service—a double round-robin discipline—in the first instance in terms of the jobs within the customer's demand, and in the second in terms of the customer himself.

REFERENCES

• 1: GAVER, D.P. Imbedded Markov chain analysis of a waiting line process in continuous time Ann Math. Star. $0, 3 (1959), 698-720.
• 2: ADIR~, I., AND AVI-ITZHAK, B A time-sharing queue. Manag Sc~. 15, 11 (1969), 639-657
• 3: LITTLE, J D C A proof for the queuemg formula L = kW. Oper. Res. 9, 3 (1961), 383-387.
• 4: ADIRI, I., AND AVI-ITzHAK, B. Queueing models for time-sharing serwce systems. Proc. 5th Internat Conf. on Operational Research, Vemce, 1969, pp. 205-222.
• 5: CONWAY, R W, MAXWELL, W. L, AND MILLER, L.W. Theory of Scheduling Addison- Wesley, Reading, Mass., 1967, p. 146

INDEX TERMS

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

Additional Classification:
  I. Computing Methodologies
  I.6 SIMULATION AND MODELING

General Terms:
Design, Theory