专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08112659B2 Reducing recovery time for business organizations in case of disasters 有权
标题翻译：减少商业机构在发生灾难时的恢复时间
公开(公告)号：US08112659B2
公开(公告)日：2012-02-07
申请号：US12487818
申请日：2009-06-19
申请人： Vijay Srinivas Agneeswaran , Hariprasad Nellitheertha Venkataraja
发明人： Vijay Srinivas Agneeswaran , Hariprasad Nellitheertha Venkataraja
IPC分类号： G06F11/00
CPC分类号： G06F11/2041 , G06F11/2025
摘要： An aspect of the present invention reduces the recovery time for business organizations in case of disasters. In one embodiment, a disaster recovery system containing a primary site and a backup site (implemented as a cluster) is maintained. Application instances are executed in both the primary site and the backup site, with the number of instances executed on the backup site being fewer than that executed on the primary site. During normal operation, user requests received are processed using only the instances executing in the primary site, while the instances executing in the backup site are used in a standby state. On identifying that a disaster has occurred, the user requests received immediately after identification of the disaster are processed using only the instances executing in the backup site. The cluster at the backup site is then scaled out to add application instances until a desired level/percentage is achieved.
摘要翻译：本发明的一个方面减少了商业组织在遇到灾难时的恢复时间。在一个实施例中，维护包含主站点和备用站点（实现为集群）的灾难恢复系统。应用程序实例在主站点和备份站点都执行，备份站点上执行的实例数量少于在主站点上执行的实例数。在正常操作期间，仅使用主站点中执行的实例处理接收的用户请求，而在备用站点中执行的实例在待机状态下使用。在确定发生灾难时，仅使用在备份站点中执行的实例来处理在识别灾难后立即收到的用户请求。然后将备份站点上的集群扩展到添加应用程序实例，直到达到所需的级别/百分比。

2. 发明申请

US20100325473A1 REDUCING RECOVERY TIME FOR BUSINESS ORGANIZATIONS IN CASE OF DISASTERS 有权
标题翻译：减少企业组织灾难恢复时间
公开(公告)号：US20100325473A1
公开(公告)日：2010-12-23
申请号：US12487818
申请日：2009-06-19
申请人： Vijay Srinivas Agneeswaran , Hariprasad Nellitheertha Venkataraja
发明人： Vijay Srinivas Agneeswaran , Hariprasad Nellitheertha Venkataraja
IPC分类号： G06F11/20
CPC分类号： G06F11/2041 , G06F11/2025
摘要： An aspect of the present invention reduces the recovery time for business organizations in case of disasters. In one embodiment, a disaster recovery system containing a primary site and a backup site (implemented as a cluster) is maintained. Application instances are executed in both the primary site and the backup site, with the number of instances executed on the backup site being fewer than that executed on the primary site. During normal operation, user requests received are processed using only the instances executing in the primary site, while the instances executing in the backup site are used in a standby state. On identifying that a disaster has occurred, the user requests received immediately after identification of the disaster are processed using only the instances executing in the backup site. The cluster at the backup site is then scaled out to add application instances until a desired level/percentage is achieved.
摘要翻译：本发明的一个方面减少了商业组织在遇到灾难时的恢复时间。在一个实施例中，维护包含主站点和备用站点（实现为集群）的灾难恢复系统。应用程序实例在主站点和备份站点都执行，备份站点上执行的实例数量少于在主站点上执行的实例数。在正常操作期间，仅使用主站点中执行的实例处理接收的用户请求，而在备用站点中执行的实例在待机状态下使用。在确定发生灾难时，仅使用在备份站点中执行的实例来处理在识别灾难后立即收到的用户请求。然后将备份站点上的集群扩展到添加应用程序实例，直到达到所需的级别/百分比。

3. 发明申请

US20110029969A1 ALTRUISTIC DEPENDABLE MEMORY OVERCOMMIT FOR VIRTUAL MACHINES 有权
标题翻译：针对虚拟机器的可追溯性的内存重写
公开(公告)号：US20110029969A1
公开(公告)日：2011-02-03
申请号：US12534718
申请日：2009-08-03
申请人： Hariprasad Nellitheertha Venkataraja , Vijay Srinivas Agneeswaran , Harish Chauhan , Sharad Lal
发明人： Hariprasad Nellitheertha Venkataraja , Vijay Srinivas Agneeswaran , Harish Chauhan , Sharad Lal
IPC分类号： G06F9/455
CPC分类号： G06F9/5077 , G06F9/45558 , G06F9/4881 , G06F2009/45583
摘要： This disclosure describes, generally, methods and systems for implementing memory overcommit of virtual machines. The method includes establishing a plurality of virtual machines on a physical machine, broadcasting, from each of the plurality of virtual machines to a central scheduler, resource usage requirements, and then based at least in part on the resource usage requirements broadcasted from each of the plurality of virtual machines, determining a resource requirements schedule for each of the plurality of virtual machines. The method further includes receiving at least one resource request from at least one of the plurality of virtual machines, based on the resource requirements schedule, un-assigning resources from at least one of the plurality of virtual machines, and assigning the un-assigned resources to the at least one of the plurality of virtual machines which initiated the resource request.
摘要翻译：本公开一般地描述了用于实现虚拟机的内存过量使用的方法和系统。该方法包括在物理机上建立多个虚拟机，从多个虚拟机中的每一个向中央调度器广播资源使用需求，然后至少部分地基于从每个虚拟机广播的资源使用需求多个虚拟机，确定所述多个虚拟机中的每一个的资源需求计划。该方法还包括基于资源需求调度从多个虚拟机中的至少一个接收至少一个资源请求，从多个虚拟机中的至少一个虚拟机中分配资源，以及分配未分配的资源到发起资源请求的多个虚拟机中的至少一个。

4. 发明申请

US20110022861A1 REDUCING POWER CONSUMPTION IN DATA CENTERS HAVING NODES FOR HOSTING VIRTUAL MACHINES 有权
标题翻译：减少虚拟机的数据中心的耗电量
公开(公告)号：US20110022861A1
公开(公告)日：2011-01-27
申请号：US12506277
申请日：2009-07-21
申请人： Vijay Srinivas Agneeswaran , Hariprasad Nellitheertha Venkataraja , Harish Chauhan , Sharad Satender Lal
发明人： Vijay Srinivas Agneeswaran , Hariprasad Nellitheertha Venkataraja , Harish Chauhan , Sharad Satender Lal
IPC分类号： G06F1/32 , G06F15/16 , G06F9/455
CPC分类号： G06F1/3203 , G06F1/3287 , G06F9/5077 , G06F9/5094 , Y02D10/171 , Y02D10/22 , Y02D10/36
摘要： According to an aspect of the present invention, nodes for hosting of new virtual machines (VM) are selected according to approaches designed to reduce power consumption in a grid. In an embodiment, the approaches are designed to facilitate the possibility of freeing one or more nodes from hosting VMs to power down the nodes, thereby reducing power consumption. Thus, an example approach is based on provisioning a new VM on a node which currently (immediately prior to provisioning) has the maximum resource consumption. Another example approach is based on provisioning a new VM on a node which currently has small-sized VMs in terms of resource requirements. In yet another embodiment, the approach is based on provisioning a new VM on a node located in a geographical area having low power tariffs.
摘要翻译：根据本发明的一个方面，根据设计用于降低网格中的功耗的方法来选择用于托管新虚拟机（VM）的节点。在一个实施例中，这些方法被设计为有助于释放一个或多个节点来托管VM以使节点断电，从而降低功耗。因此，示例性方法基于在当前（紧接在供应之前）具有最大资源消耗的节点上配置新的VM。另一个示例方法是基于在资源需求方面在当前具有小型VM的节点上配置新的VM。在另一个实施例中，该方法基于在位于具有低电力关税的地理区域中的节点上提供新的VM。

5. 发明授权

US08417991B2 Mitigating reduction in availability level during maintenance of nodes in a cluster 有权
标题翻译：在群集节点维护期间减少可用性级别
公开(公告)号：US08417991B2
公开(公告)日：2013-04-09
申请号：US12477141
申请日：2009-06-03
申请人： Hariprasad Nellitheertha Venkataraja , Vijay Srinivas Agneeswaran
发明人： Hariprasad Nellitheertha Venkataraja , Vijay Srinivas Agneeswaran
IPC分类号： G06F11/00
CPC分类号： G06F9/5072 , G06F9/5022
摘要： An aspect of the present invention mitigates reduction in availability level during maintenance of nodes in a cluster. In one embodiment, on receiving an indication that a maintenance activity is to be performed on the cluster, a scaling out of the cluster is first performed to add some nodes having the maintenance activity already performed, followed by a scaling in of the cluster to remove some of the nodes in the cluster which do not yet have the maintenance activity performed. The scaling out is performed before any scaling in of the cluster such that the number of nodes available in the cluster after the scaling in is not less than the number of nodes in the cluster at the time of receiving the indication. Accordingly, the reduction in availability level (which is based on the number of nodes available) is mitigated.
摘要翻译：本发明的一个方面减轻了在群集节点维护期间可用性水平的降低。在一个实施例中，在接收到将在集群上执行维护活动的指示时，首先执行对集群的扩展以添加已经执行了维护活动的一些节点，然后在集群中进行缩放以移除集群中尚未执行维护活动的某些节点。在集群中的任何缩放之前执行缩小，使得在缩放之后集群中可用的节点的数量不小于在接收指示时集群中的节点的数量。因此，减少可用性级别（其基于可用节点数量）被减轻。

6. 发明申请

US20100313063A1 MITIGATING REDUCTION IN AVAILABILITY LEVEL DURING MAINTENANCE OF NODES IN A CLUSTER 有权
标题翻译：在群集维护期间降低可用性水平
公开(公告)号：US20100313063A1
公开(公告)日：2010-12-09
申请号：US12477141
申请日：2009-06-03
申请人： Hariprasad Nellitheertha Venkataraja , Vijay Srinivas Agneeswaran
发明人： Hariprasad Nellitheertha Venkataraja , Vijay Srinivas Agneeswaran
IPC分类号： G06F11/00
CPC分类号： G06F9/5072 , G06F9/5022
摘要： An aspect of the present invention mitigates reduction in availability level during maintenance of nodes in a cluster. In one embodiment, on receiving an indication that a maintenance activity is to be performed on the cluster, a scaling out of the cluster is first performed to add some nodes having the maintenance activity already performed, followed by a scaling in of the cluster to remove some of the nodes in the cluster which do not yet have the maintenance activity performed. The scaling out is performed before any scaling in of the cluster such that the number of nodes available in the cluster after the scaling in is not less than the number of nodes in the cluster at the time of receiving the indication. Accordingly, the reduction in availability level (which is based on the number of nodes available) is mitigated.
摘要翻译：本发明的一个方面减轻了在群集节点维护期间可用性水平的降低。在一个实施例中，在接收到将在集群上执行维护活动的指示时，首先执行对集群的扩展以添加已经执行了维护活动的一些节点，然后在集群中进行缩放以移除集群中尚未执行维护活动的某些节点。在集群中的任何缩放之前执行缩小，使得在缩放之后集群中可用的节点的数量不小于在接收指示时集群中的节点的数量。因此，减少可用性级别（其基于可用节点数量）被减轻。

7. 发明授权

US09740533B2 Altruistic dependable memory overcommit for virtual machines 有权
公开(公告)号：US09740533B2
公开(公告)日：2017-08-22
申请号：US12534718
申请日：2009-08-03
申请人： Hariprasad Nellitheertha Venkataraja , Vijay Srinivas Agneeswaran , Harish Chauhan , Sharad Lal
发明人： Hariprasad Nellitheertha Venkataraja , Vijay Srinivas Agneeswaran , Harish Chauhan , Sharad Lal
IPC分类号： G06F9/455 , G06F9/50
CPC分类号： G06F9/5077 , G06F9/45558 , G06F9/4881 , G06F2009/45583
摘要： This disclosure describes, generally, methods and systems for implementing memory overcommit of virtual machines. The method includes establishing a plurality of virtual machines on a physical machine, broadcasting, from each of the plurality of virtual machines to a central scheduler, resource usage requirements, and then based at least in part on the resource usage requirements broadcasted from each of the plurality of virtual machines, determining a resource requirements schedule for each of the plurality of virtual machines. The method further includes receiving at least one resource request from at least one of the plurality of virtual machines, based on the resource requirements schedule, un-assigning resources from at least one of the plurality of virtual machines, and assigning the un-assigned resources to the at least one of the plurality of virtual machines which initiated the resource request.

8. 发明授权

US08930731B2 Reducing power consumption in data centers having nodes for hosting virtual machines 有权
标题翻译：降低具有用于托管虚拟机的节点的数据中心的功耗
公开(公告)号：US08930731B2
公开(公告)日：2015-01-06
申请号：US12506277
申请日：2009-07-21
申请人： Vijay Srinivas Agneeswaran , Hariprasad Nellitheertha Venkataraja , Harish Chauhan , Sharad Satender Lal
发明人： Vijay Srinivas Agneeswaran , Hariprasad Nellitheertha Venkataraja , Harish Chauhan , Sharad Satender Lal
IPC分类号： G06F1/32 , G06F9/455 , G06F9/50
CPC分类号： G06F1/3203 , G06F1/3287 , G06F9/5077 , G06F9/5094 , Y02D10/171 , Y02D10/22 , Y02D10/36
摘要： According to an aspect of the present invention, nodes for hosting of new virtual machines (VM) are selected according to approaches designed to reduce power consumption in a grid. In an embodiment, the approaches are designed to facilitate the possibility of freeing one or more nodes from hosting VMs to power down the nodes, thereby reducing power consumption. Thus, an example approach is based on provisioning a new VM on a node which currently (immediately prior to provisioning) has the maximum resource consumption. Another example approach is based on provisioning a new VM on a node which currently has small-sized VMs in terms of resource requirements. In yet another embodiment, the approach is based on provisioning a new VM on a node located in a geographical area having low power tariffs.
摘要翻译：根据本发明的一个方面，根据设计用于降低网格中的功耗的方法来选择用于托管新虚拟机（VM）的节点。在一个实施例中，这些方法被设计为有助于释放一个或多个节点来托管VM以使节点断电，从而降低功耗。因此，示例性方法基于在当前（紧接在供应之前）具有最大资源消耗的节点上配置新的VM。另一个示例方法是基于在资源需求方面在当前具有小型VM的节点上配置新的VM。在另一个实施例中，该方法基于在位于具有低电力关税的地理区域中的节点上提供新的VM。

9. 发明授权

US08037058B2 Reducing access time for data in file systems when seek requests are received ahead of access requests 有权
标题翻译：在访问请求之前接收到查询请求时，减少文件系统中数据的访问时间
公开(公告)号：US08037058B2
公开(公告)日：2011-10-11
申请号：US12420834
申请日：2009-04-09
申请人： Hariprasad Nellitheertha Venkataraja
发明人： Hariprasad Nellitheertha Venkataraja
IPC分类号： G06F17/30
CPC分类号： G06F17/30067
摘要： Reducing access time for data in a file system when seek requests are received ahead of access requests. In one embodiment, an operating system providing access to the file system receives a seek request (from a user application) indicating an identifier of a file and a location within the file at which a data is sought to be accessed. In response, the operating system computes the offset of a disk block containing the location (thereby the data that is sought to be accessed). On receiving an access request (after the seek request from the same user application) indicating an operation to be performed on the data, the operating system executes the operation on the data using the pre-computed offset of the disk block. The computation of the disk block is performed before the access request is received thereby reducing the time required to process the access request.
摘要翻译：在访问请求之前接收到查询请求时，减少文件系统中数据的访问时间。在一个实施例中，提供对文件系统的访问的操作系统从用户应用接收指示文件的标识符的寻求请求以及寻求数据被访问的文件内的位置。作为响应，操作系统计算包含位置（从而寻求被访问的数据）的磁盘块的偏移量。在接收到指示要对数据执行的操作的访问请求（来自相同的用户应用的寻求请求之后）时，操作系统使用预先计算的磁盘块的偏移来对数据执行操作。在接收到访问请求之前执行磁盘块的计算，从而减少处理访问请求所需的时间。

10. 发明申请

US20100262594A1 REDUCING ACCESS TIME FOR DATA IN FILE SYSTEMS WHEN SEEK REQUESTS ARE RECEIVED AHEAD OF ACCESS REQUESTS 有权
标题翻译：当查询请求被接收到访问请求时，减少文件系统中数据的访问时间
公开(公告)号：US20100262594A1
公开(公告)日：2010-10-14
申请号：US12420834
申请日：2009-04-09
申请人： Hariprasad Nellitheertha Venkataraja
发明人： Hariprasad Nellitheertha Venkataraja
IPC分类号： G06F17/30 , G06F12/00
CPC分类号： G06F17/30067
摘要： Reducing access time for data in a file system when seek requests are received ahead of access requests. In one embodiment, an operating system providing access to the file system receives a seek request (from a user application) indicating an identifier of a file and a location within the file at which a data is sought to be accessed. In response, the operating system computes the offset of a disk block containing the location (thereby the data that is sought to be accessed). On receiving an access request (after the seek request from the same user application) indicating an operation to be performed on the data, the operating system executes the operation on the data using the pre-computed offset of the disk block. The computation of the disk block is performed before the access request is received thereby reducing the time required to process the access request.
摘要翻译：在访问请求之前接收到查询请求时，减少文件系统中数据的访问时间。在一个实施例中，提供对文件系统的访问的操作系统从用户应用接收指示文件的标识符的寻求请求以及寻求数据被访问的文件内的位置。作为响应，操作系统计算包含位置（从而寻求被访问的数据）的磁盘块的偏移量。在接收到指示要对数据执行的操作的访问请求（来自相同的用户应用的寻求请求之后）时，操作系统使用预先计算的磁盘块的偏移来对数据执行操作。在接收到访问请求之前执行磁盘块的计算，从而减少处理访问请求所需的时间。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式