Asymptotic approximations for the gi/m/1 queue with processor-sharing service

DOI10.1080/15326349208807212zbMath0759.60098OpenAlexW2021171065MaRDI QIDQ4009173

Charles Knessl

Publication date: 27 September 1992

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349208807212

zbMATH Keywords

heavy trafficqueuesojourn time problemsystem with processor sharing discipline

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) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (4)

The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service ⋮ The conditional sojourn time distribution in the \(GI/M/1\) processor- sharing queue in heavy traffic ⋮ Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue

This page was built for publication: Asymptotic approximations for the gi/m/1 queue with processor-sharing service