Abstract
A system consisting of several servers, where demands of different types arrive in bursts, is examined. The servers can be dynamically reallocated to deal with the different requests, but these switches take time and incur a cost. The problem is to find the optimal dynamic allocation policy. To this end a Markov decision process is solved, using two different techniques. The effects of different solution methods and modeling decisions on the resulting solution are examined.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Golub, G.H., Van Loan, C.F.: Matrix computations. Johns Hopkins University Press, Baltimore (1996)
Howard, R.A.: Dynamic Programming and Markov Processes. Wiley, New York (1960)
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)
Slegers, J., Mitrani, I., Thomas, N.: Server Allocation in Grid Systems with On/Off Sources. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Ruenger, G. (eds.) ISPA 2006 Workshops. LNCS, vol. 4331, pp. 897–906. Springer, Heidelberg (2006)
Slegers, J., Mitrani, I., Thomas, N.: Static and Dynamic Server Allocation in Systems with On/Off Sources, to appear in special issue of Annals of Operations Research, entitled Stochastic Performance Models for Resource Allocation in Communication Systems
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)
Tijms, H.C.: Stochastic Models. Wiley, New York (1994)
White, D.J.: Dynamic Programming, Markov Chains and the Method of Successive Approximations. J. Math Anal. and Appl. 6, 373–376 (1963)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Slegers, J., Mitrani, I., Thomas, N. (2007). Optimal Dynamic Server Allocation in Systems with On/Off Sources. In: Wolter, K. (eds) Formal Methods and Stochastic Models for Performance Evaluation. EPEW 2007. Lecture Notes in Computer Science, vol 4748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75211-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-75211-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75210-3
Online ISBN: 978-3-540-75211-0
eBook Packages: Computer ScienceComputer Science (R0)