The multiple phase service network with generalized processor sharing
From MaRDI portal
Cited in
(17)- Scheduling for a processor sharing system with linear slowdown
- Stationary queuing systems with dependencies
- The equivalence between processor sharing and service in random order.
- Exact solutions for open, closed and mixed queueing networks with rejection blocking
- SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
- Theory of queuing networks and its applications to the analysis of information-computing systems
- Service-time ages, residuals, and lengths in an \(\mathrm{M}/\mathrm{GI}/\infty \) service system
- A LCFS finite buffer model with batch input and non-exponential services
- The efficiency of two groups of heterogeneous stations cared for by r operatives with a priority group
- Some Time-Dependent Properties of Symmetric M/G/1 Queues
- A Method for Approximating the Variance of the Sojourn Times in Star-Shaped Queueing Networks
- Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
- On the finite-source G/M/r queue
- AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
- Tail asymptotics for processor-sharing queues
- M/G/ tandem queues
- On the stability of the multi-queue multi-server processor sharing with limited service
This page was built for publication: The multiple phase service network with generalized processor sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1253543)
