A Tabu Search Algorithm for application placement in computer clustering

J. P. van der Gaast

doi:10.1016/j.cor.2014.03.025

A Tabu Search Algorithm for application placement in computer clustering

2014-10-01

11

PRE

AI

J

J. P. van der Gaast *

C

Cornelius A. Rietveld

DOI：10.1016/j.cor.2014.03.025

Original

Original request for help

Save

Abstract

En 中文

This paper presents and analyzes a model for the problem of placing applications on computer clusters (APP). In this problem, organizations requesting a set of software applications have to be assigned to computer clusters such that the costs of opening clusters and installing the necessary applications are minimized. This problem is related to known OR problems such as the multiproduct facility location problem and the generalized bin packing problem. We show that APP is NP-hard, and then propose a simple Tabu Search heuristic to solve it. The performance of the Tabu Search heuristic is assessed via extensive computational experiments, which indicate the promise of the proposed Tabu Search. (C) 2014 Elsevier Ltd. All rights reserved.

Keywords:

Placement problem

Facility location

Generalized binpacking

Tabu search

Integer programming

A Tabu Search Algorithm for application placement in computer clustering

Abstract

Journal

Organization