Computational linguistic statements for providing an autonomic computing environment

• US 7,788,082 B2
• Filed: 12/05/2007
• Issued: 08/31/2010
• Est. Priority Date: 07/17/2003
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Meliksetian, Dikran, Weitzman, Louis M.
• Primary Examiner(s): Han; Qi
• Application Number:
  US11/950,748
• Publication Number:
  US 20080140386A1
• Time in Patent Office: 1,000 Days
• Field of Search: 704/1, 704/9, 704/231, 704/257
• US Class Current: 704/1
• CPC Class Codes: G06F 40/211 Syntactic parsing, e.g. based on context-free grammar [CFG] or unification grammars
• CPC Class Codes: G06F 40/284 Lexical analysis, e.g. tokenisation or collocates

Abstract

A method for autonomic computing using a relational grammar represented in a mark-up language. In response to a system input change, the autonomic relational grammar and the autonomic system input is parsed to form an autonomic derivation tree representing autonomic system tokens, categories, attributes and relationships. An action is taken as defined by the relational grammar according to the input changes sensed.

Claims

1. A system for autonomic computing using a relational grammar, the system comprising:

a network;

a computer system in communication with the network, wherein the computer system includes instructions to execute a method, comprising;

reading an autonomic relational grammar from memory, the autonomic relational grammar comprising a plurality of program statements, the program statements comprising one or more lexical token statements, one or more category statements one or more relationship statements and one or more autonomic action statements, wherein a rule comprises the one or more relationship statements and the one or more autonomic action statements;

sensing a change in an input value related to a first token identified by a first lexical token statement of the one or more lexical token statements;

parsing the input value with the relational grammar to form an autonomic derivation tree, the autonomic derivation tree comprising the first token, a first category, a first relationship and an autonomic action;

using the derived autonomic derivation tree to identify the autonomic action to be performed; and

performing the identified autonomic action, the autonomic action comprising any one of;

configuring the computer system;

optimizing functionality of the computer system;

recovering the computer system from a malfunction;

or

protecting an environment of the computer system.

2. The system according to claim 1, further comprising any one of:

changing the input value related to the first token if an attribute is instantiated at initialization time;

or

changing the input value related to the first token if there is a change in a value of the first token.

3. The system according to claim 1, wherein the rule further comprises a second category statement and wherein the derivation tree further comprises a second category.

4. The system according to claim 1, wherein the rule further comprises a second lexical token statement and wherein the derivation tree further comprises a second token.

5. The system according to claim 1, wherein the relationship statements further comprise any one of a system attribute or the relationship between any one of the first category or the first token and any one of a third category or a third token.

6. The system according to claim 1, wherein the relational grammar further comprises a plurality of rule statements for defining a second rule.

7. The system according to claim 1, wherein the method further comprises:

determining resource objects and constraints;

solving the constraints to form a constraint solution for the resource objects; and

using the constraint solution to identify the autonomic action to be performed.

8. A computer readable medium storing computer readable program code for autonomic computing using a relational grammar, for performing a method comprising:

reading an autonomic relational grammar from memory, the autonomic relational grammar comprising a plurality of program statements, the program statements comprising one or more lexical token statements, one or more category statements one or more relationship statements and one or more autonomic action statements, wherein a rule comprises the one or more relationship statements and the one or more autonomic action statements;

sensing a change in an input value related to a first token identified by a first lexical token statement of the one or more lexical token statements;

parsing the input value with the relational grammar to form an autonomic derivation tree, the autonomic derivation tree comprising the first token, a first category, a first relationship and an autonomic action;

using the derived autonomic derivation tree to identify the autonomic action to be performed; and

performing the identified autonomic action, the autonomic action comprising any one of;

configuring the computer system;

optimizing functionality of the computer system;

recovering the computer system from a malfunction;

or

protecting an environment of the computer system.

9. The computer readable medium according to claim 8, further comprising any one of:

changing the input value related to the first token if an attribute is instantiated at initialization time;

or

changing the input value related to the first token if there is a change in a value of the first token.

10. The computer readable medium according to claim 8, wherein the rule further comprises a second category statement and wherein the derivation tree further comprises a second category.

11. The computer readable medium according to claim 8, wherein the rule further comprises a second lexical token statement and wherein the derivation tree further comprises a second token.

12. The computer readable medium according to claim 8, wherein the relationship statements further comprises any one of a system attribute or the relationship between any one of the first category or the first token and any one of a third category or third token.

13. The computer readable medium according to claim 8, wherein the relational grammar further comprises a plurality of rule statements for defining a second rule.

14. The computer readable medium according to claim 8, wherein the method further comprises:

determining resource objects and constraints;

solving the constraints to form a constraint solution for the resource objects; and

using the constraint solution to identify the autonomic action to be performed.