公开(公告)号：US20120144219A1

公开(公告)日：2012-06-07

申请号：US12960690

申请日：2010-12-06

申请人： Abdolreza Salahshour ,  Samar Choudhary ,  Gargi B. Dasgupta ,  Anindya Neogi ,  Balan Subramanian ,  Akshat Verma

发明人： Abdolreza Salahshour ,  Samar Choudhary ,  Gargi B. Dasgupta ,  Anindya Neogi ,  Balan Subramanian ,  Akshat Verma

IPC分类号： G06F1/32

CPC分类号： G06F1/3203 ,  G06F1/329 ,  Y02D10/24

摘要： A method, system and computer-usable medium are disclosed for optimizing the power consumption of a plurality of information processing systems. Historical usage data representing power usage of a plurality of information processing systems is retrieved in response to a request to generate power savings recommendations. Statistical analysis is performed on the historical usage data are to determine usage patterns, which are then further analyzed to determine repetitions of the usage patterns. In turn, the repetitions of the usage patterns are analyzed to generate power consumption management recommendations to initiate power consumption management actions at particular times. One or more business constraints are determined, which are used to generate constraints to the power consumption management recommendations.

摘要翻译： 公开了一种用于优化多个信息处理系统的功耗的方法，系统和计算机可用介质。 响应于产生功率节省建议的请求来检索表示多个信息处理系统的功率使用的历史使用数据。 对历史使用数据进行统计分析以确定使用模式，然后进一步分析其使用模式以确定使用模式的重复。 反过来，分析使用模式的重复以产生功耗管理建议，以在特定时间启动功耗管理动作。 确定一个或多个业务约束，其用于对功耗管理建议产生约束。

公开(公告)号：US08230249B2

公开(公告)日：2012-07-24

申请号：US12503246

申请日：2009-07-15

申请人： Gargi B. Dasgupta ,  Anindya Neogi ,  Akshat Verma

发明人： Gargi B. Dasgupta ,  Anindya Neogi ,  Akshat Verma

IPC分类号： G06F1/32

CPC分类号： G06F9/5061 ,  G06F1/3209 ,  G06F9/5094 ,  Y02D10/22 ,  Y02D10/36

摘要： Techniques for dynamically selecting a server state for one or more servers in a cluster of servers are provided. The techniques include tracking each active and sleep state of each server in a cluster of servers, and selecting a server state for one or more servers in the cluster of servers to meet one or more workload level requirements of the cluster of servers, wherein selecting a server state for one or more servers comprises scheduling a transition between one or more active and sleep states for the one or more servers, wherein scheduling the transition comprises using power consumption information for each state and transition time information for each transition.

摘要翻译： 提供了用于为服务器集群中的一个或多个服务器动态选择服务器状态的技术。 这些技术包括跟踪服务器集群中的每个服务器的每个活动和睡眠状态，以及选择服务器集群中的一个或多个服务器的服务器状态，以满足服务器集群的一个或多个工作负载级别要求，其中选择 一个或多个服务器的服务器状态包括调度一个或多个服务器的一个或多个活动和睡眠状态之间的转换，其中调度转换包括使用每个状态的功耗信息和每个转换的转换时间信息。

公开(公告)号：US20110016339A1

公开(公告)日：2011-01-20

申请号：US12503246

申请日：2009-07-15

申请人： Gargi B. Dasgupta ,  Anindya Neogi ,  Akshat Verma

发明人： Gargi B. Dasgupta ,  Anindya Neogi ,  Akshat Verma

IPC分类号： G06F15/173 ,  G06F1/32

CPC分类号： G06F9/5061 ,  G06F1/3209 ,  G06F9/5094 ,  Y02D10/22 ,  Y02D10/36

摘要： Techniques for dynamically selecting a server state for one or more servers in a cluster of servers are provided. The techniques include tracking each active and sleep state of each server in a cluster of servers, and selecting a server state for one or more servers in the cluster of servers to meet one or more workload level requirements of the cluster of servers, wherein selecting a server state for one or more servers comprises scheduling a transition between one or more active and sleep states for the one or more servers, wherein scheduling the transition comprises using power consumption information for each state and transition time information for each transition.

摘要翻译： 提供了用于为服务器集群中的一个或多个服务器动态选择服务器状态的技术。 这些技术包括跟踪服务器集群中的每个服务器的每个活动和睡眠状态，以及选择服务器集群中的一个或多个服务器的服务器状态，以满足服务器集群的一个或多个工作负载级别要求，其中选择 一个或多个服务器的服务器状态包括调度一个或多个服务器的一个或多个活动和睡眠状态之间的转换，其中调度转换包括使用每个状态的功耗信息和每个转换的转换时间信息。

公开(公告)号：US20100011102A1

公开(公告)日：2010-01-14

申请号：US12171741

申请日：2008-07-11

申请人： Gargi B. Dasgupta ,  Ajay Mohindra ,  Anindya Neogi ,  Akshat Verma ,  Balaji Viswanathan

发明人： Gargi B. Dasgupta ,  Ajay Mohindra ,  Anindya Neogi ,  Akshat Verma ,  Balaji Viswanathan

IPC分类号： G06F15/173

CPC分类号： G06F9/5066 ,  G06F9/5094 ,  Y02D10/22 ,  Y02D10/36

摘要： Techniques for placing at least one composite application in a federated environment are provided. The techniques include analyzing a composite application to be deployed in a federated environment, obtaining one or more application artifacts, analyzing feasibility of placing one or more application components at one or more clusters in the federated environment without knowledge of resource availability at each of the one or more clusters, and generating a mapping of the one or more application components to the one or more clusters such that an application requirement is met, wherein the one or more application artifacts are distributed across a federated environment.

摘要翻译： 提供了在联合环境中放置至少一个复合应用程序的技术。 这些技术包括分析要在联合环境中部署的组合应用程序，获取一个或多个应用程序工件，分析将联合环境中的一个或多个集群放置一个或多个应用程序组件的可行性，而不了解每个应用程序组件中每一个的资源可用性 或更多的集群，以及生成所述一个或多个应用组件到所述一个或多个集群的映射，使得满足应用程序需求，其中所述一个或多个应用程序工件分布在联合环境中。

公开(公告)号：US07856500B2

公开(公告)日：2010-12-21

申请号：US12171741

申请日：2008-07-11

申请人： Gargi B. Dasgupta ,  Ajay Mohindra ,  Anindya Neogi ,  Akshat Verma ,  Balaji Viswanathan

发明人： Gargi B. Dasgupta ,  Ajay Mohindra ,  Anindya Neogi ,  Akshat Verma ,  Balaji Viswanathan

IPC分类号： G06F15/173

CPC分类号： G06F9/5066 ,  G06F9/5094 ,  Y02D10/22 ,  Y02D10/36

摘要： Techniques for placing at least one composite application in a federated environment are provided. The techniques include analyzing a composite application to be deployed in a federated environment, obtaining one or more application artifacts, analyzing feasibility of placing one or more application components at one or more clusters in the federated environment without knowledge of resource availability at each of the one or more clusters, and generating a mapping of the one or more application components to the one or more clusters such that an application requirement is met, wherein the one or more application artifacts are distributed across a federated environment.

摘要翻译： 提供了在联合环境中放置至少一个复合应用程序的技术。 这些技术包括分析要在联合环境中部署的组合应用程序，获取一个或多个应用程序工件，分析将联合环境中的一个或多个集群放置一个或多个应用程序组件的可行性，而不了解每个应用程序组件中每一个的资源可用性 或更多的集群，以及生成所述一个或多个应用组件到所述一个或多个集群的映射，使得满足应用程序需求，其中所述一个或多个应用程序工件分布在联合环境中。

公开(公告)号：US20120174104A1

公开(公告)日：2012-07-05

申请号：US13421123

申请日：2012-03-15

申请人： Anindya Neogi ,  Akshat Verma

发明人： Anindya Neogi ,  Akshat Verma

IPC分类号： G06F9/455

CPC分类号： G06F1/3203 ,  G06F9/45558 ,  G06F2009/4557

摘要： N applications are placed on M virtualized servers having power management capability. A time horizon is divided into a plurality of time windows, and, for each given one of the windows, a placement of the N applications is computed, taking into account power cost, migration cost, and performance benefit. The migration cost refers to cost to migrate from a first virtualized server to a second virtualized server for the given one of the windows. The N applications are placed onto the M virtualized servers, for each of the plurality of time windows, in accordance with the placement computed in the computing step for each of the windows.

摘要翻译： N个应用程序放置在具有电源管理功能的M个虚拟化服务器上​​。 时间范围被分为多个时间窗口，并且对于每个给定的一个窗口，计算N个应用的放置，同时考虑功率成本，迁移成本和性能优点。 迁移成本是指从给定的一个窗口从第一个虚拟化服务器迁移到第二个虚拟化服务器的成本。 根据在每个窗口的计算步骤中计算的位置，将N个应用程序放置在M个虚拟化服务器中，用于多个时间窗口中的每一个。

公开(公告)号：US08959523B2

公开(公告)日：2015-02-17

申请号：US13434961

申请日：2012-03-30

申请人： Priti P. Patil ,  Anindya Neogi ,  Aritra Sen ,  Akshat Verma

发明人： Priti P. Patil ,  Anindya Neogi ,  Aritra Sen ,  Akshat Verma

IPC分类号： G06F9/46 ,  G06F9/455 ,  G06F15/177 ,  G06F15/173

CPC分类号： G06F9/45558 ,  G06F9/5066 ,  G06F2009/4557 ,  G06F2009/45575

摘要： A virtual machine placement framework is described to enable a data center operator to develop a placement scheme to satisfy its particular constraints while simultaneously optimizing resource utilization. To generate a placement solution, the virtual machine placement problem is first characterized as a “bin packing” problem. The framework provides simple interface tools and processing modules, and a pluggable architecture for receiving placement algorithms. To generate a solution, an administrator creates an XML representation that abstracts physical entities (e.g., data center, subnet, rack, physical server, and the like) into a hierarchical tree of bins. The administrator also defines a set of “rules” that govern (direct) the placement of the virtual machines by placing constraints on the placement scheme. Using the hierarchical tree and the rules, the framework is executed to generate a placement as a solution to a bin packing problem, preferably on a layer-by-layer basis.

摘要翻译： 描述了虚拟机放置框架，以使数据中心操作员能够开发一种放置方案，以满足其特定的约束，同时优化资源利用。 为了生成一个放置解决方案，虚拟机放置问题首先被表征为“bin packing”问题。 该框架提供简单的界面工具和处理模块，以及用于接收放置算法的可插拔架构。 为了生成解决方案，管理员创建将物理实体（例如，数据中心，子网，机架，物理服务器等）抽象成分层树的树的XML表示。 管理员还定义了一套“规则”，它通过在放置方案上放置约束来管理（直接）虚拟机的放置。 使用分层树和规则，执行框架以生成作为bin打包问题的解决方案的放置，优选地在逐层的基础上。

公开(公告)号：US20100180275A1

公开(公告)日：2010-07-15

申请号：US12354072

申请日：2009-01-15

申请人： Anindya Neogi ,  Akshat Verma

发明人： Anindya Neogi ,  Akshat Verma

IPC分类号： G06F9/455 ,  G06F1/32

CPC分类号： G06F1/3203 ,  G06F9/45558 ,  G06F2009/4557

摘要： N applications are placed on M virtualized servers having power management capability. A time horizon is divided into a plurality of time windows, and, for each given one of the windows, a placement of the N applications is computed, taking into account power cost, migration cost, and performance benefit. The migration cost refers to cost to migrate from a first virtualized server to a second virtualized server for the given one of the windows. The N applications are placed onto the M virtualized servers, for each of the plurality of time windows, in accordance with the placement computed in the computing step for each of the windows. In an alternative aspect, power cost and performance benefit, but not migration cost, are taken into account; there are a plurality of virtual machines; and the computing step includes, for each of the windows, determining a target utilization for each of the servers based on a power model for each given one of the servers; picking a given one of the servers with a least power increase per unit increase in capacity, until capacity has been allocated to fit all the virtual machines; and employing a first fit decreasing bin packing technique to compute placement of the applications on the virtualized servers.

摘要翻译： N个应用程序放置在具有电源管理功能的M个虚拟化服务器上​​。 时间范围被分为多个时间窗口，并且对于每个给定的一个窗口，计算N个应用的放置，同时考虑功率成本，迁移成本和性能优点。 迁移成本是指从给定的一个窗口从第一个虚拟化服务器迁移到第二个虚拟化服务器的成本。 根据在每个窗口的计算步骤中计算的位置，将N个应用程序放置在M个虚拟化服务器中，用于多个时间窗口中的每一个。 在另一方面，考虑到电力成本和性能优势，但不是迁移成本; 有多个虚拟机; 并且所述计算步骤包括针对每个所述窗口，基于每个所述服务器中的每个服务器的功率模型确定每个所述服务器的目标利用率; 选择给定的一台服务器，每单位容量增加功率增加最少，直到容量分配到适合所有虚拟机为止; 并采用第一适合减少的bin打包技术来计算虚拟化服务器上​​的应用程序的布局。

公开(公告)号：US20100005173A1

公开(公告)日：2010-01-07

申请号：US12217439

申请日：2008-07-03

申请人： Ramesh Baskaran ,  Sameep Mehta ,  Anindya Neogi ,  Vinayaka D. Pandit ,  Gyana Ranjan Parija ,  Akshat Verma

发明人： Ramesh Baskaran ,  Sameep Mehta ,  Anindya Neogi ,  Vinayaka D. Pandit ,  Gyana Ranjan Parija ,  Akshat Verma

IPC分类号： G06F15/16

CPC分类号： G06F9/5066

摘要： A plurality of application profiles are obtained, for a plurality of applications. Each of the profiles specifies a list of resources, and requirements for each of the resources, associated with a corresponding one of the applications. Specification of a plurality of constraints associated with the applications is facilitated, as is obtaining a plurality of cost models associated with at least two different kinds of servers on which the applications are to run. A recommended server configuration is generated for running the applications, by formulating and solving a bin packing problem. Each of the at least two different kinds of servers is treated as a bin of a different size, based on its capacity, and has an acquisition cost associated therewith. The size is substantially equal to a corresponding one of the resource requirement as given by a corresponding one of the application profiles. Each of the applications is treated as an item, with an associated size, to be packed into the bins. The bin packing problem develops the recommended server configuration based on reducing a total acquisition cost while satisfying the constraints and the sizes of the applications.

摘要翻译： 获得多个应用简档，用于多个应用。 每个配置文件指定与相应应用程序相关联的资源列表和每个资源的要求。 促进与应用相关联的多个约束的规范，以及获得与要在其上运行应用的至少两种不同类型的服务器相关联的多个成本模型。 生成用于运行应用程序的推荐的服务器配置，通过制定和解决垃圾箱打包问题。 至少两种不同类型的服务器中的每一种基于其容量被视为不同尺寸的箱，并且具有与其相关联的购置成本。 该大小基本上等于由相应的一个应用简档给出的资源需求中相应的一个。 每个应用程序都被视为具有相关尺寸的项目，以将其打包到箱中。 垃圾箱打包问题在满足约束和应用程序的大小的基础上，降低了总采购成本，从而开发了推荐的服务器配置。

公开(公告)号：US08214829B2

公开(公告)日：2012-07-03

申请号：US12354072

申请日：2009-01-15

申请人： Anindya Neogi ,  Akshat Verma

发明人： Anindya Neogi ,  Akshat Verma

IPC分类号： G06F9/455

CPC分类号： G06F1/3203 ,  G06F9/45558 ,  G06F2009/4557

摘要： N applications are placed on M virtualized servers having power management capability. A time horizon is divided into a plurality of time windows, and, for each given one of the windows, a placement of the N applications is computed, taking into account power cost, migration cost, and performance benefit. The migration cost refers to cost to migrate from a first virtualized server to a second virtualized server for the given one of the windows. The N applications are placed onto the M virtualized servers, for each of the plurality of time windows, in accordance with the placement computed in the computing step for each of the windows. In an alternative aspect, power cost and performance benefit, but not migration cost, are taken into account; there are a plurality of virtual machines; and the computing step includes, for each of the windows, determining a target utilization for each of the servers based on a power model for each given one of the servers; picking a given one of the servers with a least power increase per unit increase in capacity, until capacity has been allocated to fit all the virtual machines; and employing a first fit decreasing bin packing technique to compute placement of the applications on the virtualized servers.

摘要翻译： N个应用程序放置在具有电源管理功能的M个虚拟化服务器上​​。 时间范围被分为多个时间窗口，并且对于每个给定的一个窗口，计算N个应用的放置，同时考虑功率成本，迁移成本和性能优点。 迁移成本是指从给定的一个窗口从第一个虚拟化服务器迁移到第二个虚拟化服务器的成本。 根据在每个窗口的计算步骤中计算的位置，将N个应用程序放置在M个虚拟化服务器中，用于多个时间窗口中的每一个。 在另一方面，考虑到电力成本和性能优势，但不是迁移成本; 有多个虚拟机; 并且所述计算步骤包括针对每个所述窗口，基于每个所述服务器中的每个服务器的功率模型确定每个所述服务器的目标利用率; 选择给定的一台服务器，每单位容量增加功率增加最少，直到容量分配到适合所有虚拟机为止; 并采用第一适合减少的bin打包技术来计算虚拟化服务器上​​的应用程序的布局。