Classifying scheduling policies with respect to unfairness in an M/GI/1
- 10 June 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 31 (1) , 238-249
- https://doi.org/10.1145/781027.781057
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Analysis of LAS scheduling for job size distributions with high variancePublished by Association for Computing Machinery (ACM) ,2003
- Fairness and efficiency in web server protocolsPublished by Association for Computing Machinery (ACM) ,2003
- Size-based scheduling to improve web performanceACM Transactions on Computer Systems, 2003
- Asymptotic convergence of scheduling policies with respect to slowdownPerformance Evaluation, 2002
- Analysis of SRPT schedulingPublished by Association for Computing Machinery (ACM) ,2001
- Exploiting process lifetime distributions for dynamic load balancingACM Transactions on Computer Systems, 1997
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time DisciplineOperations Research, 1968
- The Queue M/G/1 with the Shortest Remaining Processing Time DisciplineOperations Research, 1966