Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Kuczura (1973)
The interrupted poisson process as an overflow processBell System Technical Journal, 52
(1992)
A Spectral Expansion Method for Random Walks on Semi-Infinite Strips
Izak Duenyas, M. Oyen (1996)
Heuristic Scheduling of Parallel Heterogeneous Queues with Set-UpsManagement Science, 42
C. Buyukkoc, P. Varsiya, J. Walrand (1985)
The c# rule revisited
C. Buyukkoc, P. Varaiya, J. Walrand (1985)
The c μ-rule revisitedAdvances in Applied Probability, 17
Izak Duenyas, M. Oyen (1995)
Stochastic scheduling of parallel queues with set-up costsQueueing Systems, 19
C. Buyukkoc, P. Varaiya, J. Walrand (1985)
The cμ rule revisitedAdvances in Applied Probability, 17
G. Koole (1997)
Asigning a Single Server to Inhomogeneous Queues with Switching CostsTheor. Comput. Sci., 182
H. Tijms (1994)
Stochastic models
Zhen Liu, P. Nain, D. Towsley (1992)
On optimal polling policiesQueueing Systems, 11
G. Koole (1998)
Structural results for the control of queueing systems using event-based dynamic programmingQueueing Systems, 30
J. Palmer, I. Mitrani (2005)
Optimal and heuristic policies for dynamic server allocationJ. Parallel Distributed Comput., 65
E. Souza e Silva, H. Gail (2001)
Performability modelling
M. Neuts (1981)
Matrix-Geometric Solutions in Stochastic Models
J. Palmer, I. Mitrani (2004)
Optimal Server Allocation in Reconfigurable Clusters with Multiple Job Types
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 IPP/M/n queue. The results are used to compute the optimal static server allocation policy. The latter is then compared to four heuristic policies which employ dynamic switching of servers from one queue to another (such switches take time and hence incur costs).
Annals of Operations Research – Springer Journals
Published: Sep 13, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.