Abstract
We examine a system where the servers in a cluster may be switched dynamically and preemptively from one kind of work to another. The demand consists of M job types joining separate queues, with different arrival and service characteristics, and also different relative importance represented by appropriate holding costs. The switching of a server from queue i to queue j incurs a cost which may be monetary or may involve a period of unavailability. The optimal switching policy is obtained numerically by solving a dynamic programming equation. Two simple heuristic policies – one static and one dynamic – are evaluated by simulation and are compared to the optimal policy. The dynamic heuristic is shown to perform well over a range of parameters, including changes in demand.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bather, J.: Decision Theory - An Introduction to Dynamic Programming and Sequential Decisions. Wiley, Chichester (2000)
Blackwell, D.: Discounted dynamic programming. Annals of Mathematical Statistics 26, 226–235 (1965)
Buyukkoc, C., Varaiya, P., Walrand, J.: The cμ-rule revisited. Advances in Applied Probability 17, 237–238 (1985)
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)
Duenyas, I., Van Oyen, M.P.: Stochastic Scheduling of Parallel Queues with Set-Up Costs. Queueing Systems Theory and Applications 19, 421–444 (1995)
Dreyfus, S.E., Law, A.M.: The Art and Theory of Dynamic Programming. Academic Press, New York (1977)
Fayolle, G., King, P.J.B., Mitrani, I.: The Solution of Certain Two-Dimensional Markov Models. In: Procs. of 7th International Conference on Modelling and Performance Evaluation, Toronto (1980)
Koole, G.: Assigning a Single Server to Inhomogeneous Queues with Switching Costs. Theoretical Computer Science 182, 203–216 (1997)
Koole, G.: Structural Results for the Control of Queueing Systems using Event- Based Dynamic Programming. Queueing Systems Theory and Applications 30, 323–339 (1998)
Liu, Z., Nain, P., Towsley, D.: On Optimal Polling Policies. Queueing Systems Theory and Applications 11, 59–83 (1992)
Palmer, J., Mitrani, I.: Dynamic Server Allocation in Heterogeneous Clusters. In: Procs. of HETNETs 2003: First International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks, UK, pp. 12/1–12/10 (July 2003)
Ross, S.M.: Introduction to Stochastic Dynamic Programming. Academic Press, London (1983)
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)
Whittle, P.: Optimisation over Time, vol. 1 and 2. Wiley, Chichester
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Palmer, J., Mitrani, I. (2004). Optimal Server Allocation in Reconfigurable Clusters with Multiple Job Types. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24709-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-24709-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22056-5
Online ISBN: 978-3-540-24709-8
eBook Packages: Springer Book Archive