Simulation Evaluation of Hybrid SRPT Scheduling Policies

Authors:
Mingwei Gong;Carey Williamson
Affiliations:
University of Calgary;University of Calgary
Venue:
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Year:
2004

Citing 0
Cited 6

Revisiting unfairness in web server scheduling

Computer Networks: The International Journal of Computer and Telecommunications Networking
On the effect of inexact size information in size based policies

ACM SIGMETRICS Performance Evaluation Review
Fairness and classifications

ACM SIGMETRICS Performance Evaluation Review
Scheduling in practice

ACM SIGMETRICS Performance Evaluation Review
Scheduling despite inexact job-size information

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Joint optimization of overlapping phases in MapReduce

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper uses trace-driven simulations to evaluate two novel Web server scheduling policies called K-SRPT and T-SRPT. K-SRPT is a multi-threaded version of SRPT (Shortest Remaining Processing Time) that can have up to K jobs in service at a time. T-SRPT is a hybrid policy that dynamically switches from PS (Processor Sharing) to SRPT when the number of jobs in the system exceeds T, and back to PS when the load diminishes. Slowdown profile plots are used to analyze the performance of these policies relative to PS, SRPT, and FSP (Fair Sojourn Protocol). Simulation results show that these new parameterized policies offer smooth performance tradeoffs between SRPT and PS. Stability issues for T-SRPT are also discussed.