Processor-sharing queues: some progress in analysis
Queueing Systems: Theory and Applications
Kendall's advanced theory of statistics
Kendall's advanced theory of statistics
Modern operating systems
Improving Service by Informing Customers About Anticipated Delays
Management Science
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Management Science
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Operating System Concepts
Sojourn time asymptotics in the M/G/1 processor sharing queue
Queueing Systems: Theory and Applications
Using Cumulant Functions in Queueing Theory
Queueing Systems: Theory and Applications
Asymptotic convergence of scheduling policies with respect to slowdown
Performance Evaluation
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
SWIFT: Scheduling in Web Servers for Fast Response Time
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
Enhancing both network and user performance for networks supporting best effort traffic
IEEE/ACM Transactions on Networking (TON)
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
Nearly insensitive bounds on SMART scheduling
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
ACM SIGMETRICS Performance Evaluation Review - Special issue on the workshop on MAthematical performance Modeling And Analysis (MAMA 2005)
On the twin measure and system predictability and fairness
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
SQF: A slowdown queueing fairness measure
Performance Evaluation
Processor sharing: A survey of the mathematical theory
Automation and Remote Control
The Foreground-Background queue: A survey
Performance Evaluation
The twin measure for queueing system predictability
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Scheduling despite inexact job-size information
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the twin measure and queueing systems predictability
Performance Evaluation
On the Variance of the Least Attained Service Policy and Its Use in Multiple Bottleneck Networks
Network Control and Optimization
Class treatment in queueing systems: discrimination and fairness aspects
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Foreword to the thematical issue "centenary of the queuing theory"
Automation and Remote Control
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Joint optimization of overlapping phases in MapReduce
Performance Evaluation
Hi-index | 0.00 |
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order to understand the predictability of response times under a range of scheduling policies, we study the conditional variance in response times seen by jobs of different sizes. We define a metric and a criterion that distinguish between contrasting functional behaviors of conditional variance, and we then classify large groups of scheduling policies.In addition to studying the conditional variance of response times, we also derive metrics appropriate for comparing higher conditional moments of response time across job sizes. We illustrate that common statistics such as raw and central moments are not appropriate when comparing higher conditional moments of response time. Instead, we find that cumulant moments should be used.