摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.