Skip to main content
Springer Nature Link
Log in

Server Allocation in Grid Systems with On/Off Sources

  • Conference paper
Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops (ISPA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4331))

  • 397 Accesses

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Buyukkoc, C., Varaiya, P., Walrand, J.: The cμ-rule revisited. Advances in Applied Probability 17, 237–238 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  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. Duenyas, I., Van Oyen, M.P.: Stochastic Scheduling of Parallel Queues with Set-Up Costs. Queueing Systems Theory and Applications 19, 421–444 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Koole, G.: Assigning a Single Server to Inhomogeneous Queues with Switching Costs. Theoretical Computer Science 182, 203–216 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  6. Liu, Z., Nain, P., Towsley, D.: On Optimal Polling Policies. Queueing Systems Theory and Applications 11, 59–83 (1992)

    Article  MATH  MathSciNet  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 

  8. Mitrani, I.: Approximate Solutions for Heavily Loaded Markov Modulated Queues. Performance Evaluation 62, 117–131 (2005)

    Article  Google Scholar 

  9. Neuts, M.F.: Matrix Geometric Solutions in Stochastic Models. John Hopkins Press, Baltimore (1981)

    MATH  Google Scholar 

  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)

    Article  MATH  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 

  12. Tijms, H.C.: Stochastic Models. Wiley, New York (1994)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing Science, Newcastle University, NE1 7RU

    Joris Slegers, Isi Mitrani & Nigel Thomas

Authors
  1. Joris Slegers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Isi Mitrani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nigel Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, School of Informatics, University of Bradford, BD7 1DP, Bradford, U.K.

    Geyong Min

  2. Dipartimento di Ingegneria dell’ Informazione - Second, University of Naples - Italy, Real Casa dell’Annunziata - via Roma, 29 81031, Aversa (CE), Italy

    Beniamino Di Martino

  3. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada

    Laurence T. Yang

  4. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Minyi Guo

  5. Department of Computer Science, Chemnitz University of Technology, Germany

    Gudula Rünger

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Slegers, J., Mitrani, I., Thomas, N. (2006). Server Allocation in Grid Systems with On/Off Sources. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Rünger, G. (eds) Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. ISPA 2006. Lecture Notes in Computer Science, vol 4331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11942634_91

Download citation

  • DOI: https://doi.org/10.1007/11942634_91

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49860-5

  • Online ISBN: 978-3-540-49862-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics