Dependency management with atomic decay

• US 20090144305A1
• Filed: 11/29/2007
• Published: 06/04/2009
• Est. Priority Date: 11/29/2007
• Status: Active Grant

• Current Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Original Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Inventors: Little, Mark Cameron
• Granted Patent: US 8,464,270 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/119 Details of migration of file systems migration mechanisms in storage systems G06F3/0647
• CPC Class Codes: G06F 16/214 Database migration support
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46

Abstract

A dependency is identified between a first component of a distributed computing system and a second component of the distributed computing system if the first component invokes the second component. A dependency map of the distributed computing system that includes the dependency between the first component and the second component is built.

Claims

1. A computer implemented method, comprising:

identifying a dependency between a first component of a distributed computing system and a second component of the distributed computing system if the first component invokes the second component; and

building a dependency map of the distributed computing system that includes the dependency between the first component and the second component.

2. The computer implemented method of claim 1, wherein the first component includes a first unique identification, the second component includes a second unique identification, and wherein the dependency map correlates each unique identification with a distinct service.

3. The computer implemented method of claim 1, further comprising:

applying a dependency rating to the dependency; and

applying an atomic decay having a specified half life to the dependency rating, wherein the atomic decay reduces a value of the dependency rating over time according to the specified half life.

4. The computer implemented method of claim 3, further comprising:

migrating the first component from a first location to a second location; and

migrating the second component to the second location if the dependency rating has a value that is greater than a dependency threshold.

5. The computer implemented method of claim 3, further comprising:

resetting the dependency rating each time the first component invokes the second component.

6. The computer implemented method of claim 1, further comprising:

migrating the first component from a first location to a second location;

determining whether the first component depends on the second component using the dependency map; and

migrating the second component to the second location if the first component depends on the second component.

7. The computer implemented method of claim 1, further comprising:

recording statistics regarding the invocation of the second component by the first component; and

using the statistics to determine a dependency rating for the dependency, wherein the dependency rating identifies a degree of dependency between the first component and the second component.

8. A computer readable storage medium including instructions that, when executed by a processor, cause the processor to perform a method comprising:

identifying a dependency between a first component of a distributed computing system and a second component of the distributed computing system if the first component invokes the second component; and

building a dependency map of the distributed computing system that includes the dependency between the first component and the second component.

9. The computer readable storage medium of claim 8, wherein the first component includes a first unique identification, the second component includes a second unique identification, and wherein the dependency map correlates each unique identification with a distinct service.

10. The computer readable storage medium of claim 8, the method further comprising:

applying a dependency rating to the dependency; and

applying an atomic decay having a specified half life to the dependency rating, wherein the atomic decay reduces a value of the dependency rating over time according to the specified half life.

11. The computer readable storage medium of claim 10, the method further comprising:

migrating the first component from a first location to a second location; and

migrating the second component to the second location if the dependency rating has a value that is greater than a dependency threshold.

12. The computer readable storage medium of claim 10, the method further comprising:

resetting the dependency rating each time the first component invokes the second component.

13. The computer readable storage medium of claim 8, the method further comprising:

migrating the first component from a first location to a second location;

determining whether the first component depends on the second component using the dependency map; and

migrating the second component to the second location if the first component depends on the second component.

14. The computer readable storage medium of claim 8, the method further comprising:

recording statistics regarding the invocation of the second component by the first component; and

using the statistics to determine a dependency rating for the dependency, wherein the dependency rating identifies a degree of dependency between the first component and the second component.

15. A distributed computing system comprising:

a data store;

a dependency reporter, connected with the data store and at least one of a first service or a second service, to store an invocation record in the data store when the first service invokes the second service; and

a dependency map of the distributed system, the dependency map to use the invocation record to identify that the first service depends on the second service.

16. The distributed computing system of claim 15, wherein the dependency map is configured to apply a dependency rating to a dependency between the first service and the second service, and to apply an atomic decay having a specified half life to the dependency rating, wherein the atomic decay reduces a value of the dependency rating over time according to the specified half life.

17. The distributed computing system of claim 16, wherein the dependency map is configured to reset the dependency rating each time the first component invokes the second component.

18. The distributed computing system of claim 16, further comprising:

the first service, located at a first location within the distributed computing system, the first service to invoke the second service; and

the second service, located at one of the first location or a second location within the distributed computing system.

19. The distributed computing system of claim 18, further comprising:

a migrator, connected with the dependency map, the migrator to migrate the first component from the first location to a third location, and to migrate the second component to the third location if the dependency rating has a value that is greater than a dependency threshold.

20. The distributed computing system of claim 15, wherein the first service includes a first unique identification, the second service includes a second unique identification, and wherein the dependency map correlates each unique identification with a distinct service name.

21. A computer readable storage medium including instructions that, when executed by a processor, cause the processor to perform a method comprising:

identifying a dependency between a first component of a distributed computing system and a second component of the distributed computing system if the first component invokes the second component, wherein the first component has a first unique identification and the second component has a second unique identification;

associating the first component with a first service using the first unique identification and the second component with the second service using the second unique identification;

building a dependency map of the distributed computing system that includes a dependency between the first service and the second service; and

applying a dependency rating to each dependency in the dependency map, the dependency rating having an atomic decay with a specified half life, wherein the atomic decay reduces a value of the dependency rating over time according to the specified half life.