On processor sharing and random service

J. W. Cohen

doi:10.2307/3213712

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

References

[1] Cohen, J. W. (1982) The Single Server Queue, revised edition. North-Holland, Amsterdam.Google Scholar

[2] Ramaswami, V., (1984) The sojourn time in the GI/M/1 queue with processor sharing. J. Appl. Probe 21, 437–442.CrossRef Google Scholar

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Yashkov, S. F. 1987. Processor-sharing queues: Some progress in analysis. Queueing Systems, Vol. 2, Issue. 1, p. 1.

Jagerman, David L. and Bhaskar, Sengupta 1991. The gi/m/1 processor-sharing queue and its heavy traffic analysis. Communications in Statistics. Stochastic Models, Vol. 7, Issue. 3, p. 379.

Yashkov, S. F. 1992. Mathematical problems in the theory of shared-processor systems. Journal of Soviet Mathematics, Vol. 58, Issue. 2, p. 101.

Charles, Knessl 1992. Asymptotic approximations for the gi/m/1 queue with processor-sharing service. Communications in Statistics. Stochastic Models, Vol. 8, Issue. 1, p. 1.

Boxma, Onno Denteneer, Dee and Resing, Jacques 2002. NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications. Vol. 2345, Issue. , p. 117.

Borst, S.C. Boxma, O.J. Morrison, J.A. and Núñez Queija, R. 2003. The equivalence between processor sharing and service in random order. Operations Research Letters, Vol. 31, Issue. 4, p. 254.

Boxma, Onno Denteneer, Dee and Resing, Jacques 2003. Delay models for contention trees in closed populations. Performance Evaluation, Vol. 53, Issue. 3-4, p. 169.

Masuyama, Hiroyuki and Takine, Tetsuya 2003. Sojourn time distribution in a MAP/M/1 processor-sharing queue. Operations Research Letters, Vol. 31, Issue. 5, p. 406.

Wu, De-An and Takagi, Hideaki 2005. Processor-sharing and random-service queues with semi-Markovian arrivals. Journal of Applied Probability, Vol. 42, Issue. 02, p. 478.

Li, Quan-Lin Lian, Zhaotong and Liu, Liming 2005. AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue. Stochastic Models, Vol. 21, Issue. 2-3, p. 507.

Berggren, Fredrik and Litjens, Remco 2006. Performance analysis of access selection and transmit diversity in multi-access networks. p. 251.

Yashkov, S. F. and Yashkova, A. S. 2007. Processor sharing: A survey of the mathematical theory. Automation and Remote Control, Vol. 68, Issue. 9, p. 1662.

Zhen, Qiang and Knessl, Charles 2007. Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue. Queueing Systems, Vol. 57, Issue. 4, p. 157.

Zhen, Qiang and Knessl, Charles 2009. On sojourn times in the finite capacity queue with processor sharing. Operations Research Letters, Vol. 37, Issue. 6, p. 447.

Zhen, Q. and Knessl, C. 2010. On Sojourn Times in the M/ M/1-PS Model, Conditioned on the Number of Other Users. Applied Mathematics Research eXpress,

Zhen, Qiang van Leeuwaarden, Johan S. H. and Knessl, Charles 2010. On a processor sharing queue that models balking. Mathematical Methods of Operations Research, Vol. 72, Issue. 3, p. 453.

Zhen, Qiang and Knessl, Charles 2010. Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue. Mathematical Methods of Operations Research, Vol. 71, Issue. 2, p. 201.

Li, Quan-Lin 2010. Constructive Computation in Stochastic Models with Applications. p. 331.

Zhen, Qiang and Knessl, Charles 2013. On spectral properties of finite population processor shared queues. Mathematical Methods of Operations Research, Vol. 77, Issue. 2, p. 147.

Zhen, Qiang van Leeuwaarden, Johan S. H. and Knessl, Charles 2017. On the sojourn time distribution in a finite population Markovian processor sharing queue. IMA Journal of Applied Mathematics, Vol. 82, Issue. 1, p. 33.

Article contents

On processor sharing and random service

Abstract

Information

References

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests