Analysis of A time‐shared processor

Leonard Kleinrock

143 citations0/0 files storedNaval Research Logistics Quarterly

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Optimization and Search Problems Age of Information Optimization

Abstract

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 143 citations exist upstream.

References

1958Queues, Inventories, and Maintenance

Cited by

1967The Queue M/G/1 With Feedback to Lower Priority Queues 1965A conservation law for a wide class of queueing disciplines 1969A Survey of Analytical Time-Sharing Models 1968Feedback Queueing Models for Time-Shared Systems 2007Tails in scheduling 2004A resource-allocation queueing fairness measure 2000Processor-sharing models for integrated-services networks 2003The equivalence between processor sharing and service in random order

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.