On the response time distribution in a discrete round-robin queue

DOI10.1007/BF00289590zbMath0475.68015OpenAlexW2010666073MaRDI QIDQ1159462

R. Schassberger

Publication date: 1981

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289590

zbMATH Keywords

processor sharinground-robin schedulingM/G/1 discrete-time queueing 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 (6)

Processor-sharing queues: Some progress in analysis ⋮ Decomposability in queues with background states ⋮ Insensitivity in discrete time queues with a moving server ⋮ Networks of queues in discrete time ⋮ Sojourn times in (discrete) time shared systems and their continuous time limits ⋮ The doubly stochastic server: A time-sharing model

Cites Work

• A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions

This page was built for publication: On the response time distribution in a discrete round-robin queue