An Analysis of the M/G/1 Queue Under Round-Robin Scheduling

DOI10.1287/OPRE.19.2.371zbMath0247.60061OpenAlexW2077278245MaRDI QIDQ5660361

No author found.

Publication date: 1971

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.19.2.371

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Related Items (12)

A mathematical model to estimate average response time of parallel programs ⋮ Processor-sharing queues: Some progress in analysis ⋮ The efficiency-fairness balance of round robin scheduling ⋮ A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions ⋮ The equivalence between processor sharing and service in random order. ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Pricing and distributed QoS control for elastic network traffic ⋮ A Cost-Equation Analysis of General-Input General-Service Processor Sharing System ⋮ Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model ⋮ Sojourn time asymptotics in processor-sharing queues ⋮ M/G/1 round robin discipline ⋮ Effect of energy-saving server scheduling on power consumption for large-scale data centers

This page was built for publication: An Analysis of the M/G/1 Queue Under Round-Robin Scheduling