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

1. 发明申请

US20050091352A1 Policy driven autonomic computing-specifying relationships 有权
标题翻译：政策驱动的自主计算 - 指定关系
公开(公告)号：US20050091352A1
公开(公告)日：2005-04-28
申请号：US10675828
申请日：2003-09-30
申请人： John Alex , Peter Badovinatz , Reinhard Buendgen , Chun-Shi Chang , Gregory Laib , Rong-Sheng Lee , Jeffrey Lucash , Thomas Lumpp , Juergen Schneider
发明人： John Alex , Peter Badovinatz , Reinhard Buendgen , Chun-Shi Chang , Gregory Laib , Rong-Sheng Lee , Jeffrey Lucash , Thomas Lumpp , Juergen Schneider
IPC分类号： G06F15/173 , H04L12/24 , H04L12/26
CPC分类号： H04L41/0893 , H04L41/0672 , H04L43/0817
摘要： 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）可以通过自我发现和资源之间的潜在关系进一步收集资源之间的隐含关系。

2. 发明申请

US20050071449A1 Policy driven autonomic computing-programmatic policy definitions 有权
标题翻译：政策驱动的自主计算 - 方案政策定义
公开(公告)号：US20050071449A1
公开(公告)日：2005-03-31
申请号：US10675001
申请日：2003-09-30
申请人： John Alex , Reinhard Buendgen , Chun-Shi Chang , Rong-Sheng Lee , Jeffrey Lucash , Thomas Lumpp , Juergen Schneider
发明人： John Alex , Reinhard Buendgen , Chun-Shi Chang , Rong-Sheng Lee , Jeffrey Lucash , Thomas Lumpp , Juergen Schneider
IPC分类号： G06F15/173 , G06Q10/00
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.
摘要翻译：自动计算系统和方法确定不能达到期望的结束状态，使用优先等级，条件关系规范和备选关系规范中的至少一个来确定可以达到可接受的子状态，并将计算系统置于可接受的子状态。优先等级可以包含分配给策略定义的属性，该属性确定应用策略定义的顺序。属性可以是“必需”，数值或“不需要”。条件关系规范具有在指定资源的状态满足预定要求时应用的策略定义。替代关系规范具有在指定资源的状态不满足预定要求时应用的策略定义和/或条件关系规范。

3. 发明授权

US07451201B2 Policy driven autonomic computing-specifying relationships 有权
标题翻译：政策驱动的自主计算 - 指定关系
公开(公告)号：US07451201B2
公开(公告)日：2008-11-11
申请号：US10675828
申请日：2003-09-30
申请人： John K. Alex , Peter R. Badovinatz , Reinhard Buendgen , Chun-Shi Chang , Gregory D. Laib , Rong-Sheng Lee , Jeffrey S. Lucash , Thomas Lumpp , Juergen Schneider
发明人： John K. Alex , Peter R. Badovinatz , Reinhard Buendgen , Chun-Shi Chang , Gregory D. Laib , Rong-Sheng Lee , Jeffrey S. Lucash , Thomas Lumpp , Juergen Schneider
IPC分类号： G06F15/173 , G06F15/177
CPC分类号： H04L41/0893 , H04L41/0672 , H04L43/0817
摘要： 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）可以通过自我发现和资源之间的潜在关系进一步收集资源之间的隐含关系。

4. 发明授权

US08892702B2 Policy driven autonomic computing-programmatic policy definitions 有权
标题翻译：政策驱动的自主计算 - 方案政策定义
公开(公告)号：US08892702B2
公开(公告)日：2014-11-18
申请号：US10675001
申请日：2003-09-30
申请人： John K. Alex , Reinhard Buendgen , Chun-Shi Chang , Rong-Sheng Lee , Jeffrey S. Lucash , Thomas Lumpp , Juergen Schneider
发明人： John K. Alex , Reinhard Buendgen , Chun-Shi Chang , Rong-Sheng Lee , Jeffrey S. Lucash , Thomas Lumpp , Juergen Schneider
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.
摘要翻译：自动计算系统和方法确定不能达到期望的结束状态，使用优先等级，条件关系规范和备选关系规范中的至少一个来确定可以达到可接受的子状态，并将计算系统置于可接受的子状态。优先等级可以包含分配给策略定义的属性，该属性确定应用策略定义的顺序。属性可以是“必需”，数值或“不需要”。条件关系规范具有在指定资源的状态满足预定要求时应用的策略定义。替代关系规范具有在指定资源的状态不满足预定要求时应用的策略定义和/或条件关系规范。

5. 发明授权

US08812631B2 Method and arrangement for operating a computer cluster 有权
标题翻译：操作计算机集群的方法和布置
公开(公告)号：US08812631B2
公开(公告)日：2014-08-19
申请号：US13449968
申请日：2012-04-18
申请人： Reinhard Buendgen
发明人： Reinhard Buendgen
IPC分类号： G06F15/177
CPC分类号： H04L41/08 , G06F9/5061 , G06F11/1425 , G06F11/202 , G06F2209/505 , H04L41/0668 , H04L41/0893 , H04L43/0811
摘要： A method is disclosed for operating a computer cluster distributed over multiple locations using quorum mechanism. The cluster includes interconnected defined system instances. The method includes distributing the cluster configuration to each system instance, and constantly checking system instance connectivity to determine reachable system instances. Each healthy system instance determines a subcluster of itself and all reachable system instances. Information of the distributed cluster configuration is used to calculate a corresponding subcluster configuration. Subcluster configuration information and the cluster configuration information is used for computing a new quorum decision for the corresponding subcluster, using a location quorum function considering proportions of connected locations containing reachable system instances, and weights of the reachable system instances in the locations. Workload placement decisions are made based on the new quorum granting permission to place workload to system instances in a specific subcluster, or refusing the permission, whenever the subcluster changes.
摘要翻译：公开了一种使用仲裁机制来操作分布在多个位置上的计算机集群的方法。集群包括互连的已定义的系统实例。该方法包括将集群配置分发到每个系统实例，并不断检查系统实例连接以确定可达到的系统实例。每个健康的系统实例确定自身的子集群和所有可达到的系统实例。分布式集群配置的信息用于计算相应的子集群配置。子集群配置信息和集群配置信息用于计算相应子集群的新的仲裁决定，使用考虑到可达系统实例的连接位置的比例的位置定额函数以及位置中可达到的系统实例的权重。工作量放置决定是基于新的仲裁授予权限将工作负载放置到特定子集群中的系统实例，或拒绝权限时，每当子集群更改时。

6. 发明授权

US08490181B2 Deterministic serialization of access to shared resource in a multi-processor system for code instructions accessing resources in a non-deterministic order 失效
标题翻译：在多处理器系统中访问共享资源的确定性序列化，用于以非确定性顺序访问资源的代码指令
公开(公告)号：US08490181B2
公开(公告)日：2013-07-16
申请号：US12732505
申请日：2010-03-26
申请人： Philippe Bergheaud , Reinhard Buendgen , Martin Schwidefsky
发明人： Philippe Bergheaud , Reinhard Buendgen , Martin Schwidefsky
IPC分类号： G06F7/04
CPC分类号： G06F21/60 , G06F9/526
摘要： Managing access to resources shared among multiple processes within a computer system. Multiple program instances of an application are almost simultaneously executed on multiple processors for fault tolerance. The replication solution supports the recording and subsequent replay of reservation events granting the shared resources exclusive access rights to the processes, when one program code instruction may request access to a set of shared resources in a non-deterministic order.
摘要翻译：管理计算机系统内多个进程共享资源的访问。应用程序的多个程序实例几乎同时在多个处理器上执行，以实现容错。当一个程序代码指令可以以非确定性顺序请求访问一组共享资源时，复制解决方案支持记录和随后重放预留事件，授予共享资源对进程的独占访问权限。

7. 发明申请

US20120290691A1 METHOD AND ARRANGEMENT FOR OPERATING A COMPUTER CLUSTER 有权
标题翻译：用于操作计算机集群的方法和装置
公开(公告)号：US20120290691A1
公开(公告)日：2012-11-15
申请号：US13449968
申请日：2012-04-18
申请人： Reinhard Buendgen
发明人： Reinhard Buendgen
IPC分类号： G06F15/177
CPC分类号： H04L41/08 , G06F9/5061 , G06F11/1425 , G06F11/202 , G06F2209/505 , H04L41/0668 , H04L41/0893 , H04L43/0811
摘要： A method is disclosed for operating a computer cluster distributed over multiple locations using quorum mechanism. The cluster includes interconnected defined system instances. The method includes distributing the cluster configuration to each system instance, and constantly checking system instance connectivity to determine reachable system instances. Each healthy system instance determines a subcluster of itself and all reachable system instances. Information of the distributed cluster configuration is used to calculate a corresponding subcluster configuration. Subcluster configuration information and the cluster configuration information is used for computing a new quorum decision for the corresponding subcluster, using a location quorum function considering proportions of connected locations containing reachable system instances, and weights of the reachable system instances in the locations. Workload placement decisions are made based on the new quorum granting permission to place workload to system instances in a specific subcluster, or refusing the permission, whenever the subcluster changes.
摘要翻译：公开了一种使用仲裁机制来操作分布在多个位置上的计算机集群的方法。集群包括互连的已定义的系统实例。该方法包括将集群配置分发到每个系统实例，并不断检查系统实例连接以确定可达到的系统实例。每个健康的系统实例确定自身的子集群和所有可达到的系统实例。分布式集群配置的信息用于计算相应的子集群配置。子集群配置信息和集群配置信息用于计算相应子集群的新的仲裁决定，使用考虑到可达系统实例的连接位置的比例的位置定额函数以及位置中可达到的系统实例的权重。工作量放置决定是基于新的仲裁授予权限将工作负载放置到特定子集群中的系统实例，或拒绝权限时，每当子集群更改时。

8. 发明申请

US20100275260A1 Deterministic Serialization of Access to Shared Resource in a Multi-Processor System for code Instructions Accessing Resources in a Non-Deterministic Order 失效
标题翻译：在多处理器系统中访问共享资源的确定性序列化，用于以非确定性顺序访问资源的代码指令
公开(公告)号：US20100275260A1
公开(公告)日：2010-10-28
申请号：US12732505
申请日：2010-03-26
申请人： Philippe Bergheaud , Reinhard Buendgen , Martin Schwidefsky
发明人： Philippe Bergheaud , Reinhard Buendgen , Martin Schwidefsky
IPC分类号： G06F9/50 , G06F21/22
CPC分类号： G06F21/60 , G06F9/526
摘要： Managing access to resources shared among multiple processes within a computer system. Multiple program instances of an application are almost simultaneously executed on multiple processors for fault tolerance. The replication solution supports the recording and subsequent replay of reservation events granting the shared resources exclusive access rights to the processes, when one program code instruction may request access to a set of shared resources in a non-deterministic order.
摘要翻译：管理计算机系统内多个进程共享资源的访问。应用程序的多个程序实例几乎同时在多个处理器上执行，以实现容错。当一个程序代码指令可以以非确定性顺序请求访问一组共享资源时，复制解决方案支持记录和随后重放预留事件，授予共享资源对进程的独占访问权限。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式