Sojourn time in an M/M/1 processor sharing queue with permanent customers
DOI10.1080/15326349.2017.1392868zbMATH Open1386.60317OpenAlexW2793810923MaRDI QIDQ4639232FDOQ4639232
Fabrice M. Guillemin, Farah Slim
Publication date: 3 May 2018
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15326349.2017.1392868
Recommendations
- Sojourn time distribution in some processor-shared queues
- On sojourn times in the \(M/M/1\)-PS model, conditioned on the number of other users
- On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
- The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service
- Sojourn times in the \(M/ PH/1\) processor sharing queue
Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Cites Work
- A new approach to the M/G/1 processor-sharing queue
- The sojourn-time distribution in the M/G/1 queue by processor sharing
- Recurrence relations, continued fractions, and orthogonal polynomials
- Title not available (Why is that?)
- Waiting Time Distributions for Processor-Sharing Systems
- On Sieved Orthogonal Polynomials. V: Sieved Pollaczek Polynomials
- Time-shared Systems
- Title not available (Why is that?)
- The waiting time distribution for the random order service \(M/M/1\) queue
- The equivalence between processor sharing and service in random order.
- Response-Time Distribution for a Processor-Sharing System
- Title not available (Why is that?)
- Analysis of the M/M/1 queue with processor sharing via spectral theory
Cited In (3)
This page was built for publication: Sojourn time in an \(\mathrm{M}/\mathrm{M}/1\) processor sharing queue with permanent customers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639232)
