Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Journals
  3. Journal of Applied Probability
  4. Volume 21 Issue 2
Journal Home
Refine listing

Refine listing

Access:
Publication date:

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×
< Back to all issues

Volume 21 - Issue 2 - June 1984

Contents

Page 2 of 2

Short Communications

  • The sojourn time in the GI/M/1 queue by processor sharing

  • V. Ramaswami
  • Published online by Cambridge University Press:
    14 July 2016, pp. 437-442

  • A queueing model of considerable interest in computer engineering is the processor-sharing model in which the server shares its fixed capacity equally among all units present in the system. Here, we derive the mean and the variance of the equilibrium sojourn time, and deduce that the variance of the sojourn time is larger for the processor-sharing model than for the corresponding FCFS model.

Letter

  • Letter to the editor

  • Frank Ball
  • Published online by Cambridge University Press:
    14 July 2016, pp. 443-444
    • Article
      • You have access
    • PDF
    • Export citation

Correction

Front Matter

Back Matter

Page 2 of 2