Server Allocation in Grid Systems with On/Off Sources
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).
KeywordsArrival Rate Switching Cost Arrival Process Allocation Policy Queue Size
Unable to display preview. Download preview PDF.
- 2.Duenyas, I., Van Oyen, M.P.: Heuristic Scheduling of Parallel Heterogeneous Queues with Set-Ups. Technical Report 92-60, Department of Industrial and Operations Engineering, University of Michigan (1992)Google Scholar
- 7.Mitrani, I., Mitra, D.: A spectral expansion method for random walks on semi-infinite strips. In: IMACS Symposium on Iterative Methods in Linear Algebra, Brussels (1991)Google Scholar
- 11.de Souza e Silva, E., Gail, H.R.: The Uniformization Method in Performability Analysis. In: Haverkort, B.R., Marie, R., Rubino, G., Trivedi, K. (eds.) Performability Modelling, Wiley, Chichester (2001)Google Scholar