Asymptotic convergence of scheduling policies with respect to slowdown
- 1 September 2002
- journal article
- Published by Elsevier in Performance Evaluation
- Vol. 49 (1-4) , 241-256
- https://doi.org/10.1016/s0166-5316(02)00132-3
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Online scheduling to minimize average stretchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A parallel workload model and its implications for processor allocationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling algorithms for message transmission over a satellite broadcast systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Analysis of SRPT schedulingPublished by Association for Computing Machinery (ACM) ,2001
- Scheduling strategy to improve response time for web applicationsPublished by Springer Nature ,1998
- Exploiting process lifetime distributions for dynamic load balancingACM Transactions on Computer Systems, 1997
- The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing timeAdvances in Applied Probability, 1990
- 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