Analysis of the M/G/1 processor-sharing queue with bulk arrivals

Operations Research Letters

Volumn 31, Issue 5, 2003, Pages 401-405

  Bansal, Nikhil ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Bulk arrivals; Processor sharing; Response time and rational Laplace transforms

Indexed keywords

JOB ANALYSIS; LAPLACE TRANSFORMS; QUEUEING THEORY;

PROCESSOR-SHARING;

PROGRAM PROCESSORS;

EID: 0038487570     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(03)00029-4     Document Type: Article

References (18)

1. Bobbio A., Telek M. A benchmark for PH estimation algorithm. results for acyclic-PH Stochastic Models. 10:1994;661-667.
2. Botta R.F., Harris C.M. Approximation with generalized hyperexponential distributions. weak convergence results Queueing Systems Theory Appl. 1:1986;169-199.
3. Cox D.R. A use of complex probabilities in the theory of stochastic processes. Proc. Cambridge Philos. Soc. 51:1955;313-319.
4. A.A. Fredericks, B. Sengupta, Engineering data networks to meet customer oriented performance requirements, in: Proceedings of the International Teletraffic Conference, 1988.
5. Grishechkin A. On a relationship between processor sharing queues and Crump-Mode Jagers branching processes. Adv. Appl. Probab. 24:1992;653-698.
6. Harris C.M., Marchal W.G. Distribution estimation using Laplace transforms. Inform. J. Comput. 10:1998;448-458.
7. Jagerman D.L., Sengupta B. A functional equation arising in a queue with a gating mechanism. Probab. Eng. Inform. Sci. 3:1989;417-433.
8. Kleinrock L. Time-shared systems. a theoretical treatment JACM. 14:1967;242-261.
9. Kleinrock L., Muntz R., Rodemich E. The processor-sharing queueing model for time-shared systems with bulk arrivals. Networks. 1:1971;1-13.
10. Li Jingwen Approximation method for the analysis for GI/G/1 queues. Oper. Res. 45:1997;140-144.
11. Ott T.J. The sojourn-time distribution in the M/G/1 queue with processor sharing. J. Appl. Probab. 21:1984;360-378.
12. Nunez Queija Rudesindo Sojourn times in non-homogeneous QBD processes with processor sharing. Stochastic Models. 17:2001;61-92.
13. Rege K.M., Sengupta B. Response time distribution in a multiprogrammed computer with terminal traffic. Performance Evaluation. 8:1988;41-50.
14. K.M. Rege, B. Sengupta, The M/G/1 processor-sharing queue with bulk arrivals, in: Modelling and Performance Evaluation of ATM Technology, Elsevier, Amsterdam, 1993, pp. 417-432.
15. Schassberger R. A new approach to the M/G/1 processor sharing queue. Adv. Appl. Probab. 16:1984;202-213.
16. Yashkov S.F. A derivation of response time distribution for a M/G/1 processor sharing queue. Problems Control Inform. Theory. 12:1983;133-148.
17. Yashkov S.F. Processor-sharing queues. some progress in analysis Queueing Systems Theory Appl. 2:1987;1-17.
18. Zwart A.P., J. Boxma Onno Sojourn time asymptotics in the M/G/1 processor sharing queue. Queueing Systems Theory Appl. 35:2000;141-166.