Web server workload characterization: the search for invariants
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Comparative performance analysis of versions of TCP in a local network with a lossy link
IEEE/ACM Transactions on Networking (TON)
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
Fairness and efficiency in web server protocols
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
Online Scheduling to Minimize Average Stretch
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A parallel workload model and its implications for processor allocation
HPDC '97 Proceedings of the 6th IEEE International Symposium on High Performance Distributed Computing
SWIFT: Scheduling in Web Servers for Fast Response Time
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
The impact of the service discipline on delay asymptotics
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Priority Mechanisms for OLTP and Transactional Web Applications
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
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
A resource-allocation queueing fairness measure
Proceedings of the joint international conference on Measurement and modeling of computer systems
Size-Based Scheduling Policies with Inaccurate Scheduling Information
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Simulation Evaluation of Hybrid SRPT Scheduling Policies
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications 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
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
Effects and Implications of File Size/Service Time Correlation onWeb Server Scheduling Policies
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication 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
Handling load with less stress
Queueing Systems: Theory and Applications
A large-deviations analysis of the GI/GI/1 SRPT queue
Queueing Systems: Theory and Applications
Sojourn times in (discrete) time shared systems and their continuous time limits
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
Flash: an efficient and portable web server
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Preventing Large Sojourn Times Using SMART Scheduling
Operations Research
On the average sojourn time under M/M/1/SRPT
Operations Research Letters
The effect of local scheduling in load balancing designs
ACM SIGMETRICS Performance Evaluation Review
MapReduce optimization using regulated dynamic prioritization
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Evaluating the impact of inaccurate information in utility-based scheduling
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
CWS: a model-driven scheduling policy for correlated workloads
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Queueing Systems: Theory and Applications
Is Tail-Optimal Scheduling Possible?
Operations Research
Hi-index | 0.00 |
Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of "favoring small jobs" in order to dramatically reduce user response times. However, rarely do computer systems have knowledge of exact remaining sizes. In this paper, we introduce the class of ε-SMART policies, which formalizes the heuristic of "favoring small jobs" in a way that includes a wide range of policies that schedule using inexact job-size information. Examples of ε-SMART policies include (i) policies that use exact size information, e.g., SRPT and PSJF, (ii) policies that use job-size estimates, and (iii) policies that use a finite number of size-based priority levels. For many ε-SMART policies, e.g., SRPT with inexact job-size information, there are no analytic results available in the literature. In this work, we prove four main results: we derive upper and lower bounds on the mean response time, the mean slowdown, the response-time tail, and the conditional response time of ε-SMART policies. In each case, the results explicitly characterize the tradeoff between the accuracy of the job-size information used to prioritize and the performance of the resulting policy. Thus, the results provide designers insight into how accurate job-size information must be in order to achieve desired performance guarantees.