Failure repetition avoidance in data processing

• US 9,158,606 B2
• Filed: 01/22/2010
• Issued: 10/13/2015
• Est. Priority Date: 01/22/2009
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Lewis, Roger Gordon, Robinson, Alan Clive, Wright, Andrew, Horn, Julien Charles
• Primary Examiner(s): SCHELL, JOSEPH O
• Application Number:
  US12/692,332
• Publication Number:
  US 20100185903A1
• Time in Patent Office: 2,090 Days
• Field of Search: 714/39, 714/47.1, 714/47.2, 714/47.3
• US Class Current: 1/1
• CPC Class Codes: G06F 11/004 Error avoidance G06F11/07 and subgroups take precedence
• CPC Class Codes: G06F 11/2257 using expert systems
• CPC Class Codes: G06F 11/3051 Monitoring arrangements for monitoring the configuration of the computing system or of the computing system component, e.g. monitoring the presence of processing resources, peripherals, I/O links, software programs verification or detection of system hardware configuration G06F11/2247

Abstract

Avoiding failure repetition in data processing includes storing a sequence of circumstances leading up to a previous failure, monitoring circumstances in a current process, matching a sequence of circumstances in the current process to a stored sequence of circumstances, and applying rules to determine if the current process should proceed.

Claims

1. A system for avoiding failure repetition in data processing, comprising:

a storage device configured to store of a number of sequences of circumstances leading up to a previous failure;

a monitor for monitoring circumstances in a current process and matching a sequence of circumstances in the current process to one of the stored sequences of circumstances; and

a rules engine for applying rules to determine if the current process should proceed based on output from the monitor,

wherein matching the sequence of circumstances in the current process to the one of the stored sequences of circumstances comprises applying generic rules for similar circumstances.

2. The system of claim 1, further comprising:

an analyzer for analyzing results of the current process if the current process is allowed to proceed; and

an updater for updating the rules engine.

3. The system of claim 1, further comprising an interrupter for interrupting the current process in a controlled manner.

4. The system of claim 1, in which the rules engine is configured to apply at least one of user-defined rules and heuristically learned rules.

5. The system of claim 1, in which the monitor is configured to capture a sequence of circumstances prior to a failure, and add that sequence of circumstances to the store of sequences of circumstances.

6. The system of claim 1, in which the rules comprise at least one of:

restricting the number of recursive calls if the number of recursive calls reaches a predetermined number, instructing interruption of the current process in a controlled manner if the sequences of circumstances in the current process matches a one of the stored sequences of circumstances leading up to a previous failure, and instructing interruption of the current process in a controlled manner if events occurring in similarly named programs fail.

7. A method for avoiding failure repetition in data processing, comprising:

storing a number of sequences of circumstances leading up to a previous failure;

providing a processor programmed to monitor circumstances in a current process;

matching a sequence of circumstances in the current process to one of the stored sequence of circumstances; and

applying rules to determine if the current process should proceed,

wherein matching the sequence of circumstances in the current process to the one of the stored sequence of circumstances comprises applying generic rules for similar circumstances.

8. The method of claim 7, further comprising, if the current process is allowed to proceed, analyzing the results of the current process, and updating the rules.

9. The method of claim 7, further comprising, if the current process is not allowed to proceed, interrupting the current process in a controlled manner.

10. The method of claim 7, in which applying rules to determine if the current process should proceed comprises applying user-defined rules, heuristically learned rules, or combinations thereof.

11. The method of claim 7, further comprising capturing a number of sequences of circumstances leading up to a failure, and adding that sequence of circumstances to the stored sequences of circumstances.

12. The method of claim 11, in which the failure is recognized as an unexpected failure.

13. The method of claim 7, in which the circumstances comprise events, variables, parameters, conditions, resources in use, or combinations thereof.

14. The method of claim 7, in which matching a sequence of circumstances in the current process to one of the stored sequence of circumstances comprises at least one of:

repetition of program names, repetition of transactions, repetition of abend sequences, repeated patterns of storage usage, repeated patterns of central processing unit usage, and repetition of user ID signons.

15. The method of claim 7, in which the rules comprise at least one of:

restricting the number of recursive calls if the number of recursive calls reaches a predetermined number, instructing interruption of the current process in a controlled manner if the sequences of circumstances in the current process matches a one of the stored sequences of circumstances leading up to a previous failure, and instructing interruption of the current process in a controlled manner if events occurring in similarly named programs fail.

16. A computer program product for avoiding failure repetition in data processing, the computer program product comprising:

a computer readable storage device having computer usable program code embodied therewith, the computer usable program code to;

store a number of sequences of circumstances leading up to a previous failure;

monitor circumstances in a current process;

match a sequence of circumstances in the current process to one of the stored sequence of circumstances; and

apply rules to determine if the current process should proceed,

wherein matching the sequence of circumstances in the current process to the one of the stored sequences of circumstances comprises applying generic rules for similar circumstances.

17. The computer program product of claim 16, further comprising:

computer usable program code to analyze results of the current process and update the rules if the current process is allowed to proceed; and

computer usable program code to interrupt the current process in a controlled manner if the current process is not allowed to proceed.

18. The computer program product of claim 16, in which the rules comprise at least one of:

restricting the number of recursive calls if the number of recursive calls reaches a predetermined number, instructing interruption of the current process in a controlled manner if the sequences of circumstances in the current process matches a one of the stored sequences of circumstances leading up to a previous failure, and instructing interruption of the current process in a controlled manner if events occurring in similarly named programs fail.

19. The computer program product of claim 16, in which the computer usable program code to apply rules to determine if the current process should proceed comprises computer usable program code to apply user-defined rules, heuristically learned rules, or combinations thereof.

20. The computer program product of claim 16, further comprising computer usable program code to capture a number of sequences of circumstances leading up to a failure, and adding that sequence of circumstances to the stored sequences of circumstances.

21. The computer program product of claim 20, in which the circumstances comprise events, variables, parameters, conditions, and resources in use, or combinations thereof.

22. The computer program product of claim 16, in which the computer usable program code to match a sequence of circumstances in the current process to one of the stored sequence of circumstances comprises computer usable program code to match at least one of:

repetition of program names, repetition of or transactions, repetition of abend sequences, repeated patterns of storage usage, repeated patterns of central processing unit usage, and repetition of user ID sign-ons.