Self-aware and self-healing computing system

• US 7,484,121 B2
• Filed: 08/30/2005
• Issued: 01/27/2009
• Est. Priority Date: 08/30/2005
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Gangadhar, Deepak K.
• Primary Examiner(s): Lohn; Joshua A
• Application Number:
  US11/215,760
• Publication Number:
  US 20070053252A1
• Time in Patent Office: 1,246 Days
• Field of Search: 714/26, 714/47
• US Class Current: 714/26
• CPC Class Codes: G06F 11/008 Reliability or availability analysis
• CPC Class Codes: G06F 11/1423 by reconfiguration of paths
• CPC Class Codes: G06F 11/3447 Performance evaluation by modeling
• CPC Class Codes: G06F 11/3452 Performance evaluation by statistical analysis
• CPC Class Codes: G06F 11/3495 for systems
• CPC Class Codes: G06F 2201/875 Monitoring of systems including the internet

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.

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,

wherein the macrostates are organized into attractors and basins of attraction, each attractor being a stable state in which the computing system is stable, and each basin of attraction being a transient state in which the computing system is unstable, but which leads to one of the attractors,

said method further comprising constructing an attractor separation map indicating how the attractors are separated from one another by a plurality of hamming distances, each hamming distance being a number of bits that differ between two attractors.

2. 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,

wherein determining a path to cause the computing system to move back to a desirable meta-dynamic state comprises;

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 one or more parameters,

wherein construction of the microstate/meta-dynamic state graph is completed when the desirable meta-dynamic state has been reached from the new meta-dynamic state that is undesirable,

wherein the one or more parameters comprise;

a maximum number of components that the computing system is able to force a microstate change on at the same time;

a cost associated with each microstate change that the computing system is able to force;

a time limit for how long movement of the computing system to the desirable meta-dynamic state from the new meta-dynamic state that is undesirable is able to maximally take; and

,

a desired meta-dynamic state that is the desirable meta-dynamic state to which the computing system is to move.

3. 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,

wherein determining a path to cause the computing system to move back to a desirable meta-dynamic state comprises;

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 one or more parameters,

wherein construction of the microstate/meta-dynamic state graph is completed when the desirable meta-dynamic state has been reached from the new meta-dynamic state that is undesirable,

wherein determining a path to cause the computing system to move back to a desirable meta-dynamic state further comprises;

construing a self-heal graph from the microstate/meta-dynamic state graph, such that the new meta-dynamic state that is undesirable is at a center of the self-heal graph, and the desirable meta-dynamic state is at a periphery of the self-heal graph,

wherein the self-heal graph comprises a plurality of paths from the new meta-dynamic state that is undesirable to the desirable meta-dynamic state, each path having an associated cost that is incurred for the computing system to move along the path from the new meta-dynamic state that is undesirable to the desirable meta-dynamic state,

wherein determining a path to cause the computing system to move back to a desirable meta-dynamic state further comprises;

selecting an optimal path from the paths from the meta-dynamic state that is undesirable to the desirable meta-dynamic state that have lowest associated costs,

wherein the optimal path is the path that the computing system is caused to move on to the desirable meta-dynamic state.