On the self-similar nature of Ethernet traffic
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Evidence for long-tailed distributions in the internet
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Asymptotic convergence of scheduling policies with respect to slowdown
Performance Evaluation
Heavy Tails: The Effect of the Service Discipline
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
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
SWIFT: Scheduling in Web Servers for Fast Response Time
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
Mixed scheduling disciplines for network flows
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
On the average sojourn time under M/M/1/SRPT
Operations Research Letters
A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues
Operations Research Letters
Classifying scheduling policies with respect to higher moments of conditional response time
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Tail asymptotics for policies favoring short jobs in a many-flows regime
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
On the effect of inexact size information in size based policies
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
PBS: a unified priority-based scheduler
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Adaptive and scalable comparison scheduling
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance Evaluation
The Foreground-Background queue: A survey
Performance Evaluation
Scheduling despite inexact job-size information
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The effect of local scheduling in load balancing designs
ACM SIGMETRICS Performance Evaluation Review
Monotonicity Properties for Multi-Class Queueing Systems
Discrete Event Dynamic Systems
Minimizing slowdown in heterogeneous size-aware dispatching systems
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
| Hi-index | 0.00 |
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the motivation of minimizing mean response time and/or mean slowdown. Examples of SMART policies include PSJF, SRPT, and hybrid policies such as RS (which biases according to the product of the remaining size and the original size of a job).For many policies in the SMART class, the mean response time and mean slowdown are not known or have complex representations involving multiple nested integrals, making evaluation difficult. In this work, we prove three main results. First, for all policies in the SMART class, we prove simple upper and lower bounds on mean response time. Second, we show that all policies in the SMART class, surprisingly, have very similar mean response times. Third, we show that the response times of SMART policies are largely insensitive to the variability of the job size distribution. In particular, we focus on the SRPT and PSJF policies and prove insensitive bounds in these cases.