E. Hyytiä, A. Penttinen, S. Aalto and J. Virtamo, Dispatching problem with fixed size jobs and processor sharing discipline, in 23rd International Teletraffic Congress (ITC'23), pp. 190-197, 2011, San Fransisco, USA.
Abstract: We consider a distributed server system with m servers operating under the processor sharing (PS) discipline. A stream of fixed size tasks arrives to a dispatcher, which assigns each task to one of the servers. We are interested in minimizing the mean sojourn time, i.e., the mean response time. To this end, we first analyze an M/D/1-PS queue in the MDP framework. In particular, we derive a closed form expression for the so-called size-aware relative value of state, which sums up the deviation from the average rate at which sojourn times are accumulated in the infinite time horizon. This result can be applied in numerous situations. Here we give an example in the context of dispatching problems by deriving efficient and robust state-dependent dispatching policies for homogeneous and heterogeneous server systems. The obtained policies are further demonstrated by numerical examples.
Links:
BibTeX entry:
@inproceedings{hyytia-itc-2011,
author = {Esa Hyyti{\"a} and Aleksi Penttinen and Samuli Aalto and Jorma Virtamo},
title = {Dispatching problem with fixed size jobs and processor sharing discipline},
booktitle = {23rd International Teletraffic Congress ({ITC'23})},
year = {2011},
month = {Sep.},
address = {San Fransisco, USA},
pages = {190--197},
}