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

DOI10.2307/1427231zbMath0529.68015OpenAlexW2003714766MaRDI QIDQ3311654

R. Schassberger

Publication date: 1984

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427231

zbMATH Keywords

processor sharingprioritiestime-sharingresidence-time distributionsM/G/1 processor-sharing queueround-robin disciplinetime-shared computer systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (27)

Queueing system with processor sharing and limited memory under control of the AQM mechanism ⋮ A decomposition theorem and related results for the discriminatory processor sharing queue ⋮ Processor-sharing queues: Some progress in analysis ⋮ Tail behavior of conditional sojourn times in processor-sharing queues ⋮ Sojourn times in a processor sharing queue with multiple vacations ⋮ Analysis of the M/G/1 processor-sharing queue with bulk arrivals ⋮ Processor sharing: a survey of the mathematical theory ⋮ Sojourn time asymptotics in processor sharing queues with varying service rate ⋮ The \(M/G/1\) queue with processor sharing and its relation to a feedback queue ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Explicit formulas for the variance of conditioned sojourn times in \(M/D/1\)-PS ⋮ Sojourn time in an M/M/1 processor sharing queue with permanent customers ⋮ Sample-path insensitivity of symmetric queues in discrete-time ⋮ The \(M/G/1\) processor-sharing queue with disasters ⋮ Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals ⋮ Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model ⋮ Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue ⋮ Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates ⋮ Discriminatory Processor Sharing Queues and the DREB Method ⋮ Sojourn times in (discrete) time shared systems and their continuous time limits ⋮ Single-channel system with circular access or processor-sharing and branching processes ⋮ Monotonicity in the Limited Processor-Sharing Queue ⋮ On the sojourn of an arbitrary customer in an M/M/1 Processor Sharing Queue ⋮ A Functional Equation Arising in a Queue With a Gating Mechanism ⋮ On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers ⋮ Bedienungstheorie: Tendenzen und neuere Entwicklungen. (Servicing theory: Tendencies and new developments) ⋮ The M/G/1 processor-sharing model: Transient behavior

This page was built for publication: A new approach to the M/G/1 processor-sharing queue