Conditional response times in the M/G/1 processor-sharing system

DOI10.2307/3213604zbMath0531.60088OpenAlexW2313622214MaRDI QIDQ3313077

F. G. Foster, B. K. Asare

Publication date: 1983

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

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

zbMATH Keywords

response timeprocessing timesingle-processor system

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 (10)

A decomposition theorem and related results for the discriminatory processor sharing queue ⋮ Processor-sharing queues: Some progress in analysis ⋮ Processor sharing: a survey of the mathematical theory ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ 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 ⋮ Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue ⋮ Conditional Sojourn times and the volatility of payment schemes for bandwidth sharing in packet networks ⋮ Discriminatory Processor Sharing Queues and the DREB Method ⋮ A Functional Equation Arising in a Queue With a Gating Mechanism

This page was built for publication: Conditional response times in the M/G/1 processor-sharing system