Requester-Side Autonomic Governor Method
    1.
    发明申请
    Requester-Side Autonomic Governor Method 失效
    请求方自主调控方法

    公开(公告)号:US20090307353A1

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

    申请号:US12136291

    申请日:2008-06-10

    IPC分类号: G06F15/173

    CPC分类号: H04L67/32 H04L69/40

    摘要: A requester-side autonomic governor is provided for a requester configured to send service requests to a service provider. For example, the requester and service provider may be disposed in a Service Oriented Architecture (SOA) architected system. A feedback loop, preferably a monitor portion of a Monitor, Analyze, Plan, and Execute (MAPE) loop, is configured to monitor responses to service requests. An autonomic governor mechanism limits the type and/or number of concurrent service requests according to a resource pool scheme, and dynamically adjusts a resource threshold of the resource pool scheme based on information provided by the feedback loop. In one embodiment, the resource threshold is reduced if more than a predetermined number of service requests generated time-outs, and is increased if more than a predetermined number of service requests are being held awaiting available pool resources and less than a predetermined number of service requests generated time-outs.

    摘要翻译: 为被配置为向服务提供商发送服务请求的请求者提供请求方侧自主调控器。 例如,请求者和服务提供商可以被安排在面向服务架构(SOA)的架构系统中。 配置监视器,分析,计划和执行(MAPE)循环的反馈循环,优选监视器部分,以监视对服务请求的响应。 自主调控机制根据资源池方案限制并发服务请求的类型和/或数量,并根据反馈回路提供的信息动态调整资源池方案的资源阈值。 在一个实施例中,如果超过预定数量的服务请求产生超时,则资源阈值减小,并且如果正在等待预定数量的服务请求正在等待可用池资源并且小于预定数量的服务,则资源阈值增加 请求产生超时。

    Requester-Side Autonomic Governor
    2.
    发明申请
    Requester-Side Autonomic Governor 有权
    请求方自治总督

    公开(公告)号:US20090307352A1

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

    申请号:US12136256

    申请日:2008-06-10

    IPC分类号: G06F15/173

    CPC分类号: H04L67/16 H04L67/22 H04L69/40

    摘要: A requester-side autonomic governor is provided for a requester configured to send service requests to a service provider. For example, the requester and service provider may be disposed in a Service Oriented Architecture (SOA) architected system. A feedback loop, preferably a monitor portion of a Monitor, Analyze, Plan, and Execute (MAPE) loop, is configured to monitor responses to service requests. An autonomic governor mechanism limits the type and/or number of concurrent service requests according to a resource pool scheme, and dynamically adjusts a resource threshold of the resource pool scheme based on information provided by the feedback loop. In one embodiment, the resource threshold is reduced if more than a predetermined number of service requests generated time-outs, and is increased if more than a predetermined number of service requests are being held awaiting available pool resources and less than a predetermined number of service requests generated time-outs.

    摘要翻译: 为被配置为向服务提供商发送服务请求的请求者提供请求方侧自主调控器。 例如,请求者和服务提供商可以被安排在面向服务架构(SOA)的架构系统中。 配置监视器,分析,计划和执行(MAPE)循环的反馈循环,优选监视器部分,以监视对服务请求的响应。 自主调控机制根据资源池方案限制并发服务请求的类型和/或数量,并根据反馈回路提供的信息动态调整资源池方案的资源阈值。 在一个实施例中,如果超过预定数量的服务请求产生超时,则资源阈值减小,并且如果正在等待预定数量的服务请求正在等待可用池资源并且小于预定数量的服务,则资源阈值增加 请求产生超时。

    SYSTEM AND METHOD TO EFFICIENTLY IDENTIFY BAD COMPONENTS IN A MULTI-NODE SYSTEM UTILIZING MULTIPLE NODE TOPOLOGIES
    3.
    发明申请
    SYSTEM AND METHOD TO EFFICIENTLY IDENTIFY BAD COMPONENTS IN A MULTI-NODE SYSTEM UTILIZING MULTIPLE NODE TOPOLOGIES 失效
    使用多个节点拓扑的多节点系统中有效识别组件的系统和方法

    公开(公告)号:US20120226943A1

    公开(公告)日:2012-09-06

    申请号:US13037891

    申请日:2011-03-01

    IPC分类号: G06F11/00

    CPC分类号: G06F11/0709 G06F11/0751

    摘要: The exemplary embodiments of the present invention provide a method for efficiently identifying the bad component(s) in a multi-node system. The method includes assigning a unique ID to each of a plurality of nodes on the multi-node system, generating test statistics from a test on a plurality of nodes, and comparing the test statistics for the plurality of nodes against a first topology to generate a first number of clusters of bad nodes. The method further includes comparing the test statistics for the plurality of nodes against a second topology to generate a second number of clusters of bad nodes, and identifying the bad nodes by comparing the cluster sizes to a topology threshold.

    摘要翻译: 本发明的示例性实施例提供了一种用于有效地识别多节点系统中的坏组件的方法。 该方法包括为多节点系统上的多个节点中的每一个分配唯一的ID,从多个节点上的测试生成测试统计信息,以及将多个节点的测试统计与第一拓扑结果进行比较,以生成 第一个坏节点的群集数。 该方法还包括将多个节点的测试统计与第二拓扑进行比较,以生成第二数量的坏节点群集,以及通过将群集大小与拓扑阈值进行比较来识别坏节点。

    Custom error page enabled via networked computing service
    4.
    发明授权
    Custom error page enabled via networked computing service 有权
    通过网络计算服务启用自定义错误页面

    公开(公告)号:US09456061B2

    公开(公告)日:2016-09-27

    申请号:US13586246

    申请日:2012-08-15

    摘要: An approach is provided for queuing clients when a web page is temporarily unavailable. The approach includes providing a computer infrastructure operable to: maintain a queue of clients requesting the web page; receive an indication of an availability number from a host of the web page; and release one or more of the clients from the queue equal to the availability number indicated by the host, based on the receiving the indication of the availability number.

    摘要翻译: 当网页暂时不可用时,提供了排队客户端的方法。 该方法包括提供计算机基础设施,其可操作以:维护请求网页的客户端队列; 从网页的主机接收可用性编号的指示; 并且基于接收到可用性编号的指示,从队列中释放一个或多个客户端等于主机指示的可用性编号。

    System and method to efficiently identify bad components in a multi-node system utilizing multiple node topologies
    5.
    发明授权
    System and method to efficiently identify bad components in a multi-node system utilizing multiple node topologies 失效
    使用多节点拓扑来有效地识别多节点系统中的不良组件的系统和方法

    公开(公告)号:US08495425B2

    公开(公告)日:2013-07-23

    申请号:US13037891

    申请日:2011-03-01

    IPC分类号: G06F11/30

    CPC分类号: G06F11/0709 G06F11/0751

    摘要: The exemplary embodiments of the present invention provide a method for efficiently identifying the bad component(s) in a multi-node system. The method includes assigning a unique ID to each of a plurality of nodes on the multi-node system, generating test statistics from a test on a plurality of nodes, and comparing the test statistics for the plurality of nodes against a first topology to generate a first number of clusters of bad nodes. The method further includes comparing the test statistics for the plurality of nodes against a second topology to generate a second number of clusters of bad nodes, and identifying the bad nodes by comparing the cluster sizes to a topology threshold.

    摘要翻译: 本发明的示例性实施例提供了一种用于有效地识别多节点系统中的坏组件的方法。 该方法包括为多节点系统上的多个节点中的每一个分配唯一的ID,从多个节点上的测试生成测试统计信息,以及将多个节点的测试统计与第一拓扑结果进行比较,以生成 第一个坏节点的群集数。 该方法还包括将多个节点的测试统计与第二拓扑进行比较,以生成第二数量的坏节点群集,以及通过将群集大小与拓扑阈值进行比较来识别坏节点。

    Verifying Speculative Multithreading In An Application
    7.
    发明申请
    Verifying Speculative Multithreading In An Application 有权
    在应用程序中验证投机多线程

    公开(公告)号:US20130159772A1

    公开(公告)日:2013-06-20

    申请号:US13326378

    申请日:2011-12-15

    IPC分类号: G06F11/36

    摘要: Verifying speculative multithreading in an application executing in a computing system, including: executing one or more test instructions serially thereby producing a serial result, including insuring that all data dependencies among the test instructions are satisfied; executing the test instructions speculatively in a plurality of threads thereby producing a speculative result; and determining whether a speculative multithreading error exists including: comparing the serial result to the speculative result and, if the serial result does not match the speculative result, determining that a speculative multithreading error exists.

    摘要翻译: 验证在计算系统中执行的应用程序中的推测性多线程,包括:串行执行一个或多个测试指令,从而产生串行结果,包括确保满足测试指令之间的所有数据依赖性; 在多个线程中推测性地执行测试指令,从而产生推测结果; 并且确定是否存在推测性多线程错误,包括:将串行结果与推测结果进行比较,并且如果串行结果与推测结果不匹配,则确定存在推测性多线程错误。