A new approach to the M / G /1 processor-sharing queue

R. Schaßberger

86 citations0/0 files storedAdvances in Applied Probability

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

The M / G /1 processor-sharing queue is studied by way of an approximating sequence of models featuring a round-robin discipline and operating in discrete time. In particular, residence-time distributions of jobs are derived.

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 — 86 citations exist upstream.

References

1963Introduction to the Theory of Queues.1970Waiting Time Distributions for Processor-Sharing Systems

Cited by

1992Mathematical problems in the theory of shared-processor systems 2003The impact of the service discipline on delay asymptotics 2000Processor-sharing models for integrated-services networks 1991TheM/G/1 queue with processor sharing and its relation to a feedback queue 1996Queue-Length Distribution for the Discriminatory Processor-Sharing Queue 1992On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes 2000Sojourn times in a processor sharing queue with service interruptions 2003Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue

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.