Time-function scheduling: a general approach to controllable resource
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
| Hi-index | 0.00 |
It is well known that scheduling the service of customers according to the shortest remaining processing time (SRPT) policy is optimal with respect to minimizing the mean sojourn time of customers. Recent studies have further argued that SRPT does not unfairly penalize large customers in order to benefit small customers, and therefore these studies propose the use of SRPT to improve performance in various applications. However, as Schrage and Miller point out [10], the SRPT policy can raise several difficulties for a number of important reasons. Such difficulties can arise from the inability to accurately predict service times, or the complicated nature of implementing the preemptive aspect of the SRPT policy which requires keeping track of the remaining service times of all waiting customers as well as of the customer in service. Normally, preemption also incurs additional costs. and thus one might want to avoid the preemption of customers in service whose remaining service time is not much larger than that of a new arrival.