
Click here for full text:
Resource Assignment for LargeScale Computing Utilities using Mathematical Programming
Zhu, Xiaoyun; Santos, Cipriano; Ward, Julie; Beyer, Dirk; Singhal, Sharad
HPL2003243R1
Keyword(s): utility computing; resource assignment; storage area networks; mixed integer programming
Abstract: In this paper, we describe a resource assignment problem (RAP) for a largescale computing utility, such as an Internet data center. The problem is defined as follows: For a given topology of a network consisting of switches and servers with varying capabilities, and for a given application with a distributed architecture, decide which server from the physical network should be assigned to each application component, such that the trafficweighted average interserver distance is minimized, and the application's processing, communication and storage requirements are satisfied without exceeding network capacity limits. This problem is first formulated as a nonlinear combinatorial optimization problem. We then describe three mixed integer programming formulations, RAPLINI, RAPLINII, and RAPMCFM, as the result of different linearization techniques. These models were numerically tested using CPLEX on a number of examples, ranging from a 125server utility data center to a set of hypothetical data centers with increasing size. In all cases and for all three models, the CPELX solver was able to find an optimal solution within reasonable amount of time. RAPLINII is the most efficient and required the minimum solution time. RAPMCFM has the highest complexity but is the most general in terms of its applicability to any network topology.
17 Pages
Back to Index
