Queueing Systems: Theory and Applications - Polling models
Assigning a single server to inhomogeneous queues with switching costs
Theoretical Computer Science
Structural results for the control of queueing systems using event-based dynamic programming
Queueing Systems: Theory and Applications
Optimal and heuristic policies for dynamic server allocation
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part I
Approximate solutions for heavily loaded Markov-modulated queues
Performance Evaluation - Performance 2005
Evaluating the optimal server allocation policy for clusters with on/off sources
Performance Evaluation
Optimal dynamic server allocation in systems with on/off sources
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
| Hi-index | 0.00 |
A system consisting of a number of servers, where demands of different types arrive in bursts (modelled by interrupted Poisson processes), is examined in the steady state. The problem is to decide how many servers to allocate to each job type, so as to minimize a cost function expressed in terms of average queue sizes. First, an exact analysis is provided for an isolated IP/M/n queue. The results are used to compute the optimal static server allocation policy. The latter is then compared to two heuristic policies which employ dynamic switching of servers from one queue to another (such switches take time and hence incur costs).