Abstract: A method, system, and computer usable program product for a smart profiler are provided in the illustrative embodiments. An allowable number of interrupts for use by a profiler application is determined. A count number for a counter is determined. The counter is configured to count occurrences of an event in a data processing system up to the count number. An interrupt is raised when the counter has counted the occurrences of the event up to the count number. The interrupt is processed. The counting of occurrences of the event, raising the interrupt, and processing the interrupt are repeated for a predetermined time. A decision is made whether a total number of interrupts raised in the predetermined period differs from the allowable number. The count number of the counter is adjusted to cause the difference between the total number of interrupts in the predetermined period and the allowable number to decrease.

Abstract: A computer implemented method, data processing system, and computer usable code are provided for analyzing input/output problems. A monitoring agent collects input/output data from a plurality of levels in a multi-level input/output stack. The monitoring agent analyzes the input/output data from the plurality of levels to form an analysis. A determination is then made as to whether the analysis requires an action and an action is initiated in response to a determination that the analysis requires an action.

Abstract: A method and system to minimize to redundancy in testing a new software system by utilizing a knowledge base is provided. The knowledge base may be represented in a form of a decision tree including leaf nodes which store previously tested optimal configurations. When the knowledge base does not contain an optimal configuration for the new software, an optimal solution for the new software system may be determined by adding a further decision tree branch to the initial decision tree. A desirable tree branch may be selected from a table including a predetermined set of desirable tree branches for each category of software. As a result, the number of solutions to be tested on the input software may be limited and cost and effort to run redundant tests on a software system may be reduced.

Abstract: A method, system, and computer usable program product for a smart profiler are provided in the illustrative embodiments. An allowable number of interrupts for use by a profiler application is determined. A count number for a counter is determined. The counter is configured to count occurrences of an event in a data processing system up to the count number. An interrupt is raised when the counter has counted the occurrences of the event up to the count number. The interrupt is processed. The counting of occurrences of the event, raising the interrupt, and processing the interrupt are repeated for a predetermined time. A decision is made whether a total number of interrupts raised in the predetermined period differs from the allowable number. The count number of the counter is adjusted to cause the difference between the total number of interrupts in the predetermined period and the allowable number to decrease.

Abstract: A computer implemented method, apparatus, and computer program product for optimizing a non-uniform memory access system. Each thread in a set of threads is affinitized to a processor in a set of processors at different times to form a temporarily affinitized thread, wherein a single temporarily affinitized thread is present. The set of threads execute on the set of processors to perform one or more tasks each time the temporarily affinitized thread is formed. Information is collected about memory accesses by the temporarily affinitized thread. Based on the collected information about the memory accesses, at least one thread in the set of threads is permanently affinitized to a processor in the set of processors.

Abstract: A method and system to minimize to redundancy in testing a new software system by utilizing a knowledge base is provided. The knowledge base may be represented in a form of a decision tree including leaf nodes which store previously tested optimal configurations. When the knowledge base does not contain an optimal configuration for the new software, an optimal solution for the new software system may be determined by adding a further decision tree branch to the initial decision tree. A desirable tree branch may be selected from a table including a predetermined set of desirable tree branches for each category of software. As a result, the number of solutions to be tested on the input software may be limited and cost and effort to run redundant tests on a software system may be reduced.

Abstract: A method and system to minimize to redundancy in testing a new software system by utilizing a knowledge base is provided. The knowledge base may be represented in a form of a decision tree including leaf nodes which store previously tested optimal configurations. When the knowledge base does not contain an optimal configuration for the new software, an optimal solution for the new software system may be determined by adding a further decision tree branch to the initial decision tree. A desirable tree branch may be selected from a table including a predetermined set of desirable tree branches for each category of software. As a result, the number of solutions to be tested on the input software may be limited and cost and effort to run redundant tests on a software system may be reduced.

Abstract: A method and system to minimize to redundancy in testing a new software system by utilizing a knowledge base is provided. The knowledge base may be represented in a form of a decision tree including leaf nodes which store previously tested optimal configurations. When the knowledge base does not contain an optimal configuration for the new software, an optimal solution for the new software system may be determined by adding a further decision tree branch to the initial decision tree. A desirable tree branch may be selected from a table including a predetermined set of desirable tree branches for each category of software. As a result, the number of solutions to be tested on the input software may be limited and cost and effort to run redundant tests on a software system may be reduced.

Abstract: An off-screen buffer manager controls when the off-screen buffer is destroyed and re-created improving system performance. A screen request is received for a Java screen component and a determination is made whether there is already an off-screen buffer. If there is not an off-screen buffer, a new off-screen buffer is created and the component requesting the screen request is associated with the off-screen buffer. If an off-screen buffer already exists, a determination is made as to whether the off-screen buffer is large enough to handle the incoming request. If the off-screen buffer is large enough to handle the request, the existing off-screen buffer is used to handle the request, otherwise, the existing off-screen buffer is deleted and a new off-screen buffer is created and the component identifier of the deleted off-screen buffer is associated with the new off-screen buffer.

Abstract: An off-screen buffer manager controls when the off-screen buffer is destroyed and re-created improving system performance. A screen request is received for a Java screen component and a determination is made whether there is already an off-screen buffer. If there is not an off-screen buffer, a new off-screen buffer is created and the component requesting the screen request is associated with the off-screen buffer. If an off-screen buffer already exists, a determination is made as to whether the off-screen buffer is large enough to handle the incoming request. If the off-screen buffer is large enough to handle the request, the existing off-screen buffer is used to handle the request, otherwise, the existing off-screen buffer is deleted and a new off-screen buffer is created and the component identifier of the deleted off-screen buffer is associated with the new off-screen buffer.

Abstract: A powered scooter includes a frame, a front wheel rotatably supported at a front portion of the frame, a rear wheel assembly including at least a rear wheel rotatably supported at a rear portion of the frame, a power generator for driving an output axle to rotate, a power source connecting to the power generator, and a friction rotor connected to the output axle which drives the friction rotor to rotate, wherein the friction rotor is supported to extend to bias against at least a driven portion of the rear wheel assembly so as to drive the rear wheel to rotate.

Abstract: A scooter includes a frame, a rear wheel assembly including a rear wheel rotatably supported at a rear portion of the frame, a power generator for driving an output axle to rotate, a friction rotor connected to the output axle which drives the friction rotor to rotate, wherein the friction rotor is supported to extend to bias against a driven portion of the rear wheel assembly so as to drive the rear wheel to rotate, and a power releasing device arranged to drive the friction rotor from a driving position to an idle position, wherein in the driving position, the friction rotor is frictionally bias against the driven portion of the rear wheel assembly to drive the rear wheel to rotate, and in the idle position, the friction rotor is moved away from the driven portion of the rear wheel assembly such that the rear wheel is in a free rotating manner.