Self-aware and self-healing computing system
First Claim
1. A method comprising:
- organizing a computing system into a plurality of meta-dynamic states, the computing system having a plurality of components, each component having a plurality of microstates, the microstates of the components organized into a plurality of macrostates of the computing system, the macrostates organized into the meta-dynamic states;
monitoring the computing system, such that perturbations of the computing system are detected;
where a perturbation of the computing system will result in movement thereof to a new meta-dynamic state, determining whether the new meta-dynamic state is undesirable;
where the new meta-dynamic state is undesirable, determining a path to cause the computing system to move back to a desirable meta-dynamic state; and
, causing the computing system to move on the path to the desirable meta-dynamic state.
1 Assignment
0 Petitions
Accused Products
Abstract
Autonomic computing systems are self-aware and self-healing. Microstates of components of a system are organized into macrostates, and the macrostates are organized into meta-dynamic states (MDS'"'"'s). When the system is perturbed, it is determined whether the system enters a given undesirable MDS. Where the system will enter an undesirable MDS, a microstate/MDS graph (MMG) is constructed depicting which meta-dynamic states the system enters when its microstates are changed. A self-heal graph (SHG) is constructed from the MMG. The undesirable MDS is at the center of, and a desired MDS is at the periphery of, the SHG. The SHG has paths from the undesirable MDS to the desired MDS, each path having an associated cost incurred if the system moves along the path. An optimal path is selected from these paths that have the lowest associated costs. The system moved on the selected optimal path to reach the desired MDS.
19 Citations
20 Claims
-
1. A method comprising:
-
organizing a computing system into a plurality of meta-dynamic states, the computing system having a plurality of components, each component having a plurality of microstates, the microstates of the components organized into a plurality of macrostates of the computing system, the macrostates organized into the meta-dynamic states;
monitoring the computing system, such that perturbations of the computing system are detected;
where a perturbation of the computing system will result in movement thereof to a new meta-dynamic state, determining whether the new meta-dynamic state is undesirable;
where the new meta-dynamic state is undesirable, determining a path to cause the computing system to move back to a desirable meta-dynamic state; and
,causing the computing system to move on the path to the desirable meta-dynamic state. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A computer-readable medium having a computer program stored thereon to perform a method comprising:
-
organizing a plurality of microstates of a plurality of components of a computing system into a plurality of macrostates of the computing system;
organizing macrostates of the computing system into a plurality of meta-dynamic states of the computing system;
organizing the meta-dynamic states into a plurality of desirable meta-dynamic states, a plurality of undesirable meta-dynamic states, and a plurality of transient meta-dynamic states;
in response to the computing system being perturbed, where the computing system will enter or has entered a given undesirable meta-dynamic state, constructing a microstate/meta-dynamic state graph that depicts which of the meta-dynamic states the computing system enters when one or more of the microstates are changed according to a maximum number of components that the computing system is able to force a microstate change on, a cost associated with each microstate change, and a time limit for how long movement of the computing system to a desired meta-dynamic state is able to maximally take;
constructing a self-heal graph from the microstate/meta-dynamic state graph, such that the given undesirable meta-dynamic state is at a center of the self-heal graph, and the desired meta-dynamic state is at a periphery of the self-heal graph, the self-heal graph having a plurality of paths from the given undesirable meta-dynamic state to the desired meta-dynamic state, each path having an associated cost that is incurred for the computing system to move along the path;
selecting an optimal path from the paths from the given undesirable meta-dynamic state to the desired meta-dynamic state that have lowest associated costs; and
,causing the computing system to move on the optimal path selected to the desired meta-dynamic state.
-
-
16. A computing system comprising:
-
a first component to monitor a target computing system to detect perturbations of the target computing system resulting in movement thereof to new meta-dynamic states, and to determine whether the new meta-dynamic states are undesirable; and
,a second component to cause the target computing system to move along paths to desired meta-dynamic states where the first component has determined that the new meta-dynamic states are undesirable, wherein the target computing system comprises a plurality of components, each component having a plurality of microstates organized into a plurality of macrostates of the target computing system, the macrostates organized into a plurality of meta-dynamic states. - View Dependent Claims (17, 18, 19, 20)
-
Specification