Analysis of A time‐shared processor

Leonard Kleinrock

Naval Research Logistics Quarterly, 1964, vol. 11, issue 1, 59-73

Abstract: This paper analyzes a queueing structure for a time‐shared service facility (or processor) and compares these results with a straightforward first‐come first‐served discipline. The assumption is that the processing time for each job is chosen from a geometric distribution. This time‐shared discipline shares the desirable features of a first‐come first‐served principle, as well as that of a discipline which services short jobs first. It is shown that those jobs with shorter than average processing requirements, spend less time in the queue than they would in a strict first‐come first‐served system, and conversely for longer than average jobs.

Date: 1964
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800110105

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:11:y:1964:i:1:p:59-73

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().