An Approximate Analysis of Sojourn Times in the M/G/1 Queue With Round-Robin Service Discipline

DOI10.1002/J.1538-7305.1984.TB00049.XzbMath0588.68012OpenAlexW1983075080MaRDI QIDQ3716287

No author found.

Publication date: 1984

Published in: AT&T Bell Laboratories Technical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/j.1538-7305.1984.tb00049.x

zbMATH Keywords

response timemeanvariancetime slicetime-shared computer systemsquantum sizetotal elapsed time of execution

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline

This page was built for publication: An Approximate Analysis of Sojourn Times in the M/G/1 Queue With Round-Robin Service Discipline