A single server queue with gated processor-sharing discipline (Q1122881): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Q1111463 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Gennadij Falin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Response times in <i>M/M/</i>1 time-sharing schemes with limited number of service positions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Response times in gated M/G/1 queues: The processor-sharing case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Waiting Time Distributions for Processor-Sharing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation Arising in a Queue With a Gating Mechanism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration procedure for determining approximate solutions to non-linear oscillator equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A perturbation method for solving some queues with processor sharing discipline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processor-sharing queues: Some progress in analysis / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:55, 20 June 2024

scientific article
Language Label Description Also known as
English
A single server queue with gated processor-sharing discipline
scientific article

    Statements

    A single server queue with gated processor-sharing discipline (English)
    0 references
    0 references
    0 references
    1989
    0 references
    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.
    0 references
    processor-sharing discipline
    0 references
    infinite capacity buffer
    0 references
    waiting time
    0 references
    queue length
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references