Modern operating systems
Exploiting process lifetime distributions for dynamic load balancing
ACM Transactions on Computer Systems (TOCS)
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
Operating System Concepts
Appendix: A primer on heavy-tailed distributions
Queueing Systems: Theory and Applications
Scheduling Strategy to improve Response Time for Web Applications
HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
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
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
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
Cluster scheduling for explicitly-speculative tasks
Proceedings of the 18th annual international conference on Supercomputing
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
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
Tail equivalence for some time-shared systems
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Comparing FB and PS scheduling policies
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
SQF: A slowdown queueing fairness measure
Performance Evaluation
The Foreground-Background queue: A survey
Performance Evaluation
Asymptotic properties of sojourn times in multiclass time-shared systems
Probability in the Engineering and Informational Sciences
Slowdown in the M/M/1 discriminatory processor-sharing queue
Performance Evaluation
Sojourn times in (discrete) time shared systems and their continuous time limits
Queueing Systems: Theory and Applications
Optimal scheduling of jobs with a DHR tail in the M/G/1 queue
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Simulation model driven performance evaluation for enterprise applications
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
Optimality, fairness, and robustness in speed scaling designs
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Queueing Systems: Theory and Applications
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
Lookahead actions in dispatching to parallel queues
Performance Evaluation
Decoupled speed scaling: Analysis and evaluation
Performance Evaluation
| Hi-index | 0.00 |
We explore the performance of an M/GI/1 queue under various scheduling policies from the perspective of a new metric: the slowdown experienced by the largest jobs. We consider scheduling policies that bias against large jobs, towards large jobs, and those that are fair, e.g., processor-sharing (PS). We prove that as job size increases to infinity, all work conserving policies converge almost surely with respect to this metric to no more than 1/(1 - ρ), where ρ denotes the load. We also find that the expected slowdown under any work conserving policy can be made arbitrarily close to that under PS, for all job sizes that are sufficiently large.