A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues

Authors:
Adam Wierman;Nikhil Bansal;Mor Harchol-Balter
Affiliations:
Computer Science Department, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA;Computer Science Department, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA;Computer Science Department, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA
Venue:
Operations Research Letters
Year:
2004

Citing 1
Cited 10

Analysis of LAS scheduling for job size distributions with high variance

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Classifying scheduling policies with respect to unfairness in an M/GI/1

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Two-level processor-sharing scheduling disciplines: mean delay analysis

Proceedings of the joint international conference on Measurement and modeling of computer systems
On the relationship between coefficient of variation and the performance of M/G/1-FB queues

ACM SIGMETRICS Performance Evaluation Review
Nearly insensitive bounds on SMART scheduling

SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling in practice

ACM SIGMETRICS Performance Evaluation Review
The Foreground-Background queue: A survey

Performance Evaluation
Event Based Fairness for Video Surveillance Sensor Networks

NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Simulation model driven performance evaluation for enterprise applications

Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing

Operations Research
M/G/1/MLPS compared to M/G/1/PS

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We compare the overall mean response time (a.k.a. sojourn time) of the processor sharing (PS) and feedback (FB) queues under an M/GI/1 system. We show that FB outperforms PS under service distributions having decreasing failure rates; whereas PS outperforms FB under service distributions having increasing failure rates.