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

DOI10.1007/BF00289264zbMath0459.68004MaRDI QIDQ1152211

R. Schassberger, Hans Daduna

Publication date: 1981

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

zbMATH Keywords

steady-state probabilitieslocal balanceconditional average response timeround-robin schedulingtime-shared 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 (11)

Analysis of discrete time queues via the reversed process ⋮ Decomposability in queues with background states ⋮ On the response time distribution in a discrete round-robin queue ⋮ Processor sharing: a survey of the mathematical theory ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Sample-path insensitivity of symmetric queues in discrete-time ⋮ Insensitivity in discrete time queues with a moving server ⋮ Networks of queues in discrete time ⋮ Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model ⋮ The doubly stochastic server: A time-sharing model ⋮ On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers

Cites Work

• Unnamed Item
• Noetherian modules and Noetherian injective rings
• Sharing a Processor Among Many Job Classes
• Analysis of A time‐shared processor
• A Time-Sharing Queue
• Waiting Time Distributions for Processor-Sharing Systems
• A Queueing Theory Study of Round-Robin Scheduling of Time-Shared Computer Systems
• Time Sharing with Priorities
• An Analysis of the M/G/1 Queue Under Round-Robin Scheduling

This page was built for publication: A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions