公开(公告)号：US20070220586A1

公开(公告)日：2007-09-20

申请号：US11366853

申请日：2006-03-01

申请人： Norman Salazar ,  Cipriano Santos ,  Xiaoyun Zhu ,  James Pruyne

发明人： Norman Salazar ,  Cipriano Santos ,  Xiaoyun Zhu ,  James Pruyne

IPC分类号： H04L9/00

CPC分类号： G06N3/126 ,  G06F9/5066

摘要： A computer-based solver provides a method of assigning computing resources in a data center to meet computing resource requirements of an application. The solver initially creates a list of application components wherein each application component represents a largest possible combination of shared resource requirements from the application. Next, the solver identifies a set of eligible resource servers with each resource server capable of fulfilling the resource requirements for each application component in the list of application components. Typically, the resource requirements of either the shared or discrete are met by a resource server with sufficient capacity. If there is at least one feasible solution, the solver then matches an optimal combination of resource servers to each application component in the list of application components using a genetic algorithm (GA). The GA rapidly evaluates the solutions to find an optimal solution that tends to have lesser overall costs compared to other solutions identified.

摘要翻译： 基于计算机的求解器提供了在数据中心中分配计算资源以满足应用的计算资源需求的方法。 求解器最初创建应用程序组件的列表，其中每个应用程序组件表示来自应用程序的共享资源需求的最大可能组合。 接下来，解算器识别一组合格的资源服务器，每个资源服务器能够满足应用程序组件列表中每个应用程序组件的资源需求。 通常，具有足够容量的资源服务器满足共享或离散的资源需求。 如果存在至少一个可行解，则求解器然后使用遗传算法（GA）将资源服务器的最佳组合与应用组件列表中的每个应用组件进行匹配。 GA与其他确定的解决方案相比，快速评估解决方案，找出趋向于具有较低总体成本的最佳解决方案。