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. © Springer-Verlag 2004.
CITATION STYLE
Palmer, J., & Mitrani, I. (2004). Optimal Server Allocation in Reconfigurable Clusters with Multiple Job Types. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3044, 76–86. https://doi.org/10.1007/978-3-540-24709-8_9
Mendeley helps you to discover research relevant for your work.