Stochastic models in queueing theory
Stochastic models in queueing theory
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Asymptotic convergence of scheduling policies with respect to slowdown
Performance Evaluation
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
A resource-allocation queueing fairness measure
Proceedings of the joint 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
Fairness considerations of scheduling in multi-server and multi-queue systems
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Unfairness metrics for space-sharing parallel job schedulers
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Locality of reference and the use of sojourn time variance for measuring queue unfairness
Operations Research Letters
Slowdown in the M/M/1 discriminatory processor-sharing queue
Performance Evaluation
Probability in the Engineering and Informational Sciences
Class treatment in queueing systems: discrimination and fairness aspects
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
PV-EASY: a strict fairness guaranteed and prediction enabled scheduler in parallel job scheduling
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
| Hi-index | 0.00 |
Expected slowdown has been proposed as a criterion to evaluate queue fairness. In this work we examine how the constant slowdown principle can be used as a basis for a queueing fairness measure. We propose the Slowdown Queueing Fairness (SQF) measure based on the principle that customers' waiting time should be proportional to their service time. We analyze its properties and examine how they react to both seniority and service requirements. We also examine whether its behavior fits intuition. Its values for a variety of single-server scheduling policies as well as for multi-server architectures are derived.