Versioning and replaying performance tuning projects

• US 7,069,469 B2
• Filed: 12/23/2002
• Issued: 06/27/2006
• Est. Priority Date: 03/14/2002
• Status: Active Grant

• Current Assignee: Oracle America, Inc. (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Violleau, Thierry, Malhotra, Manish, Yacoub, Yousef R., Pillutla, Raghavender R.
• Primary Examiner(s): Beausoliel, Robert
• Assistant Examiner(s): Wilson, Yolanda L.
• Application Number:
  US10/328,781
• Publication Number:
  US 20030177413A1
• Time in Patent Office: 1,282 Days
• Field of Search: 714/26, 714/27, 714/37, 714/38
• US Class Current: 714/26
• CPC Class Codes: G06F 11/0748 in a remote unit communicating with a single-box computer node experiencing an error/fault remote testing G06F11/2294
• CPC Class Codes: G06F 11/079 Root cause analysis, i.e. error or fault diagnosis in a hardware test environment G06F11/22; in a software test environment G06F11/36

Abstract

Versioning may be utilized in a knowledge base decision tree in order to provide several useful features. To accomplish this, when a decision tree is traversed, the decision tree representing a knowledge base and having non-leaf nodes with one or more branches representing possible symptoms, and leaf nodes with no branches, branches may be followed corresponding to symptoms experience by the application until a leaf node is reached. This traversal may be recorded as a version, with subsequent traversals having a different version. This allows a user to rerun performance tuning either from the beginning or from an earlier node without having to re-enter information already provided. It also allows a user to resume the performance tuning should he be interrupted in the middle, such as by a crash or by having to halt a long traversal.

Claims

1. A method for diagnosing an application, comprising:

traversing a decision tree, said decision tree representing a knowledge base and having non-leaf nodes with one or more branches representing possible symptoms, and leaf nodes with no branches, by following branches corresponding to symptoms experienced by the application until a leaf node is reached;

recording said traversal as a version, with subsequent traversals having a different version;

passing an initial data set describing the application and its current state to said knowledge base, said knowledge base defined as said decision tree and having one or more diagnosis nodes representing leaf nodes, one or more analysis nodes representing non-leaf nodes, and one or more symptom branches connecting between analysis nodes and other analysis nodes, or between analysis nodes and diagnosis nodes;

interrupting said traversing if an analysis node is reached that requests additional information regarding the application; and

traversing said decision tree again from a beginning node, and not interrupting said traversing if an analysis node is reached that requests additional information regarding the application if said additional information is stored in said database under a previous version and said additional information is still accurate.

2. A method for diagnosing an application, comprising:

traversing a decision tree, said decision tree representing a knowledge base and having non-leaf nodes with one or more branches representing possible symptoms, and leaf nodes with no branches, by following branches corresponding to symptoms experienced by the application until a leaf node is reached;

recording said traversal as a version, with subsequent traversals having a different version;

passing an initial data set describing the application and its current state to said knowledge base, said knowledge base defined as said decision tree and having one or more diagnosis nodes representing leaf nodes, one or more analysis nodes representing non-leaf nodes, and one or more symptom branches connecting between analysis nodes and other analysis nodes, or between analysis nodes and diagnosis nodes;

interrupting said traversing if an analysis node is reached that requests additional information regarding the application; and

traversing said decision tree again from an analysis node encountered during said traversing, said traversing said decision tree again beginning by following a different branch from said analysis node than was followed during said traversing.

3. A method for diagnosing an application, comprising:

traversing a decision tree, said decision tree representing a knowledge base and having non-leaf nodes with one or more branches representing possible symptoms, and leaf nodes with no branches, by following branches corresponding to symptoms experienced by the application until a leaf node is reached;

recording said traversal as a version, with subsequent traversals having a different version;

passing an initial data set describing the application and its current state to said knowledge base, said knowledge base defined as said decision tree and having one or more diagnosis nodes representing leaf nodes, one or more analysis nodes representing non-leaf nodes, and one or more symptom branches connecting between analysis nodes and other analysis nodes, or between analysis nodes and diagnosis nodes;

interrupting said traversing if an analysis node is reached that requests additional information regarding the application; and

resuming said traversal by using said traversal version if said traversing is interrupted for any reason.

4. An apparatus for diagnosing an application, comprising:

a database;

a decision tree traverser;

a traversal recorder coupled to said decision tree traverser and to said database;

a traversal interrupter coupled to said decision tree traverser; and

a traversal resumer coupled to said traversal interrupter and to said decision tree traverser.

5. The apparatus of claim 4, further comprising:

a collector agent communicator coupled to said traversal interrupter and to said traversal resumer.

6. An apparatus for diagnosing an application, comprising:

means for traversing a decision tree, said decision tree representing a knowledge base and having non-leaf nodes with one or more branches representing possible symptoms, and leaf nodes with no branches, by following branches corresponding to symptoms experienced by the application until a leaf node is reached;

means for recording said traversal as a version, with subsequent traversals having a different version

means for passing an initial data set describing the application and its current state to said knowledge base, said knowledge base defined as said decision tree and having one or more diagnosis nodes representing leaf nodes, one or more analysis nodes representing non-leaf nodes, and one or more symptom branches connecting between analysis nodes and other analysis nodes, or between analysis nodes and diagnosis nodes;

means for interrupting said traversing if an analysis node is reached that requests additional information regarding the application; and

means for traversing said decision tree again from a beginning node, and not interrupting said traversing if an analysis node is reached that requests additional information regarding the application if said additional information is stored in said database under a previous version and said additional information is still accurate.

7. An apparatus for diagnosing an application, comprising:

means for traversing a decision tree, said decision tree representing a knowledge base and having non-leaf nodes with one or more branches representing possible symptoms, and leaf nodes with no branches, by following branches corresponding to symptoms experienced by the application until a leaf node is reached;

means for recording said traversal as a version, with subsequent traversals having a different version

means for passing an initial data set describing the application and its current state to said knowledge base, said knowledge base defined as said decision tree and having one or more diagnosis nodes representing leaf nodes, one or more analysis nodes representing non-leaf nodes, and one or more symptom branches connecting between analysis nodes and other analysis nodes, or between analysis nodes and diagnosis nodes;

means for interrupting said traversing if an analysis node is reached that requests additional information regarding the application; and

means for traversing said decision tree again from an analysis node encountered during said traversing, said traversing said decision tree again beginning by following a different branch from said analysis node than was followed during said traversing.

8. An apparatus for diagnosing an application, comprising:

means for traversing a decision tree, said decision tree representing a knowledge base and having non-leaf nodes with one or more branches representing possible symptoms, and leaf nodes with no branches, by following branches corresponding to symptoms experienced by the application until a leaf node is reached;

means for recording said traversal as a version, with subsequent traversals having a different version

means for passing an initial data set describing the application and its current state to said knowledge base, said knowledge base defined as said decision tree and having one or more diagnosis nodes representing leaf nodes, one or more analysis nodes representing non-leaf nodes, and one or more symptom branches connecting between analysis nodes and other analysis nodes, or between analysis nodes and diagnosis nodes;

means for interrupting said traversing if an analysis node is reached that requests additional information regarding the application; and

means for resuming said traversal by using said traversal version if said traversing is interrupted for any reason.