Mathematics

Findings from University of Virginia Broaden Understanding of Queueing Systems

  2012 APR 17 - (VerticalNews.com) -- "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)," scientists writing in the journal Queueing Systems report.

  "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," wrote H.C. Gromoll and colleagues, University of Virginia.

  The researchers concluded: "We also conclude that on fluid scale, SJF and SRPT achieve the same performance with respect to state-dependent response times."

  Gromoll and colleagues published their study in Queueing Systems (Invariance of fluid limits for the shortest remaining processing time and shortest job first policies. Queueing Systems, 2012;70(2):145-164).

  Additional information can be obtained by contacting H.C. Gromoll, University of Virginia, Dept. of Math, Charlottesville, VA 22904, United States.

  The publisher of the journal Queueing Systems can be contacted at: Springer, Van Godewijckstraat 30, 3311 Gz Dordrecht, Netherlands.

  Keywords: City:Charlottesville, State:Virginia, Country:United States, Region:North and Central America

  This article was prepared by VerticalNews Mathematics editors from staff and other reports. Copyright 2012, VerticalNews Mathematics via VerticalNews.com.