Methods of federating applications providing modular data

• US 9,021,071 B2
• Filed: 06/09/2008
• Issued: 04/28/2015
• Est. Priority Date: 06/09/2008
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Setnes, Marie Louise, Warren, John Sebastian
• Primary Examiner(s): BOUTAH, ALINA A
• Application Number:
  US12/135,946
• Publication Number:
  US 20090307339A1
• Time in Patent Office: 2,514 Days
• Field of Search: 709/201, 709/208, 709217-219, 709220-223
• US Class Current: 709/222
• CPC Class Codes: G06F 16/185 Hierarchical storage management [HSM] systems, e.g. file migration or policies thereof details of archiving G06F16/11
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: G06F 9/5033 considering data affinity
• CPC Class Codes: G06F 9/5061 Partitioning or combining of resources
• 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 method in one embodiment includes establishing communication between a master node and several federated nodes, wherein each node is an instance of a distributed application; initializing the distributed application, wherein the initialization includes the federated nodes processing data local thereto and providing information about the local data to the master node; and after initialization, at run time, receiving data requests, wherein the master node services the data requests by routing the requests to the nodes. A method in another embodiment includes establishing communication between a master node and several federated nodes, wherein each node is an instance of a distributed application; initializing the distributed application, including gathering information about local data associated with each of the federated nodes, the information including associations of local data across multiple federated nodes; and after initialization, at run time, receiving data requests, wherein the master node services the data requests by routing the requests to one of the nodes believed to have the requested data.

Claims

1. A method, comprising:

establishing communication between a master node and several federated nodes, wherein each node is an instance of a distributed application;

initializing the distributed application, wherein the initialization includes the federated nodes processing data local thereto and providing information about the local data to the master node; and

after initialization, at run time, receiving data requests, wherein the master node services the data requests by routing the requests to the nodes.

2. The method of claim 1, wherein at least some of the federated nodes are running on a machine or machines other than a machine running the master node.

3. The method of claim 1 , wherein the master node orchestrates the initializing.

4. The method of claim 1, wherein the initializing is performed in phases, wherein each phase of the initialization is completed by all of the federated nodes before a subsequent initialization phase is performed.

5. The method of claim 1, wherein the initializing further comprises sharing information about the local data among the federated nodes, each federated node calculating associations of the data local thereto and local data on another federated node.

6. The method of claim 5, wherein the calculating includes generating a hierarchy of local data found in multiple federated nodes, and further comprising storing references to the federated nodes associated with the local data.

7. The method of claim 6, further comprising identifying branch roots contained in a set of the local data, retrieving subordinate resources to a home node of the root of its branch, assigning to each branch node a set of references to all descendants of the branch root, wherein at least some of the descendants are located on remote nodes.

8. The method of claim 7, further comprising assigning to each of the descendants a reference to its root branch and sending the reference to home nodes of the descendants for storage thereon.

9. The method of claim 8, further comprising assigning relationship properties to each of the descendants of the root branches, the relationship properties reflecting relationships of the descendants with each other.

10. The method of claim 9, further comprising, on each node, serializing the calculations involving data local thereto.

11. The method of claim 10, wherein during a subsequent initialization, if some local data on some federated nodes has changed, reloading the serialized data for use and updating the serialized data at run time.

12. The method of claim 10, wherein during a subsequent initialization, if some local data on one of the federated nodes has changed, discarding the serialized data, processing the data on the one of the federated nodes, reperforming the calculating, and reperforming the serializing.

13. The method of claim 1, wherein the master node routes the requests to all nodes.

14. The method of claim 1, wherein the master node routes the requests only to those nodes believed to have the requested data.

15. The method of claim 14, wherein the requests are not sent to nodes known to not contain data that satisfies query conditions for the requests.

16. A method, comprising:

establishing communication between a master node and several federated nodes, wherein each node is an instance of a distributed application;

initializing the distributed application, including gathering information about local data associated with each of the federated nodes, the information including associations of local data across multiple federated nodes; and

after initialization, at run time, receiving data requests, wherein the master node services the data requests by routing the requests to one of the nodes believed to have the requested data.

17. The method of claim 16, wherein the initializing further comprises sharing information about the local data among the federated nodes, each federated node calculating associations of the data local thereto and local data on another federated node, wherein the calculating includes generating a hierarchy of local data found in multiple federated nodes, and further comprising storing references to the federated nodes associated with the local data.

18. The method of claim 17, further comprising identifying branch roots contained in a set of the local data, retrieving subordinate resources to a home node of the root of its branch, assigning to each branch node a set of references to all descendants of the branch root, wherein at least some of the descendants are located on remote nodes.

19. The method of claim 18, further comprising assigning to each of the descendants a reference to its root branch and sending the reference to home nodes of the descendants for storage thereon.

20. The method of claim 19, further comprising assigning relationship properties to each of the descendants of the root branches, the relationship properties reflecting relationships of the descendants with each other.