A single server queue with gated processor-sharing discipline

DOI10.1007/BF02100269MaRDI QIDQ1122881zbMATH OpenFDO

Authors Kiran M. Rege, Bhaskar Sengupta

Publication date 1989

Published in Queueing Systems (Search for Journal in Brave)

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

zbMATH Keywords

infinite capacity bufferprocessor-sharing disciplinequeue lengthwaiting time

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Review text

The authors study a single-line queueing system with an infinite capacity buffer in which customers arrive in a Poisson process and service times have exponential distribution. When a customer arrives into an empty system, he begins to be served immediately and until service completion newly arriving customers must wait in the buffer. After service completion a batch of at most m of the waiting customers from the head of the queue occupies the server and starts to be served in accordance with processor-sharing discipline. As before newly arriving customers are not allowed to join the batch which receives service. The authors study waiting time, queue length, etc. It should be noted that for finite m the conditional mean response time is not a linear function.

Recommendations

• scientific article; zbMATH DE number 3880405
• Response times in gated M/G/1 queues: The processor-sharing case
• Waiting time distributions for M/M/N processor sharing queues
• scientific article; zbMATH DE number 3943021
• On Finite Capacity Processor-Shared Queues

Cites work

• A Functional Equation Arising in a Queue With a Gating Mechanism
• A perturbation method for solving some queues with processor sharing discipline
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 710624 (Why is no real title available?)
• Iteration procedure for determining approximate solutions to non-linear oscillator equations
• Processor-sharing queues: Some progress in analysis
• Response times in M/M/1 time-sharing schemes with limited number of service positions
• Response times in gated M/G/1 queues: The processor-sharing case
• Waiting Time Distributions for Processor-Sharing Systems

Cited in

(6)

• Waiting times for \(M/M\) systems under state-dependent processor sharing
• Mathematical problems in the theory of processor-sharing queueing systems
• Response times in gated M/G/1 queues: The processor-sharing case
• A Single Server Queue with Two Types of Customers and a Gate Mechanism
• scientific article; zbMATH DE number 3880405 (Why is no real title available?)
• A single server queue with a varying gate mechanism

This page was built for publication: A single server queue with gated processor-sharing discipline

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122881)