Stationary increments in the accumulated work process in processor-sharing queues

Robert D. Foley · Georgia-Ann Klutke

10 citations0/0 files storedJournal of 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

We present a new approach to the processor-sharing queue that allows us to study the accumulated work process of a job that requires an amount of processing time x. Our approach simplifies the proofs of some earlier results on expected conditional response times and extends them to the M/G/φ (·) class. The approach illuminates some of the paradoxical features of these systems.

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

References

1967Time-shared Systems 1970Waiting Time Distributions for Processor-Sharing Systems 1984The sojourn-time distribution in the M/G/1 queue by processor sharing 1984A new approach to the M / G /1 processor-sharing queue 1981Stochastic Monotonicity and Queueing Applications of Birth-Death Processes 1971An Analysis of the M/G/1 Queue Under Round-Robin Scheduling 1974Direct Solutions of M/G/1 Processor-Sharing Models 1983Conditional response times in the M/G/1 processor-sharing system

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