A survey on discriminatory processor sharing
From MaRDI portal
Publication:2494560
This paper is a summarizing article about the Discriminatory Processor Sharing (DPS) model. The characteristics of the DPS model is that all jobs present in the system are served simultaneously at rates controlled by a vector of weights \(\{g_{k}>0,\;k=1,2,\dots, K\}\); moreover, if there are \(N_{k}\) \((k=1,2,\dots, K)\) jobs of class \(k\) present in the system, then each class-\(k\) job's service rate is \(\frac{g_{k}}{\sum_{j=1}^{K}g_{j}N_{j}}\). Focusing on response times and numbers of jobs in the system, the authors give a very comprehensive overview for the DPS model. Hence, this paper provides a good key for readers to learn the DPS model.
Recommendations
- Mean sojourn times for phase-type discriminatory processor sharing systems
- Discriminatory Processor Sharing Queues and the DREB Method
- Heavy-traffic analysis of a multiple-phase network with discriminatory processor sharing
- Queue-Length Distribution for the Discriminatory Processor-Sharing Queue
- Discriminatory processor sharing with access rate limitations
Cites work
- A Characterization of Waiting Time Performance Realizable by Single-Server Queues
- A conservation law for a wide class of queueing disciplines
- A decomposition theorem and related results for the discriminatory processor sharing queue
- A mathematical analysis of the cumulus pricing scheme
- Asymptotic analysis of a large closed queueing network with discriminatory processor sharing
- Bandwidth sharing and admission control for elastic traffic
- Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
- Complete parameterized families of job scheduling strategies
- Direct Solutions of M/G/1 Processor-Sharing Models
- Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities
- Generalized processor sharing queues with heterogeneous traffic classes
- scientific article; zbMATH DE number 3656855 (Why is no real title available?)
- scientific article; zbMATH DE number 48052 (Why is no real title available?)
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
- scientific article; zbMATH DE number 1460450 (Why is no real title available?)
- scientific article; zbMATH DE number 3206641 (Why is no real title available?)
- Insensitive bandwidth sharing in data networks
- Mathematical problems in the theory of processor-sharing queueing systems
- Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
- On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
- On stochastic bounds for monotonic processor sharing networks
- On the transient behavior of the processor sharing queue
- Processor-sharing queues: Some progress in analysis
- Queue-Length Distribution for the Discriminatory Processor-Sharing Queue
- Sample-path conservation laws, with applications to scheduling queues and fluid systems
- Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
- Sharing a Processor Among Many Job Classes
- Sojourn time asymptotics in processor-sharing queues
- Sojourn time asymptotics in the M/G/1 processor sharing queue
- The processor‐sharing queueing model for time‐shared systems with bulk arrivals
- Time-shared Systems
- To queue or not to queue: equilibrium behavior in queueing systems.
Cited in
(30)- Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers
- Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms
- Heavy-traffic limits for discriminatory processor sharing models with joint batch arrivals
- Whittle indexability in egalitarian processor sharing systems
- Asymptotics of waiting time distributions in the accumulating priority queue
- Analysis of a Markovian feedback queue with multi-class customers and its application to the weighted round-robin queue
- Counterexamples to conjectures on discriminatory processor sharing and generalized processor sharing systems
- Waiting times in queues with relative priorities
- Mean sojourn times for phase-type discriminatory processor sharing systems
- Discriminatory Processor Sharing from Optimization Point of View
- Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines
- Heavy-traffic analysis of a multiple-phase network with discriminatory processor sharing
- Approximations for chat service systems using many-server diffusion limits
- The fluid limit of the multiclass processor sharing queue
- Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers
- scientific article; zbMATH DE number 7042402 (Why is no real title available?)
- Discriminatory processor sharing with access rate limitations
- Conditional sojourn times of processor-sharing queues
- Queueing with priorities and standard service: stoppable and unstoppable servers
- Discriminatory Processor Sharing Queues and the DREB Method
- Discriminatory processor sharing queues with stationary ergodic service times and the performance of TCP in overload
- Monotonicity properties for multi-class queueing systems
- Biased Processor Sharing in Fork-Join Queues
- Analysis of retrial queuing system with limited processor sharing discipline and changing effective bandwidth
- Inversion and spectral analysis of matrices arising in the analysis of Markov processes
- Strategic routing in heterogeneous discriminatory processor sharing queues
- Queueing models for the analysis of communication systems
- Instability of sharing systems in the presence of retransmissions
- A stochastic analysis of resource sharing with logarithmic weights
- Processor sharing: a survey of the mathematical theory
This page was built for publication: A survey on discriminatory processor sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494560)
