Large deviations of sojourn times in processor sharing queues
From MaRDI portal
Publication:2494550
The paper considers a GI/G/1 queue operating under the processor sharing (PS) service discipline. The GI/G/1 PS queue is positive recurrent when the load \(\rho < 1\), which is assumed throughout the paper. Some specific assumptions are imposed on the distribution of the service times. The paper considers a customer entering the system in steady state. Let \(V\) be the sojourn time of this tagged customer. The main focus is on the asymptotic behavior of \(P\{ V > x\} \) as \(x \to \infty \), under light-tailed service times. Proposition 1 says that \(\limsup_{x \to \infty } \frac{1} {x}\log P\{ V > x\} \leqslant - \gamma \), where \(\gamma \) is a constant given in terms of the main characteristics of the system. Under additional assumption, Theorem 3.1 shows that \(\lim_{x \to \infty } \frac{1} {x}\log P\{ V > x\} = - \gamma \). The results are compared to a number of other service disciplines.
Recommendations
- Sojourn time asymptotics in processor-sharing queues
- Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
- Sojourn time distribution in some processor-shared queues
- On the sojourn time distribution in a finite capacity processor shared queue
- Sojourn time asymptotics in processor sharing queues with varying service rate
- Sojourn time asymptotics in the M/G/1 processor sharing queue
- Large deviations of queues sharing a randomly time-varying server
- Large deviations and the generalized processor sharing scheduling for a multiple-queue system
Cites work
- A heavy-traffic expansion for asymptotic decay rates of tail probabilities in multichannel queues
- A large-deviations analysis of the GI/GI/1 SRPT queue
- Analysis of the M/M/1 queue with processor sharing via spectral theory
- Applied Probability and Queues
- Asymptotic convergence of scheduling policies with respect to slowdown
- Asymptotics for M/G/1 low-priority waiting-time tail probabilities
- Diffusion approximation for a processor sharing queue in heavy traffic.
- Estimates for the probability of ruin with special emphasis on the possibility of large claims
- scientific article; zbMATH DE number 1249326 (Why is no real title available?)
- scientific article; zbMATH DE number 3106542 (Why is no real title available?)
- Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
- Largest weighted delay first scheduling: Large deviations and optimality
- Limits and approximants for the M/G/1 LIFO waiting-time distribution
- Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
- On distribution tail of the maximum of a random walk
- On the transient behavior of the processor sharing queue
- Queues with equally heavy sojourn time and service requirement distributions
- Response-Time Distribution for a Processor-Sharing System
- Sojourn time asymptotics in the M/G/1 processor sharing queue
- SOJOURN TIMES IN THE M/G/1 FB QUEUE WITH LIGHT-TAILED SERVICE TIMES
- Some asymptotic results for transient random walks
- Tail asymptotics for processor-sharing queues
- The equivalence between processor sharing and service in random order.
- The Fluid Limit of an Overloaded Processor Sharing Queue
- The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
- The sojourn-time distribution in the M/G/1 queue by processor sharing
- The waiting time distribution for the random order service M/M/1 queue
- Waiting time asymptotics in the single server queue with service in random order
- Waiting Time Distributions for Processor-Sharing Systems
Cited in
(28)- Sojourn times in (discrete) time shared systems and their continuous time limits
- Large deviations of the sojourn time for queues in series
- Sojourn time asymptotics in a parking lot network
- Sojourn time asymptotics in processor sharing queues with varying service rate
- Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
- Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
- Sojourn time asymptotics in processor-sharing queues
- Law of Large Number Limits of Limited Processor-Sharing Queues
- Preventing Large Sojourn Times Using SMART Scheduling
- Monotonicity in the Limited Processor-Sharing Queue
- ASYMPTOTIC PROPERTIES OF SOJOURN TIMES IN MULTICLASS TIME-SHARED SYSTEMS
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- M/M/∞ Transience: Tail Asymptotics of Congestion Periods
- On the mean sojourn time of jobs in queues by general service disciplines
- Sojourn time analysis for processor sharing loss queuing system with service interruptions and MAP arrivals
- Tail asymptotics of the waiting time and the busy period for the \(\mathrm{M}/\mathrm{G}/1/K\) queues with subexponential service times
- Is tail-optimal scheduling possible?
- Heavy-traffic analysis of sojourn time under the foreground-background scheduling policy
- On the exact asymptotics of the busy period in GI/G/1 queues
- On the Correlation Structure of a Lévy-Driven Queue
- Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
- Large deviations: a survey on its theory and applications
- Two queues with vastly different arrival rates and processor-sharing factors
- Handling load with less stress
- A large-deviations analysis of the GI/GI/1 SRPT queue
- Tail behavior of conditional sojourn times in processor-sharing queues
- A fluid model for a relay node in an ad hoc network: Evaluation of resource sharing policies
- Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue
This page was built for publication: Large deviations of sojourn times in processor sharing queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494550)
