Analysis of the M/G/1 processor-sharing queue with bulk arrivals
From MaRDI portal
Publication:1400352
DOI10.1016/S0167-6377(03)00029-4zbMath1024.60039MaRDI QIDQ1400352
Publication date: 13 August 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Optimal choice of threshold in two level processor sharing, An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue, Sojourn times in a processor sharing queue with multiple vacations, Processor sharing: a survey of the mathematical theory, Batch processor sharing with hyper-exponential service time, Batch sojourn time in the processor sharing queue with geometric batch size, Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals, A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications, AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue, Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Processor-sharing queues: Some progress in analysis
- Approximation with generalized hyperexponential distributions: Weak convergence results
- Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
- SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
- A new approach to the M/G/1 processor-sharing queue
- The sojourn-time distribution in the M/G/1 queue by processor sharing
- A Functional Equation Arising in a Queue With a Gating Mechanism
- On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
- A benchmark for ph estimation algorithms: results for acyclic-ph
- An Approximation Method for the Analysis of GI/G/1 Queues
- Time-shared Systems
- The processor‐sharing queueing model for time‐shared systems with bulk arrivals
