Batch processor sharing with hyper-exponential service time
From MaRDI portal
Publication:943802
DOI10.1016/j.orl.2007.11.003zbMath1151.90010arXiv0705.0425MaRDI QIDQ943802
Publication date: 10 September 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0705.0425
Laplace transform; Cauchy matrices; hyper-exponential distribution; batch processor sharing; two-level processor sharing
90B22: Queues and service in operations research
Related Items
Sojourn times in a processor sharing queue with multiple vacations, Optimal choice of threshold in two level processor sharing
Cites Work
- Unnamed Item
- Unnamed Item
- Analysis of the M/G/1 processor-sharing queue with bulk arrivals
- Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals
- Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
- On the nonoptimality of the foreground-background discipline for IMRL service times
- Sharing a Processor Among Many Job Classes
- The processor‐sharing queueing model for time‐shared systems with bulk arrivals