Nearly insensitive bounds on SMART scheduling
- 6 June 2005
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 33 (1) , 205-216
- https://doi.org/10.1145/1064212.1064236
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- On the average sojourn time under M/M/1/SRPTOperations Research Letters, 2005
- A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queuesOperations Research Letters, 2004
- Mixed scheduling disciplines for network flowsACM SIGMETRICS Performance Evaluation Review, 2003
- Classifying scheduling policies with respect to unfairness in an M/GI/1Published by Association for Computing Machinery (ACM) ,2003
- Analysis of LAS scheduling for job size distributions with high variancePublished 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
- Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time DisciplineOperations Research, 1978
- 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