Server Allocation in Grid Systems with On/Off Sources

  • Joris Slegers
  • Isi Mitrani
  • Nigel Thomas
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4331)


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).


Arrival Rate Switching Cost Arrival Process Allocation Policy Queue Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Buyukkoc, C., Varaiya, P., Walrand, J.: The -rule revisited. Advances in Applied Probability 17, 237–238 (1985)MATHCrossRefMathSciNetGoogle Scholar
  2. 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
  3. 3.
    Duenyas, I., Van Oyen, M.P.: Stochastic Scheduling of Parallel Queues with Set-Up Costs. Queueing Systems Theory and Applications 19, 421–444 (1995)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Koole, G.: Assigning a Single Server to Inhomogeneous Queues with Switching Costs. Theoretical Computer Science 182, 203–216 (1997)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Koole, G.: Structural Results for the Control of Queueing Systems using Event-Based Dynamic Programming. Queueing Systems Theory and Applications 30, 323–339 (1998)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Liu, Z., Nain, P., Towsley, D.: On Optimal Polling Policies. Queueing Systems Theory and Applications 11, 59–83 (1992)MATHCrossRefMathSciNetGoogle Scholar
  7. 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
  8. 8.
    Mitrani, I.: Approximate Solutions for Heavily Loaded Markov Modulated Queues. Performance Evaluation 62, 117–131 (2005)CrossRefGoogle Scholar
  9. 9.
    Neuts, M.F.: Matrix Geometric Solutions in Stochastic Models. John Hopkins Press, Baltimore (1981)MATHGoogle Scholar
  10. 10.
    Palmer, J., Mitrani, I.: Optimal Server Allocation in Reconfigurable Clusters with Multiple Job Types. Journal of Parallel and Distributed Computing 65(10), 1204–1211 (2005)MATHCrossRefGoogle Scholar
  11. 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
  12. 12.
    Tijms, H.C.: Stochastic Models. Wiley, New York (1994)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Joris Slegers
    • 1
  • Isi Mitrani
    • 1
  • Nigel Thomas
    • 1
  1. 1.School of Computing ScienceNewcastle University

Personalised recommendations