Steady state approximations of limited processor sharing queues in heavy traffic
From MaRDI portal
Publication:1007146
DOI10.1007/S11134-008-9095-4zbMATH Open1156.90337OpenAlexW2163731518MaRDI QIDQ1007146FDOQ1007146
Authors: Jiheng Zhang, Bert Zwart 
Publication date: 27 March 2009
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-008-9095-4
Recommendations
- The gi/m/1 processor-sharing queue and its heavy traffic analysis
- On the diffusion approximation to two parallel queues with processor sharing
- Heavy-traffic approximations for a layered network with limited resources
- Diffusion limits of limited processor sharing queues
- Heavy traffic analysis of two coupled processors
Cites Work
- Title not available (Why is that?)
- Applied Probability and Queues
- A Review of Regenerative Processes
- Title not available (Why is that?)
- Fluid limits for processor-sharing queues with impatience
- On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough
- Validity of heavy traffic steady-state approximations in generalized Jackson networks
- The fluid limit of a heavily loaded processor sharing queue
- Diffusion approximation for a processor sharing queue in heavy traffic.
- Heavy traffic limit for a processor sharing queue with soft deadlines
- Stationary distribution convergence for generalized Jackson networks in heavy traffic
- Law of Large Number Limits of Limited Processor-Sharing Queues
- An extension of the square root law of TCP
- Response times in M/M/1 time-sharing schemes with limited number of service positions
- Optimal multiprogramming
- Monotonicity in the Limited Processor-Sharing Queue
- Diffusion limits of limited processor sharing queues
- GI/G/1 processor sharing queue in heavy traffic
Cited In (18)
- The Prelimit Generator Comparison Approach of Stein’s Method
- Fluid and heavy traffic diffusion limits for a generalized processor sharing model
- Diffusion limits of limited processor sharing queues
- Analysis of the queuing systems with processor sharing service discipline and random serving rate coefficients
- On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency
- Approximations and Optimal Control for State-Dependent Limited Processor Sharing Queues
- Asymptotic Analysis of Spectral Properties of Finite Capacity Processor Shared Queues
- Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime
- Title not available (Why is that?)
- Managing capacity and inventory jointly for multi-server make-to-stock queues
- Stability analysis of linear systems subject to regenerative switchings
- Monotonicity in the Limited Processor-Sharing Queue
- Heavy traffic analysis for EDF queues with reneging
- Workload analysis of a two-queue fluid polling model
- Stabilizing the virtual response time in single-server processor sharing queues with slowly time-varying arrival rates
- On the stability of the multi-queue multi-server processor sharing with limited service
- WCFS: a new framework for analyzing multiserver systems
- Heavy-traffic approximations for a layered network with limited resources
This page was built for publication: Steady state approximations of limited processor sharing queues in heavy traffic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007146)
