公开(公告)号：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打包问题的解决方案的放置，优选地在逐层的基础上。

公开(公告)号：US20130263120A1

公开(公告)日：2013-10-03

申请号：US13434961

申请日：2012-03-30

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

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

IPC分类号： G06F9/455

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打包问题的解决方案的放置，优选地在逐层的基础上。

公开(公告)号：US09176762B2

公开(公告)日：2015-11-03

申请号：US13539793

申请日：2012-07-02

申请人： Deepak Arun Deshpande ,  Anindya Neogi ,  Priti P. Patil

发明人： Deepak Arun Deshpande ,  Anindya Neogi ,  Priti P. Patil

IPC分类号： G06F9/455 ,  G06F9/50

CPC分类号： G06F9/45533 ,  G06F9/5011 ,  G06F2209/504 ,  Y02D10/22

摘要： In response to a performance parameter of a virtual machine (VM) exceeding a threshold, an operation to be performed relative to the VM is identified. A resource requirement of performing the operation is determined using a resource requirement thresholds hierarchy. The resource requirement thresholds hierarchy is usable for computing the resource requirement of the operation when the operation is performed at a specified level in a hierarchy within a virtualized environment where the VM is executing. A violation value resulting from performing the operation is determined using a violation value thresholds hierarchy. If the resource requirement and the violation value do not exceed a resource requirement threshold and a violation value threshold respectively, a first configuration of the VM is revised to a second configuration of the VM. The second configuration includes a result of performing the operation relative to the VM at the specified level in the hierarchy.

摘要翻译： 响应于超过阈值的虚拟机（VM）的性能参数，识别要相对于VM执行的操作。 使用资源需求阈值层次来确定执行操作的资源需求。 当在虚拟机正在执行的虚拟化环境中的层次结构中的指定级别执行操作时，资源需求阈值层次可用于计算操作的资源需求。 使用违规值阈值层次结构确定执行操作产生的违规值。 如果资源需求和违规值分别不超过资源需求阈值和违例值阈值，则VM的第一配置被修改为VM的第二配置。 第二配置包括在层次结构中执行相对于指定级别的VM的操作的结果。

公开(公告)号：US20130054299A1

公开(公告)日：2013-02-28

申请号：US13214332

申请日：2011-08-22

申请人： DEEPAK ARUN DESHPANDE ,  Anindya Neogi ,  Priti P. Patil

发明人： DEEPAK ARUN DESHPANDE ,  Anindya Neogi ,  Priti P. Patil

IPC分类号： G06Q10/00

CPC分类号： G06Q10/06

摘要： A method, system, and computer program product for user interface for dynamic workflow state management are provided in the illustrative embodiments. A set of steps of a workflow is presented as a set of tabs in a graphical user interface (UI). Each tab includes a visual indicator indicating a status of a corresponding step associated with that tab. Tor a step in the set of steps, a visual indicator in a tab is used to depict a status of the step in the workflow, the visual indicator visually changing with a change in the status of the step. A status update is received for the step. A determination is made whether the status update also includes a status update for a related step in the workflow, A visual indicator corresponding to the related step is changed in accordance with the status update for the related step.

摘要翻译： 在说明性实施例中提供了用于动态工作流状态管理的用户界面的方法，系统和计算机程序产品。 工作流的一组步骤在图形用户界面（UI）中呈现为一组选项卡。 每个选项卡包括指示与该选项卡相关联的对应步骤的状态的视觉指示符。 在步骤集中的步骤中，选项卡中的可视指示器用于描绘工作流中步骤的状态，视觉指示器随着步骤状态的变化而可视化地变化。 接收到该步骤的状态更新。 确定状态更新是否还包括工作流中的相关步骤的状态更新。根据相关步骤的状态更新来改变与相关步骤相对应的视觉指示符。

公开(公告)号：US20140007093A1

公开(公告)日：2014-01-02

申请号：US13539793

申请日：2012-07-02

申请人： Deepak Arun Deshpande ,  Anindya Neogi ,  Priti P. Patil

发明人： Deepak Arun Deshpande ,  Anindya Neogi ,  Priti P. Patil

IPC分类号： G06F9/455

CPC分类号： G06F9/45533 ,  G06F9/5011 ,  G06F2209/504 ,  Y02D10/22

摘要： In response to a performance parameter of a virtual machine (VM) exceeding a threshold, an operation to be performed relative to the VM is identified. A resource requirement of performing the operation is determined using a resource requirement thresholds hierarchy. The resource requirement thresholds hierarchy is usable for computing the resource requirement of the operation when the operation is performed at a specified level in a hierarchy within a virtualized environment where the VM is executing. A violation value resulting from performing the operation is determined using a violation value thresholds hierarchy. If the resource requirement and the violation value do not exceed a resource requirement threshold and a violation value threshold respectively, a first configuration of the VM is revised to a second configuration of the VM. The second configuration includes a result of performing the operation relative to the VM at the specified level in the hierarchy.

公开(公告)号：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个虚拟化服务器中，用于多个时间窗口中的每一个。

公开(公告)号：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.

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

公开(公告)号：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.

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