Abstract: Methods and systems are provided for autonomic control and optimization of computing systems. A plurality of component models for one or more components in an autonomic computing system are maintained in a system level database. These component models are obtained from a source external to the management server including the components associated with the models. Component models are added or removed from the database or updated as need. A system level management server in communication with the database utilizes the component models maintained in the system level database and generic component models as needed to compute an optimum state of the autonomic computing system. The autonomic computing system is managed in accordance with the computed optimum state.

Abstract: In one embodiment, the present invention is a method for allocation of finite computational resources amongst multiple entities, wherein the method is structured to optimize the business value of an enterprise providing computational services. One embodiment of the inventive method involves establishing, for each entity, a service level utility indicative of how much business value is obtained for a given level of computational system performance. The service-level utility for each entity is transformed into a corresponding resource-level utility indicative of how much business value may be obtained for a given set or amount of resources allocated to the entity. The resource-level utilities for each entity are aggregated, and new resource allocations are determined and executed based upon the resource-level utility information. The invention is thereby capable of making rapid allocation decisions, according to time-varying need or value of the resources by each of the entities.

Abstract: Methods and systems are provided for autonomic control and optimization of computing systems. A plurality of component models for one or more components in an autonomic computing system are maintained in a system level database. These component models are obtained from a source external to the management server including the components associated with the models. Component models are added or removed from the database or updated as need. A system level management server in communication with the database utilizes the component models maintained in the system level database and generic component models as needed to compute an optimum state of the autonomic computing system. The autonomic computing system is managed in accordance with the computed optimum state.

Abstract: Methods and systems are provided for autonomic control and optimization of computing systems. A plurality of component models for one or more components in an autonomic computing system are maintained in a system level database. These component models are obtained from a source external to the management server including the components associated with the models. Component models are added or removed from the database or updated as need. A system level management server in communication with the database utilizes the component models maintained in the system level database and generic component models as needed to compute an optimum state of the autonomic computing system. The autonomic computing system is managed in accordance with the computed optimum state.

Abstract: In one embodiment, the present invention is a method for reward-based learning of improved systems management policies. One embodiment of the inventive method involves obtaining a decision-making entity and a reward mechanism. The decision-making entity manages a plurality of application environments supported by a data processing system, where each application environment operates on data input to the data processing system. The reward mechanism generates numerical measures of value responsive to actions performed in states of the application environments. The decision-making entity and the reward mechanism are applied to the application environments, and results achieved through this application are processed in accordance with reward-based learning to derive a policy. The reward mechanism and the policy are then applied to the application environments, and the results of this application are processed in accordance with reward-based learning to derive a new policy.

Abstract: Methods, systems, and products are provided for peer-to-peer computer software installation. Embodiments include receiving, by an observing install agent running on an observing host from a test install agent running on a test host, performance information describing the performance of software installed on the test host; determining, by the observing install agent, whether the performance information meets performance criteria for the observing host; and if the performance information meets the performance criteria for the observing host, installing the software on the observing host. In some embodiments, determining, by the observing install agent, whether the performance information meets performance criteria for the observing host is carried out by determining, whether the performance information meets performance criteria for the observing host in dependence upon a rule.

Abstract: Active sample collaborative prediction method, system and program storage device are provided. A method in one aspect may include determining approximation X for matrix Y using collaborative prediction, said matrix Y being sparse initially and representing pairwise measurement values; selecting one or more unobserved entries from said matrix Y representing active samples using said approximation X and an active sample heuristic; obtaining values associated with said unobserved entries; inserting said values to said matrix Y; and repeating the steps of determining, selecting, obtaining and inserting until a predetermined condition is satisfied.

Abstract: In one embodiment, the present invention is a method for reward-based learning of improved systems management policies. One embodiment of the inventive method involves supplying a first policy and a reward mechanism. The first policy maps states of at least one component of a data processing system to selected management actions, while the reward mechanism generates numerical measures of value responsive to particular actions (e.g., management actions) performed in particular states of the component(s). The first policy and the reward mechanism are applied to the component(s), and results achieved through this application (e.g., observations of corresponding states, actions and rewards) are processed in accordance with reward-based learning to derive a second policy having improved performance relative to the first policy in at least one state of the component(s).

Abstract: In one embodiment, the present invention is a method for allocation of finite computational resources amongst multiple entities, wherein the method is structured to optimize the business value of an enterprise providing computational services. One embodiment of the inventive method involves establishing, for each entity, a service level utility indicative of how much business value is obtained for a given level of computational system performance. The service-level utility for each entity is transformed into a corresponding resource-level utility indicative of how much business value may be obtained for a given set or amount of resources allocated to the entity. The resource-level utilities for each entity are aggregated, and new resource allocations are determined and executed based upon the resource-level utility information. The invention is thereby capable of making rapid allocation decisions, according to time-varying need or value of the resources by each of the entities.

Abstract: Active sample collaborative prediction method, system and program storage device are provided. A method in one aspect may include determining approximation X for matrix Y using collaborative prediction, said matrix Y being sparse initially and representing pairwise measurement values; selecting one or more unobserved entries from said matrix Y representing active samples using said approximation X and an active sample heuristic; obtaining values associated with said unobserved entries; inserting said values to said matrix Y; and repeating the steps of determining, selecting, obtaining and inserting until a predetermined condition is satisfied.

Abstract: A data string is a sequence of atomic units of data that represent information. In the context of computer data, examples of data strings include executable programs, data files, and boot records consisting of sequences of bytes, or text files consisting of sequences of bytes or characters. The invention solves the problem of automatically constructing a classifier of data strings, i.e., constructing a classifier which, given a string, determines which of two or more class labels should be assigned to it. From a set of (string, class-label) pairs, this invention provides an automated technique for extracting features of data strings that are relevant to the classification decision, and an automated technique for developing a classifier which uses those features to classify correctly the data strings in the original examples and, with high accuracy, classify correctly novel data strings not contained in the example set.

Abstract: A data string is a sequence of atomic units of data that represent information. In the context of computer data, examples of data strings include executable programs, data files, and boot records consisting of sequences of bytes, or text files consisting of sequences of bytes or characters. The invention solves the problem of automatically constructing a classifier of data strings, i.e., constructing a classifier which, given a string, determines which of two or more class labels should be assigned to it. From a set of (string, class-label) pairs, this invention provides an automated technique for extracting features of data strings that are relevant to the classification decision, and an automated technique for developing a classifier which uses those features to classify correctly the data strings in the original examples and, with high accuracy, classify correctly novel data strings not contained in the example set.