ePrints

Optimal and heuristic policies for dynamic server allocation

Lookup NU author(s): Dr Jennie Palmer, Emeritus Professor Isi Mitrani

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

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. © 2005 Elsevier Inc. All rights reserved.

Publication metadata

Author(s): Palmer J, Mitrani I

Publication type: Article

Publication status: Published

Journal: Journal of Parallel and Distributed Computing

Year: 2005

Volume: 65

Issue: 10

Pages: 1204-1211

ISSN (print): 0743-7315

ISSN (electronic): 1096-0848

Publisher: Academic Press

URL: http://dx.doi.org/10.1016/j.jpdc.2005.04.010

DOI: 10.1016/j.jpdc.2005.04.010

Altmetrics

Share