Invariance of fluid limits for the Shortest Remaining Processing Time and Shortest Job First policies

Details Invariance of fluid limits for the Shortest Remaining Processing Time and Shortest Job First policies Invariance of fluid limits for the Shortest Remaining Processing Time and Shortest Job First policies

2010-07-15

arxiv.org/abs/1007.2469v1

Mathematics

Probability

24 pages

Scientific paper

We consider a single-server queue with renewal arrivals and i.i.d. service times, in which the server employs either the preemptive Shortest Remaining Processing Time (SRPT) policy, or its non-preemptive variant, Shortest Job First (SJF). We show that for given stochastic primitives (initial condition, arrival and service processes), the model has the same fluid limit under either policy. In particular, we conclude that the well-known queue length optimality of preemptive SRPT is also achieved, asymptotically on fluid scale, by the simpler-to-implement SJF policy. We also conclude that on fluid scale, SJF and SRPT achieve the same performance with respect to response times of the longest-waiting jobs in the system.

Affiliated with

Also associated with

No associations

Rating

Invariance of fluid limits for the Shortest Remaining Processing Time and Shortest Job First policies does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Invariance of fluid limits for the Shortest Remaining Processing Time and Shortest Job First policies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Invariance of fluid limits for the Shortest Remaining Processing Time and Shortest Job First policies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-598088