Browse by author
Lookup NU author(s): Dr Joris Slegers, Emeritus Professor Isi Mitrani, Dr Nigel Thomas
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
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).
Author(s): Slegers J, Mitrani I, Thomas N
Editor(s): Min, G., Di Martino, B,. Yang, L.T., Guo, M., Ruenger, G.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Frontiers of High Performance Computing and Networking - ISPA 2006 Workshops
Year of Conference: 2006
Pages: 897-906
Publisher: Springer-Verlag
URL: http://dx.doi.org/10.1007/11942634_91
DOI: 10.1007/11942634_91
Notes: Paper presented at International Workshop on Middleware Performance (WOMP 2006)
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science
ISBN: 9783540498605
