REDUCING DOWNTIME WHILE PATCHING BINARIES ON A CLUSTER

• US 20120054732A1
• Filed: 08/24/2010
• Published: 03/01/2012
• Est. Priority Date: 08/24/2010
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Jain, Nitin, Misner, Tim
• Granted Patent: US 11,048,492 B2
• Time in Patent Office: Days
• US Class Current: 717/171
• CPC Class Codes: G06F 8/433 Dependency analysis; Data or control flow analysis
• CPC Class Codes: G06F 8/65 Updates security arrangements therefor G06F21/57
• CPC Class Codes: G06F 8/71 Version control security arrangements therefor G06F21/57; Configuration management
• CPC Class Codes: G06Q 10/0631 Resource planning, allocation, distributing or scheduling for enterprises or organisations

Abstract

Embodiments of the invention provide systems and methods for applying a patch or a change to a set of binary modules executing on and used by resources of a computing cluster while reducing the downtime of those resources. According to one embodiment, applying a patch to a plurality of binary modules on a computing cluster can comprise identifying resources on one or more of a plurality of nodes of the cluster. Additionally, each of the plurality of binary modules on one or more of the nodes of the cluster can be identified. A graph can be generated logically representing the cluster. Groups within the binary modules and resources can be identified based on the graph. Patches can be applied to the binary modules based on the identified groups. Patching binary modules based on the identified groups can comprise patching all of the binary modules of an identified group together.

Claims

1. A method for applying a patch to a plurality of binary modules on a computing cluster, the method comprising:

identifying resources on one or more of a plurality of nodes of the cluster;

identifying each of the plurality of binary modules on one or more of the plurality of the nodes of the cluster;

generating a graph logically representing the cluster;

identifying groups within the binary modules and resources based on the graph; and

applying patches to the binary modules based on the identified groups.

2. The method of claim 1, wherein the graph logically representing the cluster represents each of the plurality of nodes, each of the resources, and each of the plurality of binary modules and relationships between the binary modules and the resources.

3. The method of claim 2, wherein generating the graph logically representing the cluster comprises:

representing the cluster as a root of the graph;

representing each node of the cluster as a first set of nodes of the graph, wherein the first set of nodes of the graph are child nodes of the root;

representing each binary module as a second set of nodes of the graph, wherein the second set of nodes of the graph are child nodes of the first set of nodes of the graph based on the nodes of the cluster on which the binary is executing; and

representing each resource as a third set of nodes of the graph, wherein the third set of nodes of the graph are child nodes of the second set of nodes of the graph based on the binaries which the resources are executing.

4. The method of claim 3, wherein identifying groups within the binaries and resources based on the graph comprises:

selecting a vertex from the second set of nodes of the graph or third set of nodes of the graph;

marking the selected vertex as a member of the group;

identifying an edge to an unmarked vertex in the second set of nodes of the graph or third set of nodes of the graph;

selecting the unmarked vertex; and

repeating said marking the selected vertex as a member of the group, identifying an edge to an unmarked vertex of the second set of nodes of the graph or third set of nodes of the graph, and selecting the unmarked vertex until no edge to an unmarked vertex is found.

5. The method of claim 3, wherein patching binary modules based on the identified groups comprises patching all of the binary modules of an identified group together.

6. The method of claim 1, wherein the resources comprise one or more instances of a database.

7. The method of claim 1, wherein the resources comprise one or more applications.

8. The method of claim 1, wherein the resources comprise one or more servers.

9. A system comprising:

a processor; and

a memory communicatively coupled with and readable by the processor and having stored therein a series of instructions which, when executed by the processor, cause the processor to apply a patch to a plurality of binary modules in a computing cluster by identifying resources on one or more of a plurality of nodes of the cluster;

identifying each of the plurality of binary modules on one or more of the plurality of the nodes of the cluster;

generating a graph logically representing the cluster;

identifying groups within the binary modules and resources based on the graph; and

applying patches to the binary modules based on the identified groups.

10. The system of claim 9, wherein the graph logically representing the cluster represents each of the plurality of nodes, each of the resources, and each of the plurality of binary modules and relationships between the binary modules and the resources.

11. The system of claim 10, wherein generating the graph logically representing the cluster comprises:

representing the cluster as a root of the graph;

representing each node of the cluster as a first set of nodes of the graph, wherein the first set of nodes of the graph are child nodes of the root;

representing each binary module as a second set of nodes of the graph, wherein the second set of nodes of the graph are child nodes of the first set of nodes of the graph based on the nodes of the cluster on which the binary is executing; and

representing each resource as a third set of nodes of the graph, wherein the third set of nodes of the graph are child nodes of the second set of nodes of the graph based on the binaries which the resources are executing.

12. The system of claim 11, wherein identifying groups within the binaries and resources based on the graph comprises:

selecting a vertex from the second set of nodes of the graph or third set of nodes of the graph;

marking the selected vertex as a member of the group;

identifying an edge to an unmarked vertex in the second set of nodes of the graph or third set of nodes of the graph;

selecting the unmarked vertex; and

repeating said marking the selected vertex as a member of the group, identifying an edge to an unmarked vertex of the second set of nodes of the graph or third set of nodes of the graph, and selecting the unmarked vertex until no edge to an unmarked vertex is found.

13. The system of claim 11, wherein patching binary modules based on the identified groups comprises patching all of the binary modules of an identified group together.

14. The system of claim 9, wherein the resources comprise one or more instances of a database.

15. The system of claim 9, wherein the resources comprise one or more applications.

16. The system of claim 9, wherein the resources comprise one or more servers.

17. A machine-readable medium having stored therein a set of instructions which, when executed by a processor, cause the processor to patch a plurality of binary modules on a computing cluster by:

identifying resources on one or more of a plurality of nodes of the cluster;

identifying each of the plurality of binary modules on one or more of the plurality of the nodes of the cluster;

generating a graph logically representing the cluster, wherein the graph represents each of the plurality of nodes, each of the resources, and each of the plurality of binary modules and relationships between the binary modules and the resources;

identifying groups within the binary modules and resources based on the graph; and

applying patches to the binary modules based on the identified groups.

18. The machine-readable medium of claim 17, wherein generating the graph logically representing the cluster comprises:

representing the cluster as a root of the graph;

representing each node of the cluster as a first set of nodes of the graph, wherein the first set of nodes of the graph are child nodes of the root;

representing each binary module as a second set of nodes of the graph, wherein the second set of nodes of the graph are child nodes of the first set of nodes of the graph based on the nodes of the cluster on which the binary is executing; and

representing each resource as a third set of nodes of the graph, wherein the third set of nodes of the graph are child nodes of the second set of nodes of the graph based on the binaries which the resources are executing.

19. The machine-readable medium of claim 18, wherein identifying groups within the binaries and resources based on the graph comprises:

selecting a vertex from the second set of nodes of the graph or third set of nodes of the graph;

marking the selected vertex as a member of the group;

identifying an edge to an unmarked vertex in the second set of nodes of the graph or third set of nodes of the graph;

selecting the unmarked vertex; and

repeating said marking the selected vertex as a member of the group, identifying an edge to an unmarked vertex of the second set of nodes of the graph or third set of nodes of the graph, and selecting the unmarked vertex until no edge to an unmarked vertex is found.

20. The machine-readable medium of claim 18, wherein patching binary modules based on the identified groups comprises patching all of the binary modules of an identified group together.