Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Many-Sources Delay Asymptotics with Applications to Priority Queues
Queueing Systems: Theory and Applications
Tail Asymptotics for HOL Priority Queues Handling a Large Number of Independent Stationary Sources
Queueing Systems: Theory and Applications
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
Performance analysis of LAS-based scheduling disciplines in a packet switched network
Proceedings of the joint international conference on Measurement and modeling of computer systems
Improving Preemptive Prioritization via Statistical Characterization of OLTP Locking
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Nearly insensitive bounds on SMART scheduling
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Sojourn Times In The M/G/1 FB Queue With Light-Tailed Service Times
Probability in the Engineering and Informational Sciences
Class-specific quality of service guarantees in multimedia communication networks
Automatica (Journal of IFAC)
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
| Hi-index | 0.00 |
Scheduling policies that prioritize short jobs have received growing attention in recent years. The class of SMART policies includes many such disciplines, e.g. Shortest-Remaining-Processing-Time (SRPT) and Preemptive-Shortest-Job-First (PSJF). In this work, we study the delay distribution of SMART policies and contrast this distribution with that of the Least-Attained-Service (LAS) policy, which indirectly favors short jobs by prioritizing jobs with the least attained service (age).We study the delay distribution (rate function) of LAS and the SMART class in a discrete-time queueing system under the many sources regime. Our analysis in this regime (large capacity and large number of flows) hinges on a novel two dimensional queue representation, which creates tie-break rules. These additional rules do not alter the policies, but greatly simplify their analysis. We demonstrate that the queue evolution of all the above policies can be described under this single two dimensional framework.We prove that all SMART policies have the same delay distribution as SRPT and illustrate the improvements SMART policies make over First-Come-First-Served (FCFS). Furthermore, we show that the delay distribution of SMART policies stochastically improves upon the delay distribution of LAS. However, the delay distribution under LAS is not too bad -- the distribution of delay under LAS for most jobs sizes still provides improvement over FCFS. Our results are complementary to prior work that studies delay-tail behavior in the large buffer regime under a single flow.