Sharing a Processor Among Many Job Classes
From MaRDI portal
Cited in
(37)- The use of relative priorities in optimizing the performance of a queueing system
- Processor sharing: a survey of the mathematical theory
- Batch processor sharing with hyper-exponential service time
- Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers
- Waiting times in queues with relative priorities
- Hierarchical Game and Bi-level Optimization for Controlling Network Usage Via Pricing
- A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline
- Heavy-traffic limits for discriminatory processor sharing models with joint batch arrivals
- Strategic routing in heterogeneous discriminatory processor sharing queues
- A decomposition theorem and related results for the discriminatory processor sharing queue
- Bandwidth-sharing networks under a diffusion scaling
- A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
- A Hotelling queue model with probabilistic service
- Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers
- Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines
- Sojourn times in (discrete) time shared systems and their continuous time limits
- Monotonicity of the mean queue size in DPS systems
- Relative priority policies for minimizing the cost of queueing systems with service discrimination
- Analysis of a Markovian feedback queue with multi-class customers and its application to the weighted round-robin queue
- Instability of sharing systems in the presence of retransmissions
- Monotonicity properties for multi-class queueing systems
- Mean sojourn times for phase-type discriminatory processor sharing systems
- On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
- ASYMPTOTIC PROPERTIES OF SOJOURN TIMES IN MULTICLASS TIME-SHARED SYSTEMS
- Mathematical problems in the theory of processor-sharing queueing systems
- AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
- On bounds of response time performance achievable by multiclass single- server queues
- A solution for the \(M^ X/G/1\)-PS process response time
- Processor-sharing queues: Some progress in analysis
- The customer response times in the processor sharing queue are associated
- Discriminatory Processor Sharing Queues and the DREB Method
- A queueing analysis of max-min fairness, proportional fairness and balanced fairness
- A survey on discriminatory processor sharing
- Sojourn time asymptotics in processor-sharing queues
- Sojourn times in a processor sharing queue with multiple vacations
- Asymptotic analysis of a large closed queueing network with discriminatory processor sharing
- Large deviations problems for star networks: the min policy.
This page was built for publication: Sharing a Processor Among Many Job Classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3930626)
