Recovery segment identification in a computing infrastructure
    21.
    发明授权
    Recovery segment identification in a computing infrastructure 失效
    计算基础设施中的恢复段识别

    公开(公告)号:US07490265B2

    公开(公告)日:2009-02-10

    申请号:US11382498

    申请日:2006-05-10

    IPC分类号: G06F11/00

    CPC分类号: G06F11/1482

    摘要: A solution for managing a computer infrastructure is provided. In particular, the solution can generate a set of tentative recovery segments for the computer infrastructure based on a related resource graph and a set of partition rules. The related resource graph can be generated based on a managed resource graph, which includes resource type information for each node in the managed resource graph. The set of tentative recovery segments can be used to manage the computer infrastructure and/or a set of recovery segments, which includes recovery characteristic(s) for each segment can be generated based on the set of tentative recovery segments and a set of recovery segment templates. In any event, the invention provides a solution that fully and/or partially automates the identification of recovery segments within a computer infrastructure, thereby enabling a more effective management of the computer infrastructure.

    摘要翻译: 提供了一种用于管理计算机基础架构的解决方案。 特别地,该解决方案可以基于相关资源图和一组分区规则为计算机基础设施生成一组暂定恢复段。 可以基于被管理的资源图来生成相关的资源图,其中包括被管理的资源图中的每个节点的资源类型信息。 该组临时恢复段可用于管理计算机基础设施和/或一组恢复段,其中包括每个段的恢复特性可以基于一组临时恢复段和一组恢复段生成 模板。 无论如何,本发明提供了一种完全和/或部分地自动化计算机基础设施内的恢复段的识别的解决方案,从而能够更有效地管理计算机基础设施。

    Policy driven autonomic computing-specifying relationships
    22.
    发明授权
    Policy driven autonomic computing-specifying relationships 有权
    政策驱动的自主计算 - 指定关系

    公开(公告)号:US07451201B2

    公开(公告)日:2008-11-11

    申请号:US10675828

    申请日:2003-09-30

    IPC分类号: G06F15/173 G06F15/177

    摘要: An autonomic computing system and method determine policy definitions (404) and a set of available actions (410); monitor resources distributed within the system; determine if the system is at a desired end state; and modify resource states by sending instructions for the resources to perform available actions. The policy definitions (404) specify: start order between resources, prioritization between resources, conditional activation of policies, desired end state of resources, and location limitation of resources. The system and method receive status information from available resources, and monitor and modify the system until it reaches the desired end state. The policy definitions (404) can be determined by specifying a user-defined system end state and resource relationships. The policy definitions (404) can further harvest implicit relationships between resources, via self-discovery, and underlying relationships among resources.

    摘要翻译: 自动计算系统和方法确定策略定义(404)和一组可用动作(410); 监控系统内分布的资源; 确定系统是否处于期望的结束状态; 并通过发送资源指令来执行可用的动作来修改资源状态。 政策定义(404)规定:资源之间的启动顺序,资源之间的优先级,策略的条件激活,资源的期望结束状态和资源的位置限制。 系统和方法从可用资源接收状态信息,并监视和修改系统,直到达到期望的结束状态。 策略定义(404)可以通过指定用户定义的系统结束状态和资源关系来确定。 政策定义(404)可以通过自我发现和资源之间的潜在关系进一步收集资源之间的隐含关系。

    RECOVERY SEGMENT IDENTIFICATION IN A COMPUTING INFRASTRUCTURE
    23.
    发明申请
    RECOVERY SEGMENT IDENTIFICATION IN A COMPUTING INFRASTRUCTURE 失效
    计算基础设施中的恢复部分识别

    公开(公告)号:US20070266029A1

    公开(公告)日:2007-11-15

    申请号:US11382498

    申请日:2006-05-10

    IPC分类号: G06F17/30

    CPC分类号: G06F11/1482

    摘要: A solution for managing a computer infrastructure is provided. In particular, the solution can generate a set of tentative recovery segments for the computer infrastructure based on a related resource graph and a set of partition rules. The related resource graph can be generated based on a managed resource graph, which includes resource type information for each node in the managed resource graph. The set of tentative recovery segments can be used to manage the computer infrastructure and/or a set of recovery segments, which includes recovery characteristic(s) for each segment can be generated based on the set of tentative recovery segments and a set of recovery segment templates. In any event, the invention provides a solution that fully and/or partially automates the identification of recovery segments within a computer infrastructure, thereby enabling a more effective management of the computer infrastructure.

    摘要翻译: 提供了一种用于管理计算机基础架构的解决方案。 特别地,该解决方案可以基于相关资源图和一组分区规则为计算机基础设施生成一组暂定恢复段。 可以基于被管理的资源图来生成相关的资源图,其中包括被管理的资源图中的每个节点的资源类型信息。 该组临时恢复段可用于管理计算机基础设施和/或一组恢复段,其中包括每个段的恢复特性可以基于一组临时恢复段和一组恢复段生成 模板。 无论如何,本发明提供了一种完全和/或部分地自动化计算机基础设施内的恢复段的识别的解决方案,从而能够更有效地管理计算机基础设施。

    Reconfiguring a network by utilizing a predetermined length quiescent state
    24.
    发明授权
    Reconfiguring a network by utilizing a predetermined length quiescent state 有权
    通过利用预定长度的静态状态重新配置网络

    公开(公告)号:US07069320B1

    公开(公告)日:2006-06-27

    申请号:US09411515

    申请日:1999-10-04

    IPC分类号: G06F15/173

    摘要: A network having a plurality of nodes is reconfigured to reflect a change in topology of the network. In particular, upon receiving a reconfiguration request, each node enters a quiescent state for a predetermined period of time sufficient to allow at least one other node to also enter a quiescent state. Then, upon termination of the quiescent state, the node is reconfigured to reflect the change in the topology of the network without having to check with any other nodes of the network. In other embodiments, the predetermined period of time is sufficient to allow currently executing protocols to complete execution as well as to allow the transmission of reconfiguration requests for propagating reconfiguration in the network.

    摘要翻译: 重新配置具有多个节点的网络以反映网络拓扑的变化。 特别地,在接收到重新配置请求时,每个节点进入静态状态达预定时间段,足以允许至少一个其他节点也进入静止状态。 然后,在静止状态终止时,重新配置节点以反映网络拓扑的变化,而不必与网络的任何其他节点进行检查。 在其他实施例中,预定时间段足以允许当前执行的协议完成执行以及允许传输重新配置请求以在网络中传播重新配置。

    Policy driven autonomic computing-specifying relationships
    25.
    发明申请
    Policy driven autonomic computing-specifying relationships 有权
    政策驱动的自主计算 - 指定关系

    公开(公告)号:US20050091352A1

    公开(公告)日:2005-04-28

    申请号:US10675828

    申请日:2003-09-30

    摘要: An autonomic computing system and method determine policy definitions (404) and a set of available actions (410); monitor resources distributed within the system; determine if the system is at a desired end state; and modify resource states by sending instructions for the resources to perform available actions. The policy definitions (404) specify: start order between resources, prioritization between resources, conditional activation of policies, desired end state of resources, and location limitation of resources. The system and method receive status information from available resources, and monitor and modify the system until it reaches the desired end state. The policy definitions (404) can be determined by specifying a user-defined system end state and resource relationships. The policy definitions (404) can further harvest implicit relationships between resources, via self-discovery, and underlying relationships among resources.

    摘要翻译: 自动计算系统和方法确定策略定义(404)和一组可用动作(410); 监控系统内分布的资源; 确定系统是否处于期望的结束状态; 并通过发送资源指令来执行可用的动作来修改资源状态。 政策定义(404)规定:资源之间的启动顺序,资源之间的优先级,策略的条件激活,资源的期望结束状态和资源的位置限制。 系统和方法从可用资源接收状态信息,并监视和修改系统,直到达到期望的结束状态。 策略定义(404)可以通过指定用户定义的系统结束状态和资源关系来确定。 政策定义(404)可以通过自我发现和资源之间的潜在关系进一步收集资源之间的隐含关系。

    Policy driven autonomic computing-programmatic policy definitions
    26.
    发明授权
    Policy driven autonomic computing-programmatic policy definitions 有权
    政策驱动的自主计算 - 方案政策定义

    公开(公告)号:US08892702B2

    公开(公告)日:2014-11-18

    申请号:US10675001

    申请日:2003-09-30

    IPC分类号: G06F15/173 G06Q10/10

    CPC分类号: G06Q10/10

    摘要: An autonomic computing system and method determine that a desired end state cannot be reached, determine that an acceptable sub-state can be reached using at least one of priority ratings, conditional relationship specifications, and alternative relationship specifications, and place the computing system in an acceptable sub-state. The priority ratings can contain an attribute assigned to a policy definition that determines a sequence for applying the policy definition. The attribute can be “mandatory”, a numerical value, or “not required”. The conditional relationship specifications have policy definitions that are applied when the state of a specified resource meets a predetermined requirement. An alternative relationship specification has policy definitions and/or conditional relationship specifications that are applied when the state of a specified resource does not meet a predetermined requirement.

    摘要翻译: 自动计算系统和方法确定不能达到期望的结束状态,使用优先等级,条件关系规范和备选关系规范中的至少一个来确定可以达到可接受的子状态,并将计算系统置于 可接受的子状态。 优先等级可以包含分配给策略定义的属性,该属性确定应用策略定义的顺序。 属性可以是“必需”,数值或“不需要”。 条件关系规范具有在指定资源的状态满足预定要求时应用的策略定义。 替代关系规范具有在指定资源的状态不满足预定要求时应用的策略定义和/或条件关系规范。

    Computer program product using two different programs to determine state of a network node to eliminate message response delays in system processing
    27.
    发明授权
    Computer program product using two different programs to determine state of a network node to eliminate message response delays in system processing 失效
    计算机程序产品使用两个不同的程序来确定网络节点的状态,以消除系统处理中的消息响应延迟

    公开(公告)号:US07747756B2

    公开(公告)日:2010-06-29

    申请号:US12182321

    申请日:2008-07-30

    IPC分类号: G06F15/16

    CPC分类号: H04L12/2801 H04L69/40

    摘要: The determination of node and/or adapter liveness in a distributed network data processing system is carried out via one messaging protocol that can be assisted by a second messaging protocol which is significantly less susceptible to delay, especially memory blocking delays encountered by daemons running on other nodes. The switching of protocols is accompanied by controlled grace periods for needed responses. This messaging protocol flexibility is also adapted for use as a mechanism for controlling the deliberate activities of node addition (birth) and node deletion (death).

    摘要翻译: 分布式网络数据处理系统中的节点和/或适配器活动的确定通过一个消息协议进行,该消息协议可以被第二消息协议辅助,第二消息协议显着地不太容易延迟,特别是在其他方面运行的守护进程遇到的内存阻塞延迟 节点。 协议的切换伴随着所需响应的受控宽限期。 这种消息协议灵活性也适用于控制节点添加(出生)和节点删除(死亡)的故意活动的机制。

    COMPUTER PROGRAM PRODUCT USING TWO DIFFERENT PROGRAMS TO DETERMINE STATE OF A NETWORK NODE TO ELIMINATE MESSAGE RESPONSE DELAYS IN SYSTEM PROCESSING
    28.
    发明申请
    COMPUTER PROGRAM PRODUCT USING TWO DIFFERENT PROGRAMS TO DETERMINE STATE OF A NETWORK NODE TO ELIMINATE MESSAGE RESPONSE DELAYS IN SYSTEM PROCESSING 失效
    计算机程序产品使用两种不同的程序来确定网络节点状态以消除系统处理中的消息响应延迟

    公开(公告)号:US20080288645A1

    公开(公告)日:2008-11-20

    申请号:US12182321

    申请日:2008-07-30

    IPC分类号: G06F15/16 H04L12/28

    CPC分类号: H04L12/2801 H04L69/40

    摘要: The determination of node and/or adapter liveness in a distributed network data processing system is carried out via one messaging protocol that can be assisted by a second messaging protocol which is significantly less susceptible to delay, especially memory blocking delays encountered by daemons running on other nodes. The switching of protocols is accompanied by controlled grace periods for needed responses. This messaging protocol flexibility is also adapted for use as a mechanism for controlling the deliberate activities of node addition (birth) and node deletion (death).

    摘要翻译: 分布式网络数据处理系统中的节点和/或适配器活动的确定通过一个消息协议进行,该消息协议可以被第二消息协议辅助,第二消息协议显着地不太容易延迟,特别是在其他方面运行的守护进程遇到的内存阻塞延迟 节点。 协议的切换伴随着所需响应的受控宽限期。 这种消息协议灵活性也适用于控制节点添加(出生)和节点删除(死亡)的故意活动的机制。

    Method using two different programs to determine state of a network node to eliminate message response delays in system processing
    30.
    发明授权
    Method using two different programs to determine state of a network node to eliminate message response delays in system processing 失效
    使用两个不同程序来确定网络节点的状态以消除系统处理中的消息响应延迟的方法

    公开(公告)号:US07409453B2

    公开(公告)日:2008-08-05

    申请号:US11459973

    申请日:2006-07-26

    IPC分类号: G06F15/16

    CPC分类号: H04L12/2801 H04L69/40

    摘要: The determination of node and/or adapter liveness in a distributed network data processing system is carried out via one messaging protocol that can be assisted by a second messaging protocol which is significantly less susceptible to delay, especially memory blocking delays encountered by daemons running on other nodes. The switching of protocols is accompanied by controlled grace periods for needed responses. This messaging protocol flexibility is also adapted for use as a mechanism for controlling the deliberate activities of node addition (birth) and node deletion (death).

    摘要翻译: 分布式网络数据处理系统中的节点和/或适配器活动的确定通过一个消息协议进行,该消息协议可以被第二消息协议辅助,第二消息协议显着地不太容易延迟,特别是在其他方面运行的守护进程遇到的内存阻塞延迟 节点。 协议的切换伴随着所需响应的受控宽限期。 这种消息协议灵活性也适用于控制节点添加(出生)和节点删除(死亡)的故意活动的机制。