公开(公告)号：US07788280B2

公开(公告)日：2010-08-31

申请号：US11940680

申请日：2007-11-15

申请人： Raghavendra Singh ,  Anindya Neogi ,  Bharat Krishnamurthy ,  Ravi Kothari

发明人： Raghavendra Singh ,  Anindya Neogi ,  Bharat Krishnamurthy ,  Ravi Kothari

IPC分类号： G06F17/00

CPC分类号： G06F17/30994 ,  G06F11/324

摘要： A method is disclosed for facilitating visualisation of status data in an electronic system. The status data comprises metadata including a plurality of information context categories. The status data also comprises data nodes, each data node including specific instances of a respective context category. The method starts with selecting possible data combinations and permutations of the information context categories, each permutation defining a respective hierarchy. For each permutation, information content of data for each node of the respective hierarchy is estimated and an informative tree and total entropy for all informative nodes are found. The permutation and the informative tree that has the lowest total entropy are then presented to the user.

摘要翻译： 公开了一种用于促进电子系统中的状态数据的可视化的方法。 状态数据包括包括多个信息上下文类别的元数据。 状态数据还包括数据节点，每个数据节点包括相应上下文类别的特定实例。 该方法开始于选择可能的数据组合和信息上下文类别的排列，每个置换定义相应的层次结构。 对于每个排列，估计各层次的每个节点的数据的信息内容，并且找到所有信息节点的信息树和总熵。 然后将具有最低总熵的置换和信息树呈现给用户。

公开(公告)号：US20100058334A1

公开(公告)日：2010-03-04

申请号：US12199173

申请日：2008-08-27

申请人： Ajay Mohindra ,  Anindya Neogi

发明人： Ajay Mohindra ,  Anindya Neogi

IPC分类号： G06F9/45

CPC分类号： H04L47/803 ,  G06F9/5077 ,  G06Q50/10 ,  H04L41/0893 ,  H04L47/805 ,  H04L67/10

摘要： A system and method for managing dynamically allocated resources assigned to a service includes providing a service to be used by a plurality of sites in a federation. Usage information associated with the service is communicated to each of the plurality of sites. A disposition of the service is determined based on local policies and the usage information received from other sites by a service owner. The disposition of the service is updated across a plurality of sites in accordance with messages sent by the service owner to reduce resource usage.

摘要翻译： 用于管理分配给服务的动态分配的资源的系统和方法包括提供要由联合中的多个站点使用的服务。 与服务相关联的使用信息被传送到多个站点中的每个站点。 根据本地策略和服务所有者从其他站点接收的使用信息确定服务的配置。 根据服务所有者发送的消息，服务的配置在多个站点上被更新以减少资源使用。

公开(公告)号：US20090132555A1

公开(公告)日：2009-05-21

申请号：US11940680

申请日：2007-11-15

申请人： Raghavendra Singh ,  Anindya Neogi ,  Bharat Krishnamurthy ,  Ravi Kothari

发明人： Raghavendra Singh ,  Anindya Neogi ,  Bharat Krishnamurthy ,  Ravi Kothari

IPC分类号： G06F17/30

CPC分类号： G06F17/30994 ,  G06F11/324

摘要： A method is disclosed for facilitating visualisation of status data in an electronic system. The status data comprises metadata including a plurality of information context categories. The status data also comprises data nodes, each data node including specific instances of a respective context category. The method starts with selecting possible data combinations and permutations of the information context categories, each permutation defining a respective hierarchy. For each permutation, information content of data for each node of the respective hierarchy is estimated and an informative tree and total entropy for all informative nodes are found. The permutation and the informative tree that has the lowest total entropy are then presented to the user.

摘要翻译： 公开了一种用于促进电子系统中的状态数据的可视化的方法。 状态数据包括包括多个信息上下文类别的元数据。 状态数据还包括数据节点，每个数据节点包括相应上下文类别的特定实例。 该方法开始于选择可能的数据组合和信息上下文类别的排列，每个置换定义相应的层次结构。 对于每个排列，估计各层次的每个节点的数据的信息内容，并且找到所有信息节点的信息树和总熵。 然后将具有最低总熵的置换和信息树呈现给用户。

公开(公告)号：US20080183778A1

公开(公告)日：2008-07-31

申请号：US12061730

申请日：2008-04-03

申请人： Anindya Neogi ,  Ravi Kothari ,  Raghavendra Singh

发明人： Anindya Neogi ,  Ravi Kothari ,  Raghavendra Singh

IPC分类号： G06F12/02 ,  G06F17/30

CPC分类号： G06F17/30312

摘要： There is disclosed methods, systems and computer program products for purging stored data in a repository. Users attach relative importance to all data samples across all timeseries in a repository. The importance attached to a data sample is the ‘utility value’ of the data sample. An algorithm uses the utility of data samples and allocates the storage space of the repository in such a way that the total loss of information due to purging is minimized while preserving samples with a high utility value.

摘要翻译： 公开了用于在存储库中清除存储的数据的方法，系统和计算机程序产品。 用户对存储库中所有时间序列上的所有数据样本具有相对重要性。 数据样本的重要性是数据样本的“效用值”。 一种算法使用数据样本的实用程序，并以这样的方式分配存储空间，使得清除信息的总损失最小化，同时保留具有高实用价值的样本。

公开(公告)号：US09442550B2

公开(公告)日：2016-09-13

申请号：US13421123

申请日：2012-03-15

申请人： Anindya Neogi ,  Akshat Verma

发明人： Anindya Neogi ,  Akshat Verma

IPC分类号： G06F1/32 ,  G06F9/45 ,  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个虚拟化服务器中，用于多个时间窗口中的每一个。

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

公开(公告)号：US08244873B2

公开(公告)日：2012-08-14

申请号：US13041939

申请日：2011-03-07

申请人： 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.

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

公开(公告)号：US20110161470A1

公开(公告)日：2011-06-30

申请号：US13041939

申请日：2011-03-07

申请人： 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/177

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.

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

公开(公告)号：US07970905B2

公开(公告)日：2011-06-28

申请号：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.

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

公开(公告)号：US20080120346A1

公开(公告)日：2008-05-22

申请号：US11562541

申请日：2006-11-22

申请人： Anindya Neogi ,  Ravi Kothari ,  Raghavendra Singh

发明人： Anindya Neogi ,  Ravi Kothari ,  Raghavendra Singh

IPC分类号： G06F17/00 ,  G06F12/00

CPC分类号： G06F16/22

摘要： There is disclosed methods, systems and computer program products for purging stored data in a repository. Users attach relative importance to all data samples across all timeseries in a repository. The importance attached to a data sample is the ‘utility value’ of the data sample. An algorithm uses the utility of data samples and allocates the storage space of the repository in such a way that the total loss of information due to purging is minimized while preserving samples with a high utility value.