Asymptotic analysis of spectral properties of finite capacity processor shared queues
From MaRDI portal
Perturbations, asymptotics of solutions to ordinary differential equations (34E10) Eigenfunctions, eigenfunction expansions, completeness of eigenfunctions of ordinary differential operators (34L10) Eigenvalues, estimation of eigenvalues, upper and lower bounds of ordinary differential operators (34L15)
Abstract: We consider sojourn (or response) times in processor-shared queues that have a finite customer capacity. Computing the response time of a tagged customer involves solving a finite system of linear ODEs. Writing the system in matrix form, we study the eigenvectors and eigenvalues in the limit as the size of the matrix becomes large. This corresponds to finite capacity models where the system can only hold a large number of customers. Using asymptotic methods we reduce the eigenvalue problem to that of a standard differential equation, such as the Airy equation. The dominant eigenvalue leads to the tail of a customer's sojourn time distribution. Some numerical results are given to assess the accuracy of the asymptotic results.
Recommendations
- On spectral properties of finite population processor shared queues
- On the sojourn time distribution in a finite capacity processor shared queue
- On Finite Capacity Processor-Shared Queues
- On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing
- The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic
Cites work
- Asymptotic Analysis of the Waiting-Time Distribution for a Large Closed Processor-Sharing System
- Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes
- Conditioned Response-Time Distribution for a Large Closed Processor-Sharing System in Very Heavy Usage
- Conditioned Response-Time Distribution for a Large Closed Processor-Sharing System with Multiple Classes in Very Heavy Usage
- Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes
- Integrals of products of Airy functions
- Moments of the conditioned waiting time in a large closed processor-sharing system
- On Finite Capacity Processor-Shared Queues
- On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing
- On spectral properties of finite population processor shared queues
- On the sojourn time distribution in a finite capacity processor shared queue
- Response times in M/M/1 time-sharing schemes with limited number of service positions
- Server sharing with a limited number of service positions and symmetric queues
- Steady state approximations of limited processor sharing queues in heavy traffic
- Waiting Time Distributions for Processor-Sharing Systems
Cited in
(7)- On spectral properties of finite population processor shared queues
- On Finite Capacity Processor-Shared Queues
- Asymptotic Shape of the Erlang Capacity Region of a Critically Loaded Multiservice Shared Resource
- Sojourn time analysis for processor sharing loss queuing system with service interruptions and MAP arrivals
- Sojourn time analysis for processor sharing loss system with unreliable server
- Asymptotic analysis of a large closed queueing network with discriminatory processor sharing
- Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
This page was built for publication: Asymptotic analysis of spectral properties of finite capacity processor shared queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931131)
