The gi/m/1 processor-sharing queue and its heavy traffic analysis

DOI10.1080/15326349108807197zbMATH Open0736.60092OpenAlexW2022365754MaRDI QIDQ3983733FDOQ3983733

Authors: David L. Jagerman, Bhaskar Sengupta 

Publication date: 27 June 1992

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

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

Recommendations

• GI/G/1 processor sharing queue in heavy traffic
• The conditional sojourn time distribution in the \(GI/M/1\) processor- sharing queue in heavy traffic
• Asymptotic approximations for the gi/m/1 queue with processor-sharing service
• On a heavy traffic limit theorem for the M/G/1 processor-sharing queue

zbMATH Keywords

Laplace-Stieltjes transformsuccessive approximationsheavy traffic limitqueue with processor-sharing discipline

Mathematics Subject Classification ID

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

Cited In (18)

• The equivalence between processor sharing and service in random order.
• The \(M/G/1\) processor-sharing queue with disasters
• Steady state approximations of limited processor sharing queues in heavy traffic
• On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
• Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines
• Heavy traffic limit for a processor sharing queue with soft deadlines
• Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals
• Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
• Title not available (Why is that?)
• An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
• The sojourn time in the GI/M/1 queue by processor sharing
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• Title not available (Why is that?)
• A network application model with operational process feature
• Processor-sharing and random-service queues with semi-Markovian arrivals
• On the M/G/1 foreground-background processor-sharing queue
• Sojourn time asymptotics in processor-sharing queues
• Sojourn time distribution in a MAP/M/1 processor-sharing queue

This page was built for publication: The gi/m/1 processor-sharing queue and its heavy traffic analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3983733)