Model for performance tuning applications

• US 20030177414A1
• Filed: 12/23/2002
• Published: 09/18/2003
• Est. Priority Date: 03/14/2002
• Status: Abandoned Application

• Current Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Violleau, Thierry, Malhotra, Manish, Yacoub, Yousef R., Pillutla, Raghavender R.
• Application Number:
  US10/329,286
• Publication Number:
  US 20030177414A1
• Time in Patent Office: Days
• US Class Current: 714/25
• 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

In order to diagnose applications, a specialized knowledge base may be created that is static upon creation but may become dynamic when traversed. The knowledge base may be defined as a decision tree having one or more diagnosis nodes, one or more analysis nodes, and one or more symptom branches. The diagnosis nodes are leaf nodes and indicate proposed diagnoses and/or proposed remedies for an application. The symptom branches may connect analysis nodes to other analysis nodes or analysis nodes to diagnosis nodes, and may indicate possible symptoms of the application. The analysis nodes may be non-leaf nodes and indicate information required to determine which symptom branches to follow during traversal. Additionally, the analysis nodes may indicate additional information required from a collector agent before traversal can be continued. This allows the knowledge base to be utilized dynamically, improving performance and reliability.

Claims

1. A method for diagnosing an application, comprising:

passing an initial data set describing the application and its current state to a knowledge base, said knowledge base defined as a decision tree 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;

traversing said decision tree by following branches corresponding to symptoms experienced by the application until a diagnosis node is reached; and

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

2. The method of claim 1, wherein said diagnosis nodes indicate proposed diagnoses for the application.

3. The method of claim 2, wherein said diagnosis nodes further indicate proposed remedies for the application.

4. The method of claim 1, wherein said symptom branches indicate possible symptoms of the application.

5. The method of claim 1, wherein said analysis nodes indicate information required to determine which symptom branches to follow during traversal.

6. The method of claim 5, wherein said analysis nodes further indicate additional information regarding the application, said additional information required to determine which symptom branches to follow during traversal.

7. The method of claim 1, further comprising:

resuming said traversing when said additional information regarding the application is received.

8. The method of claim 1, further comprising:

communicating with a collector agent to retrieve said additional information.

9. The method of claim 8, wherein said communicating comprises:

sending one or more collection descriptors to said collector agent.

10. The method of claim 9, wherein said collection descriptors define one or more probes to execute and data to be filtered from the probes.

11. The method of claim 10, wherein said probes are programs that measure performance statistics on the application.

12. An apparatus for diagnosing an application, comprising:

a memory;

an initial data set to decision tree passer coupled to said memory;

a decision tree traverser coupled to said initial data set to decision tree passer and to said memory; and

a traversal interrupter coupled to said decision tree traverser.

13. The apparatus of claim 12, further comprising:

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

14. The apparatus of claim 13, further comprising:

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

15. An apparatus for diagnosing an application, comprising:

means for passing an initial data set describing the application and its current state to a knowledge base, said knowledge base defined as a decision tree 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 traversing said decision tree by following branches corresponding to symptoms experienced by the application until a diagnosis node is reached; and

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

16. The apparatus of claim 15, wherein said diagnosis nodes indicate proposed diagnoses for the application.

17. The apparatus of claim 16, wherein said diagnosis nodes further indicate proposed remedies for the application.

18. The apparatus of claim 15, wherein said symptom branches indicate possible symptoms of the application.

19. The apparatus of claim 15, wherein said analysis nodes indicate information required to determine which symptom branches to follow during traversal.

20. The apparatus of claim 19, wherein said analysis nodes further indicate additional information regarding the application, said additional information required to determine which symptom branches to follow during traversal.

21. The apparatus of claim 15, further comprising:

means for resuming said traversing when said additional information regarding the application is received.

22. The apparatus of claim 15, further comprising:

means for communicating with a collector agent to retrieve said additional information.

23. The apparatus of claim 22, wherein said means for communicating comprises:

means for sending one or more collection descriptors to said collector agent.

24. The apparatus of claim 23, wherein said collection descriptors define one or more probes to execute and data to be filtered from the probes.

25. The apparatus of claim 24, wherein said probes are programs that measure performance statistics on the application.

26. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform a method for diagnosing an application, comprising:

passing an initial data set describing the application and its current state to a knowledge base, said knowledge base defined as a decision tree 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;

traversing said decision tree by following branches corresponding to symptoms experienced by the application until a diagnosis node is reached; and

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