Granted Patent B2

US 8,291,059 · App. 12/814,749 · Granted Oct 16, 2012

Abstract

Claims (36)

1. A method of scheduling availability for a computing infrastructure in a shared computing environment, comprising:

receiving, at a computing device having one or more microprocessors, a service model including an application graph and an infrastructure graph, the application graph having a plurality of application nodes defining a hierarchy of software applications and the infrastructure graph having a plurality of infrastructure nodes defining a hierarchy of computing components, wherein a specific application node representing a specific software application in the application graph is linked to one or more specific infrastructure nodes in the infrastructure graph by one or more links, the one or more specific infrastructure nodes representing one or more specific computing components in the hierarchy that support the specific software application;

receiving, at the computing device, a new schedule of service for the specific software application represented by the specific application node;

loading, at the computing device, the application graph, the infrastructure graph, and the new schedule of service into a memory of the computing device;

assigning, at the computing device, the new schedule of service to the specific application node representing the specific software application in the computing environment;

propagating, at the computing device, the new schedule of service assigned to the specific application node to the one or more specific infrastructure nodes linked to the application node;

propagating, at the computing device, the new schedule of service to another infrastructure node in the infrastructure graph according to a predetermined inheritance rule; and

determining, at the computing device, an aggregated schedule of service for a given computing component in the computing infrastructure represented by the other infrastructure node by aggregating one or more schedules of service propagated to the other infrastructure node representing the given computing component, the one or more schedules of service including the new schedule of service.

2. The method of claim 1 wherein each of the links indicates a particular computing component of the plurality of computing components that hosts the software application.

3. The method of claim 1 wherein the new schedule of service is propagated to a particular application node in the application graph or a particular infrastructure node in the infrastructure graph from a parent node in the application graph or the infrastructure graph unless the parent node is configured to inherit the new schedule of service from the particular application node or the particular infrastructure node.

4. The method of claim 1 wherein the new schedule of service defines at least one period of availability of the software application and a priority corresponding to the software application during the period of availability.

5. The method of claim 4 wherein a first schedule of service having a first period of availability and a first priority and a second schedule of service having a second period of availability and a second priority are aggregated by combining the first period of availability and the second period of availability, wherein a conflict between the first period of availability and the second period availability is resolved in favor of the period of availability having a higher priority.

6. A method of scheduling service for a computing infrastructure in shared computing environment, comprising:

receiving, at a computing device having one or more microprocessors, a service model comprising an application graph and an infrastructure graph, the application graph having application nodes defining a hierarchy of applications and the infrastructure graph having infrastructure nodes defining a hierarchy of computing components, wherein a specific application node representing a specific application in the application graph is linked to a specific infrastructure node in the infrastructure graph by a link, the specific infrastructure node representing a specific computing component that supports the specific application;

receiving, at the computing device, a new schedule of service for the application represented by the application node;

loading, at the computing device, the application graph, the infrastructure graph, and the new schedule of service into a memory of the computing device;

assigning, at the computing device, the new schedule of service to the application node representing the application;

propagating, at the computing device, the new schedule of service to the specific infrastructure node representing the specific computing component that supports the specific application;

propagating, at the computing device, the new schedule of service to another infrastructure node in the infrastructure graph;

determining, at the computing device, an aggregated schedule of service for a another computing component in the hierarchy of computing components by aggregating one or more schedules of service propagated to the other infrastructure node, the one or more schedules of service including the new schedule of service.

7. The method of claim 6 wherein the new schedule of service is propagated to different nodes in the infrastructure graph according to a predetermined inheritance rule.

8. The method of claim 7 wherein the predetermined inheritance rule is that a given node inherits the new schedule of service from a parent node of the given node unless parent node of the given node is configured to inherit from the given node.

9. The method of claim 6 wherein each node in the service model is preconfigured with a corresponding propagation rule and the new schedule of service is propagated throughout the service model according to the propagation rules of the nodes in the service model.

10. The method of claim 6 further comprising merging the new schedule of service with a different schedule of service when an inheriting node inherits the new schedule of service and the different schedule of service.

11. The method of claim 10 wherein the new schedule of service and the different schedule of service are merged according to a first priority indicated in the new schedule of service and a second priority indicated in the different schedule of service.

12. The method of claim 6 wherein the specific application node in the application graph links to the specific infrastructure node in the infrastructure graph via a link node, wherein the new schedule of service is propagated from the specific application node to the specific infrastructure node via the link node.

13. A method for scheduling availability of a computing infrastructure in a shared computing environment, comprising:

receiving, at a computing device having one or more microprocessors, a service model comprising an application graph having application nodes defining a hierarchy of applications and an infrastructure graph having infrastructure nodes defining a hierarchy of computing components, wherein a specific application node in the application graph representing a specific application links to a specific infrastructure node in the infrastructure graph representing a specific computing component that supports the specific application via a link node;

receiving, at the computing device, a new schedule of service for the specific application, wherein the new schedule of service indicates a time when the specific application is available to a user and a priority of the specific application;

loading, at the computing device, service model and the new schedule of service into a memory of the computing device;

assigning, at the computing device, the new schedule of service to the specific application node representing the application;

propagating, at the computing device, the new schedule of service to the specific infrastructure node according a predetermined rule, wherein the new schedule of service is propagated to the specific infrastructure node via the link node;

propagating the schedule of service to another node in the infrastructure graph according to the predetermined rule, the other node representing another computing component; and

aggregating, at the computing device, one or more schedules of service that were propagated to the other infrastructure node to obtain an aggregated schedule of service for the other computing component, the one or more schedules of service including the schedule of service assigned to the application node.

14. The method of claim 13 wherein a node in either the application graph or the infrastructure graph is either configured to inherit from a parent node of the node or the parent node is configured to inherit from the node.

15. The method of claim 14 wherein the predetermined rule is that the node will inherit the schedule of service from the parent node unless the parent node is configured to inherit from the node.

Assignments (10)