On the stability of the multi-queue multi-server processor sharing with limited service
From MaRDI portal
Publication:2641952
DOI10.1007/s11134-007-9022-0zbMath1166.90326MaRDI QIDQ2641952
Manfred Brandt, Andreas Brandt
Publication date: 17 August 2007
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-007-9022-0
ergodicity; stationarity; marked point process; stability condition; batch arrivals; many servers; head of the line processor sharing; permanent customers; many queues; loynes' construction; general input; thread pools
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Head of the line processor sharing for many symmetric queues with finite capacity
- A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline
- The multiple phase service network with generalized processor sharing
- On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
- Sojourn times in a processor sharing queue with service interruptions
- A reduced-load equivalence for generalised processor sharing networks with long-tailed input flows
- A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers
- A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
- Sojourn times in the \(M/ PH/1\) processor sharing queue
- The sojourn time in the GI/M/1 queue by processor sharing
- The sojourn-time distribution in the M/G/1 queue by processor sharing
- Power Series for Stationary Distributions of Coupled Processor Models
- Waiting times in discrete-time cyclic-service systems
- Processor-sharing of two parallel lines
- Tail asymptotics for processor-sharing queues
- Diffusion Approximation for Head-of-the-Line Processor Sharing for Two Parallel Queues
- Waiting Time Distributions for Processor-Sharing Systems
