METHOD AND APPARATUS FOR DYNAMIC APPLICATION UPGRADE IN CLUSTER AND GRID SYSTEMS FOR SUPPORTING SERVICE LEVEL AGREEMENTS

• US 20080263535A1
• Filed: 07/02/2008
• Published: 10/23/2008
• Est. Priority Date: 12/15/2004
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: VIGNOLA, CHRISTOPHER P., Dias, Daniel Manuel, FRANK, DAVID CARL, OSTDIEK, LUIS JAVIER, MOHINDRA, AJAY, DIXON, GRAEME NEVILLE
• Application Number:
  US12/166,927
• Publication Number:
  US 20080263535A1
• Time in Patent Office: Days
• US Class Current: 717/168
• CPC Class Codes: G06F 2209/5019 Workload prediction
• CPC Class Codes: G06F 8/656 while running
• CPC Class Codes: G06F 9/5083 Techniques for rebalancing the load in a distributed system

Abstract

Methods and systems are provided for conducting maintenance such as software upgrades in components and nodes within a computer network while maintaining the functionality of the computer network in accordance with prescribed performance parameters. A balance is achieved between the rate of performing a desired system upgrade and the necessary performance parameters by empirically determining anticipated system loads and selecting the maximum number of components that can be upgraded simultaneously while meeting the anticipated loads. Provisions are made for the staggering of components through the upgrade process and for the return of components to active service in the computer network in response to unanticipated load spikes. Validation of successful upgrades is also provided.

Claims

1. A method for maintaining a computer network, the method comprising:

identifying a plurality of nodes in the computer network to receive a predefined maintenance;

selecting a subset of the identified nodes, the subset comprising a maximum number of nodes capable of simultaneously receiving the predefined maintenance without significantly inhibiting prescribed performance parameters in the computer network;

performing the predefined maintenance on the nodes in the selected subset; and

repeating the selection of subsets of the identified nodes until all identified nodes receive the predefined maintenance.

2. The method of claim 1, wherein the predefined maintenance comprises installing software application upgrades, installing software application patches, installing new software applications, updating computer virus definitions or combinations thereof.

3. The method of claim 1, wherein the performance parameters comprise service level agreements, service level objectives or combinations thereof.

4. The method of claim 1, wherein the step of selecting the subset comprises:

determining if the maximum number of nodes that can simultaneously receive the predefined maintenance while still achieving the prescribed performance parameters with a remaining set of nodes from the identified nodes; and

identifying a period of time over which the remaining set can achieve the prescribed performance parameters.

5. The method of claim 4, wherein the step of identifying the period of time comprises approximating an average time required to perform the predefined maintenance in one node.

6. The method of claim 4, wherein the step of determining the maximum number of nodes comprises using historical load data and current load data to determine a predicted load;

and

estimating the remaining set of nodes required to support the predicted load.

7. The method of claim 6, further comprising adding additional nodes to the computer network to create the estimated remaining set of nodes.

8. The method of claim 4, wherein the step of selecting the subset further comprises:

determining a start time for the period of time; and

initiating the predefined maintenance at the start time.

9. The method of claim 1, wherein the step of performing the predefined maintenance comprises:

terminating the routing of new requests to the selected subset of nodes;

monitoring the selected subset of nodes for completion of all pending requests in the subset of nodes; and

performing the predefined maintenance upon detection of the completion of all pending requests.

10. The method of claim 9, further comprises discarding all pending uncompleted requests in the subset of nodes upon expiration of a prescribed period of time.

11. The method of claim 9, wherein the step of terminating the routing of new requests comprises terminating the routing of new requests to the subset of nodes sequentially so that the predefined maintenance is performed on only a portion of the subset of nodes at any given time.

12. The method of claim 9, further comprising:

monitoring for load spikes during maintenance of the selected subset; and

re-initiating requests to one or more nodes in the selected subset of nodes to support any detected load spikes.

13. The method of claim 1, further comprising validating the selected subset of nodes after completion of the predefined maintenance.

14. The method of claim 13, wherein the step of validating the maintenance comprises:

routing a test load to the selected nodes; and

reverting the selecting nodes back to a pre-maintenance state upon failure of the selected nodes to handle the test load.

15. The method of claim 13, wherein the step of validating the maintenance comprises:

routing a stress load to the selected nodes; and

reverting the selecting nodes back to a pre-maintenance state upon failure of the selected nodes to handle the stress load.

16. A computer readable medium containing a computer executable code that when read by a computer causes the computer to perform a method for maintaining a computer network, the method comprising:

identifying a plurality of nodes in the computer network to receive a predefined maintenance;

selecting a subset of the identified nodes, the subset comprising a maximum number of nodes capable of simultaneously receiving the predefined maintenance without significantly inhibiting prescribed performance parameters in the computer network;

performing the predefined maintenance on the nodes in the selected subset; and

repeating the selection of subsets of the identified nodes until all identified nodes receive the predefined maintenance.

17. The computer readable code of claim 16, wherein the predefined maintenance comprises installing software application upgrades, installing software application patches, installing new software applications, updating computer virus definitions or combinations thereof.

18. The computer readable code of claim 16, wherein the performance parameters comprise service level agreements, service level objectives or combinations thereof.

19. The computer readable code of claim 16, wherein the step of selecting the subset comprises:

determining if the maximum number of nodes that can simultaneously receive the predefined maintenance while still achieving the prescribed performance parameters with a remaining set of nodes from the identified nodes; and

identifying a period of time over which the remaining set can achieve the prescribed performance parameters.

20. The computer readable code of claim 19, wherein the step of identifying the period of time comprises approximating an average time required to perform the predefined maintenance in one node.

21. The computer readable code of claim 19, wherein the step of determining the maximum number of nodes comprises using historical load data and current load data to determine a predicted load;

and

estimating the remaining set of nodes required to support the predicted load.

22. The computer readable code of claim 21, further comprising adding additional nodes to the computer network to create the estimated remaining set of nodes.

23. The computer readable code of claim 19, wherein the step of selecting the subset further comprises:

determining a start time for the period of time; and

initiating the predefined maintenance at the start time.

24. The computer readable code of claim 16, wherein the step of performing the predefined maintenance comprises:

terminating the routing of new requests to the selected subset of nodes;

monitoring the selected subset of nodes for completion of all pending requests in the subset of nodes; and

performing the predefined maintenance upon detection of the completion of all pending requests.

25. The computer readable code of claim 24, further comprises discarding all pending uncompleted requests in the subset of nodes upon expiration of a prescribed period of time.

26. The computer readable code of claim 24, wherein the step of terminating the routing of new requests comprises terminating the routing of new requests to the subset of nodes sequentially so that the predefined maintenance is performed on only a portion of the subset of nodes at any given time.

27. The computer readable code of claim 24, further comprising:

monitoring for load spikes during maintenance of the selected subset; and

re-initiating requests to one or more nodes in the selected subset of nodes to support any detected load spikes.

28. The computer readable code of claim 16, further comprising validating the selected subset of nodes after completion of the predefined maintenance.

29. The computer readable code of claim 28, wherein the step of validating the maintenance comprises:

routing a test load to the selected nodes; and

reverting the selecting nodes back to a pre-maintenance state upon failure of the selected nodes to handle the test load.

30. The computer readable code of claim 28, wherein the step of validating the maintenance comprises:

routing a stress load to the selected nodes; and

reverting the selecting nodes back to a pre-maintenance state upon failure of the selected nodes to handle the stress load.