The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue

DOI10.2307/3214245MaRDI QIDQ3784956zbMATH OpenOpenAlexFDO

Authors R. Schaßberger

Publication date 1988

Published in Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

batch arrivalsinfinite divisibilitysteady-state distributiontime-sharing

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Recommendations

• The sojourn-time distribution in the M/G/1 queue by processor sharing
• Waiting time distributions for M/M/N processor sharing queues
• scientific article; zbMATH DE number 1222144
• Sojourn time asymptotics in the M/G/1 processor sharing queue
• Sojourn times in the \(M/ PH/1\) processor sharing queue
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE

Cited in

(11)

• Processor-sharing queues: Some progress in analysis
• Mathematical problems in the theory of processor-sharing queueing systems
• The M/G/1 processor-sharing model: Transient behavior
• Stability of an M\(|G|1\) queue with thick tails and excess capacity
• A Palm calculus approach to functional versions of Little's law
• On the M/G/1 foreground-background processor-sharing queue
• The \(\text{BMAP}/\text{G}/1/\infty\) queue with the foreground-background processor-sharing discipline
• A finite capacity \(BMAPK/GK/1\) queue with the generalized foreground-background processor-sharing discipline
• A \(MAP_{K}/G_{K}/1/\infty\) queueing system with generalized foreground-background processor sharing discipline
• A foreground-background queueing model with speed or capacity modulation
• Processor sharing: a survey of the mathematical theory

This page was built for publication: The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue

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