Determining recovery time for interdependent resources in heterogeneous computing environment

A computer program product, comprising a non-transitory computer usable storage medium having a computer readable program code embodied therein, said computer readable program code containing instructions that when executed by a processor of a computer system implement a method, the method comprising:

• creating a graph of a root node such that the graph represents an interdependency of the resource represented by the root node among said at least one resource, said interdependency comprising zero or more sequence dependencies of the resource and zero or more group relations of the resource, each sequence dependency of said zero or more sequence dependencies of the resource on a respective support resource represented by a respective sequence edge from the root node to a respective support node, each sequence dependency denoting that the resource transits from a first state to a second state after all support resources transit from the first state to the second state, each group relation of zero or more group relations of the resource between the resource and a respective member resource represented by a respective member edge from the root node R to a respective member node, each group relation denoting that the resource transits from the first state to the second state after all member resources transit from the first state to the second state;
• and
• traversing the graph to generate a recovery time for the resource represented by the root node, wherein the recovery time for the resource is defined as a duration of time from an initial point of time when all resources in the graph are in the first state to a final point of time when the resource represented by the root node transits to the second state as a result of transitions of all resources in the graph from the first state to the second state.

A system, comprising:

• a processor;
• and
• a computer readable memory unit coupled to the processor, said memory unit containing instructions that when executed by the processor implement a method, the method comprising
• creating a graph of a root node such that the graph represents an interdependency of the resource represented by the root node among said at least one resource, said interdependency comprising zero or more sequence dependencies of the resource and zero or more group relations of the resource, each sequence dependency of said zero or more sequence dependencies of the resource on a respective support resource represented by a respective sequence edge from the root node to a respective support node, each sequence dependency denoting that the resource transits from a first state to a second state after all support resources transit from the first state to the second state, each group relation of zero or more group relations of the resource between the resource and a respective member resource represented by a respective member edge from the root node to a respective member node, each group relation denoting that the resource transits from the first state to the second state after all member resources transit from the first state to the second state;
• and
• traversing the graph to generate a recover time for the resource represented by the root node, wherein the recovery time for the resource is defined as a duration of time from an initial point of time when all resources in the graph are in the first state to a final point of time when the resource represented by the root node transits to the second state as a result of transitions of all resources in the graph from the first state to the second state.