Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing

Performance Evaluation

Volumn 58, Issue 4, 2004, Pages 341-365

  Kim, Jeongsim ^a   Kim, Bara ^a  

^a Korea University   (South Korea)

Author keywords

Discriminatory processor sharing; Egalitarian processor sharing; Joint transform; Sojourn time

Indexed keywords

COMMUNICATION SYSTEMS; LINEAR EQUATIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; QUEUEING NETWORKS; SERVERS; VECTORS;

JOINT TRANSFORMS; PROCESSOR CAPACITY; SOJOURN TIME;

PROGRAM PROCESSORS;

EID: 6444228822     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2004.05.005     Document Type: Article

References (21)

1. E. Altman, T. Jiménez, D. Kofman, DPS queues with stationary ergodic service times and the performance of TCP in overload, INFOCOM, Hong Kong, March 2004. http://www-sop.inria.fr/mistral/personnel/Eitan.Altman/PAPERS/dps-infocom.pdf
2. Asare B.K., Foster F.G., Conditional response time in the. M/G/1 processor-sharing system J. Appl. Prob. 20:1983;910-915.
3. S. Borst, D. van Ooteghem, B. Zwart, Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements, Perform. Eval., to appear. http://www.win.tue.nl/bs/spor/2003-25.pdf.
4. Boxma O.J., Workloads and waiting times in single-server systems with multiple customer classes. Queue. Syst. 5:1989;185-214.
5. Coffman E.G. Jr., Muntz R.R., Trotter H., Waiting time distribution for processor-sharing systems. J. ACM. 17:1970;123-130.
6. Fayolle G., Mitrani I., Iasnogorodski R., Sharing a processor among many job classes. J. ACM. 27:1980;519-532.
7. Grishechkin S. GI/G/1 processor sharing queue in heavy traffic Adv. Appl. Prob. 26:1994;539-555.
8. Jagerman D.L., Sengupta B., The. GI/M/1 processor-sharing queue and its heavy-traffic analysis Stochastic Models. 7:1991;379-396.
9. Kleinrock L., Time-shared systems: a theoretical treatment. J. ACM. 14:1967;242-261.
10. Knessl C., Asymptotic approximation for the. GI/M/1 queue with processor-sharing service Stochastic Models. 8:1992;1-34.
11. V.G. Kulkarni, Modeling and Analysis of Stochastic Systems, Chapman & Hall, London, 1995.
12. Masuyama H., Takine T., Sojourn time distribution in. MAP/M/1 processor-sharing queue Oper. Res. Lett. 31:2003;406-412.
13. Mitra D., Weiss A., A closed network with a discriminatory processor-sharing server. Perform. Eval. Rev. 17:1989;200-208.
14. Morrison J.A., Asymptotic analysis of a large closed queueing network with discriminatory processor sharing. Queue. Syst. 9:1991;191-214.
15. O'Donovan T.M., Direct solutions of. M/G/1 processor-sharing models Oper. Res. 22:1974;1232-1235.
16. Ott T.J., The sojourn time distribution in the. M/G/1 queue with processor sharing J. Appl. Prob. 21:1984;360-378.
17. Ramaswami V., The sojourn time in the. GI/M/1 queue with processor sharing J. Appl. Prob. 21:1984;445-450.
18. Rege K.M., Sengupta B., Queue-length distribution for the discriminatory processor-sharing queue. Oper. Res. 44:1996;653-657.
19. Schassberger R., A new approach to the. M/G/1 processor-sharing queue Adv. Appl. Prob. 16:1984;202-213.
20. Sengupta B., An approximation for the sojourn-time distribution for the. GI/G/1 processor-sharing queue Stochastic Models. 8:1992;35-57.
21. Yashkov S.F., Processor-sharing queues: some progress in analysis. Queue. Syst. 2:1987;1-17.