Steady state approximations of limited processor sharing queues in heavy traffic

Authors:
Jiheng Zhang;Bert Zwart
Affiliations:
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, USA;H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, USA
Venue:
Queueing Systems: Theory and Applications
Year:
2008

Citing 7
Cited 6

A review of regenerative processes

SIAM Review
The UNIX time-sharing system

Communications of the ACM
Adaptive Load Control in Transaction Processing Systems

VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A method for transparent admission control and request scheduling in e-commerce web sites

Proceedings of the 13th international conference on World Wide Web
Optimal control of thrashing

SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
How to Determine a Good Multi-Programming Level for External Scheduling

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Fluid Limits for Processor-Sharing Queues with Impatience

Mathematics of Operations Research

Self-adaptive admission control policies for resource-sharing systems

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Performance modeling of distributed multi-tier enterprise systems

ACM SIGMETRICS Performance Evaluation Review
Law of Large Number Limits of Limited Processor-Sharing Queues

Mathematics of Operations Research
Tail-robust scheduling via limited processor sharing

Performance Evaluation
Product-form results for two-station networks with shared resources

Performance Evaluation
Separation of timescales in a two-layered network

Proceedings of the 24th International Teletraffic Congress

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate steady state properties of limited processor sharing queues in heavy traffic. Our analysis builds on previously obtained process limit theorems, and requires the interchange of steady state and heavy traffic limits, which are established by a coupling argument. The limit theorems yield explicit approximations of the steady state queue length and response time distribution in heavy traffic, of which the quality is supported by simulation experiments.