Method and system for performing deployment management

• US 9,292,343 B2
• Filed: 06/30/2010
• Issued: 03/22/2016
• Est. Priority Date: 06/30/2010
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Manglik, Gaurav, Sriram, Vijay Nichinbatl, Ganguly, Shamik, Sah, Rohit, Mukherjee, Sourav
• Primary Examiner(s): VU, TUAN A
• Application Number:
  US12/827,856
• Publication Number:
  US 20120005646A1
• Time in Patent Office: 2,092 Days
• Field of Search: 717170-174, 717/120, 709/208, 709/220, 709221-224, 707/756, 707/4, 707/102, 718/102, 370/230
• US Class Current: 1/1
• CPC Class Codes: G06F 8/60 Software deployment
• CPC Class Codes: G06F 9/4856 resumption being on a different machine, e.g. task migration, virtual machine migration G06F9/5088 takes precedence

Abstract

A system, method, computer program product are shown for automatically performing deployment activities that can handle deployments for any-sized organization, even for deployments at the enterprise level. According to some approaches, modeling is performed to generate a model of the components in the computing environment. Dependency graphs can be generated for the deployment, and used to then automatically perform the deployment.

Claims

1. A computer implemented method for performing deployment with a processor, comprising:

identifying a model corresponding to a topology, where the model corresponds to an inventory of components in the topology and dependency relationships for the components;

using the model to identify dependencies for a deployment, wherein the identified dependencies are based at least in part upon a dependency tree having one or more root nodes and one or more leaf nodes;

counting a number of paths from a root node to a leaf node in the dependency tree;

based at least in part on the identified dependencies and the number of paths counted, selecting a deployment procedure from a plurality of deployment procedures, wherein if the number of paths counted is two or more paths, at least one of the deployment procedures comprises a deployment to a first node in a first path in a first downtime window and a deployment to a second node in a second path in a second downtime window, wherein the first downtime window ends before the second downtime window starts and at least one path from the root node to the leaf node is available during deployment to the first node and during deployment to the second node; and

implementing the selected deployment procedure to perform the deployment in the topology.

2. The method of claim 1 in which the model comprises a dependency graph for the components.

3. The method of claim 1 in which the model comprises operational steps to perform the deployment.

4. The method of claim 3 in which the operational steps comprise optimizations based at least in part upon the existence of other components that are subject to the deployment.

5. The method of claim 4 in which the optimizations are used to minimize downtime for the components.

6. The method of claim 1 in which the model is generic to a class of the components or is specific to an individual component.

7. The method of claim 1 in which one path from root node to leaf node is handled in a single downtime window.

8. The method of claim 1 in which there are multiple paths root node to leaf node, and where the components are patched to ensure at least one path is available from the root node to the leaf node.

9. The method of claim 1 in which the deployment comprises provisioning, patching, configuration, or reconfiguration.

10. The method of claim 1 in which the implementing the selected deployment procedure comprises performing a first action when the number of paths is a first value, performing a second action when the number of paths is a second value, and performing a third action when the number of paths is a third value.

11. A computer program product embodied on a non-transitory computer usable medium, the computer usable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a method for performing deployment with, the method comprising:

identifying a model corresponding to a topology, where the model corresponds to an inventory of components in the topology and dependency relationships for the components;

using the model to identify dependencies for a deployment, wherein the identified dependencies are based at least in part upon a dependency tree having one or more root nodes and one or more leaf nodes;

counting a number of paths from a root node to a leaf node in the dependency tree;

based at least in part on the identified dependencies and the number of paths counted, selecting a deployment procedure from a plurality of deployment procedures, wherein if the number of paths counted is two or more paths, at least one of the deployment procedures comprises a deployment to a first node in a first path in a first downtime window and a deployment to a second node in a second path in a second downtime window, wherein the first downtime window ends before the second downtime window starts and at least one path from the root node to the leaf node is available during deployment to the first node and during deployment to the second node; and

implementing the selected deployment procedure to perform the deployment in the topology.

12. The computer program product of claim 11 in which the model comprises a dependency graph for the components.

13. The computer program product of claim 11 in which the model comprises operational steps to perform the deployment.

14. The computer program product of claim 13 in which the operational steps comprise optimizations based at least in part upon the existence of other components that are subject to the deployment.

15. The computer program product of claim 14 in which the optimizations are used to minimize downtime for the components.

16. The computer program product of claim 11 in which the model is generic to a class of the components or is specific to an individual component.

17. The computer program product of claim 11 in which one path from root node to leaf node is handled in a single downtime window.

18. The computer program product of claim 11 in which there are multiple paths root node to leaf node, and where the components are patched to ensure at least one path is available from the root node to the leaf node.

19. The computer program product of claim 11 in which the deployment comprises provisioning, patching, configuration, or reconfiguration.

20. The computer program product of claim 11 in which the implementing comprises deploying as a standalone when the number of paths is zero, deploying in a single downtime window when the number of paths is one, and deploying includes piggybacking when the number of paths is more than one.

21. A computer-based system for performing deployment, comprising:

a computer processor to execute a set of program code instructions;

a memory to hold the program code instructions, in which the program code instructions comprise program code to;

identify a model corresponding to a topology, where the model corresponds to an inventory of components in the topology and dependency relationships for the components,

use the model to identify dependencies for a deployment, wherein the identified dependencies are based at least in part upon a dependency tree having one or more root nodes and one or more leaf nodes,

count a number of paths from a root node to a leaf node in the dependency tree,

select a deployment procedure from a plurality of deployment procedures based at least in part on the identified dependencies and the number of paths counted, wherein if the number of paths counted is two or more paths, at least one of the deployment procedures comprises a deployment to a first node in a first path in a first downtime window and a deployment to a second node in a second path in a second downtime window, wherein the first downtime window ends before the second downtime window starts and at least one path from the root node to the leaf node is available during deployment to the first node and during deployment to the second node, and

implement the deployment procedure to perform the deployment in the topology.

22. The system of claim 21 in which the model comprises a dependency graph for the components.

23. The system of claim 21 in which the model comprises operational steps to perform the deployment.

24. The system of claim 23 in which the operational steps comprise optimizations based at least in part upon the existence of other components that are subject to the deployment.

25. The system of claim 24 in which the optimizations are used to minimize downtime for the components.

26. The system of claim 21 in which the model is generic to a class of the components or is specific to an individual component.

27. The system of claim 21 in which one path from root node to leaf node is handled in a single downtime window.

28. The system of claim 21 in which there are multiple paths root node to leaf node, and where the components are patched to ensure at least one path is available from the root node to the leaf node.

29. The system of claim 21 in which the deployment comprises provisioning, patching, configuration, or reconfiguration.

30. The system of claim 21 in which the deployment procedure comprises a first action when the number of paths is a first value, a second action when the number of paths is a second value, and a third action when the number of paths is a third value.