Abstract: In one embodiment, functional system elements are added to an autonomic manager to enable automatic online sample interval selection. In another embodiment, a method for determining the sample interval by continually characterizing the system workload behavior includes monitoring the system data and analyzing the degree to which the workload is stationary. This makes the online optimization method less sensitive to system noise and capable of being adapted to handle different workloads. The effectiveness of the autonomic optimizer is thereby improved, making it easier to manage a wide range of systems.

Abstract: Systems and methods are provided for optimizing the performance and/or allocation of constrained resources in a dynamic computing environment using adaptive regulatory control methods. For example, systems and methods for providing constrained optimization in a dynamic computing system implement model-based adaptive (self-tuning) regulatory control schemes that are designed to handle the system dynamics and which take into consideration control costs (such as the overheads of changing resource allocations and performance degradation due to transient load imbalances) to find an optimal solution. To facilitate practical application, a dual control architecture is disclosed which combines a heuristic fixed step control process that is implemented when there is no valid system model for model-based control. A system model is continually obtained and validated during run-time to adapt control parameters to variations in system dynamics.

Abstract: The present invention provides a method, system and program for optimizing compression of a workload processed by a database management system. In an embodiment of the present invention a method of optimizing the compression of database workloads is provided. Initially, an estimate of a cost of execution for each query according to a defined metric such as execution time or memory consumption is determined. A sub-set of queries is then selected from the workload in order of the most costly to least costly relative to the defined metric for compression according to either a predetermined compression threshold percentage or a threshold percentage derived from an allotted workload execution time. Compression is then performed on the selected sub-set of queries (i.e. those that will benefit the most from the compression) to achieve a net beneficial trade-off between the cost of workload compression and the cost of workload execution.

Abstract: A method for reducing oscillations of an output value associated with a program to be operatively coupled to a data processing system. The program having an internal process configured to read an input value provided by the program, the input value adjusting a performance aspect of the internal process, the internal process configured to provide an output value reflecting changes in the internal process responsive to the input value, the output value readable by the program.

Abstract: The present system improves the performance of a query in a database system when a plan for the query comprises sorting an input that is at least partially sorted such that a slow materialization sort can be applied. The invention applies the slow materialization sort by determining a sequence of subsets in accordance with the partially sorted input. As each of the subsets is determined, the subset is output for further processing. Advantageously, the invention reduces the waiting period for obtaining results from a sorting operation under certain circumstances.

Abstract: A system and method autonomically reallocate memory among buffer pools to permit quick access to data. A simulated buffer pool extension (SBPX) is created for each buffer pool in a set of buffer pools. Data victimized from a buffer pool is represented in the associated SBPX. Requests for data that is not resident in a buffer pool but is represented in the associated SBPX are tallied. Periodically, an expected efficiency benefit of increasing the capacity of each buffer pool is determined from the tallies. Memory is reallocated from the buffer pool with the lowest expected efficiency benefit having remaining reallocatable memory to the buffer pool with the highest expected efficiency benefit having remaining reallocatable memory, until either one or both of the buffer pools exhausts its reallocatable memory.

Abstract: The present system improves the performance of a query in a database system when a plan for the query comprises sorting an input that is at least partially sorted such that a slow materialization sort can be applied. The invention applies the slow materialization sort by determining a sequence of subsets in accordance with the partially sorted input. As each of the subsets is determined, the subset is output for further processing. Advantageously, the invention reduces the waiting period for obtaining results from a sorting operation under certain circumstances.

Abstract: A system and method autonomically reallocate memory among buffer pools to permit quick access to data. A simulated buffer pool extension (SBPX) is created for each buffer pool in a set of buffer pools. Data victimized from a buffer pool is represented in the associated SBPX. Requests for data that is not resident in a buffer pool but is represented in the associated SBPX are tallied. Periodically, an expected efficiency benefit of increasing the capacity of each buffer pool is determined from the tallies. Memory is reallocated from the buffer pool with the lowest expected efficiency benefit having remaining reallocatable memory to the buffer pool with the highest expected efficiency benefit having remaining reallocatable memory, until either one or both of the buffer pools exhausts its reallocatable memory.