SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Time-shared Systems: a theoretical treatment
Journal of the ACM (JACM)
On choosing a task assignment policy for a distributed server system
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Optimal state-free, size-aware dispatching for heterogeneous M/G/-type systems
Performance Evaluation - Performance 2005
Sojourn Time Tails In The M/D/1 Processor Sharing Queue
Probability in the Engineering and Informational Sciences
Analysis of join-the-shortest-queue routing for web server farms
Performance Evaluation
Load balancing in processor sharing systems
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
M/M/1-PS queue and size-aware task assignment
Performance Evaluation
Minimizing slowdown in heterogeneous size-aware dispatching systems
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
| Hi-index | 0.00 |
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.