JAVA VIRTUAL MACHINE HAVING INTEGRATED TRANSACTION MANAGEMENT SYSTEM

• US 20090276483A1
• Filed: 04/30/2009
• Published: 11/05/2009
• Est. Priority Date: 05/01/2008
• Status: Active Grant

• Current Assignee: Cloud Software Group
• Original Assignee: Kabira Technologies, Inc. (Cloud Software Group)
• Inventors: PILE, Jonathon C., SIFTER, Daniel J., PHILLIPS, Mark, STONE, David, LIND, Otto, SARMIENTO, Ramiro, ZANG, Xiguang
• Granted Patent: US 8,606,877 B2
• Time in Patent Office: Days
• US Class Current: 709/201
• CPC Class Codes: G06F 9/466 Transaction processing

Abstract

A computing system comprises a plurality of computing nodes and is configured such that each computing node includes a processor configured to execute JAVA computer program instructions. The computing nodes cooperate to form a cluster, wherein the JAVA computer program instructions being executed by the plurality of computing nodes collectively accomplish a fully transactional application. Each application data object partition is associated with one of the computing nodes as a primary node for application data objects of that partition and further associated with at least one of the computing nodes as at least one secondary node for application data objects of that partition. Messages relative to an application data object are provided to the primary node for the application data object as well as to the at least one secondary node for that application data object, for updates. The particular application object is readable at any of the primary node and the at least one secondary node for that particular application data object.

Claims

1. A computing system comprising a plurality of computing nodes, the computing system configured such that:

each computing node includes a processor configured to execute JAVA computer program instructions, wherein the computing nodes cooperate to form a cluster, wherein the JAVA computer program instructions being executed by the plurality of computing nodes collectively accomplish a fully transactional application;

application data objects are organized into partitions, wherein each partition is associated with one of the computing nodes as a primary node for application data objects of that partition and further associated with at least one of the computing nodes as at least one secondary node for application data objects of that partition;

the computing nodes are configured such that messages relative to an application data object are provided to the primary node for the application data object as well as to the at least one secondary node for that application data object, for updates.

2. The computing system of claim 1, wherein:

the computing nodes are configured such that the particular application object is readable at any of the primary node and the at least one secondary node for that particular application data object.

3. The computing system of claim 1, wherein the computing system is configured such that:

for the particular application data object, all the nodes of the partition of that particular application object are configured to receive requests relating to the particular application object and to cause the requests to be routed to the primary node for that particular application data object.

4. The computing system of claim 3, wherein:

causing the requests to be routed to the primary node for that particular data object is accomplished by a route class.

5. The computing system of claim 3, wherein:

causing the requests to be routed to the primary node for that particular data object is accomplished by a route class configured to route requests for all data objects of the partition to which the particular data object belongs.

6. The computing system of claim 5, wherein:

the route class is also configured to route requests, for data objects of a partition, to a designated node.

7. The computing system of claim 1, wherein:

the at least one secondary node is a single one of the computing nodes.

8. The computing system of claim 1, wherein:

the system is configured to change the designated node to which to route requests to one of the at least one secondary node.

9. The computing system of claim 8, wherein:

the computing system is configured to change which node is the designated node based on the primary node being unavailable.

10. The computing system of claim 9, wherein:

the computing system is further configured to restore a state of the application data object from one of the at least one secondary nodes based on the primary node again becoming available.

11. The computing system of claim 1, wherein:

the computing system is configured to use an optimized implicit commit transactional protocol, wherein operations including creates, updates, and deletes for an application data object are provided in a single request to the at least one secondary node along with a commit for that operation and no transaction locks are taken on the least one secondary node as a result of such operations.

12. A computer program product comprising at least one tangible computer readable medium having computer program instructions tangibly embodied thereon, the computer program instructions to configure a computing system comprising a plurality of computing nodes to:

configure each computing node to execute JAVA computer program instructions, wherein the computing nodes cooperate to form a cluster, wherein the JAVA computer program instructions being executed by the plurality of computing nodes collectively accomplish a fully transactional application;

organize application data objects into partitions, wherein each partition is associated with one of the computing nodes as a primary node for application data objects of that partition and further associated with at least one of the computing nodes as at least one secondary node for application data objects of that partition;

configure the computing nodes such that messages relative to an application data object are provided to the primary node for the application data object as well as to the at least one secondary node for that application data object, for updates.

13. The computer program product of claim 12, wherein:

the computer program instructions configure the computing nodes such that the particular application object is readable at any of the primary node and the at least one secondary node for that particular application data object.

14. The computer program product of claim 12, wherein the computer program instructions configure the computing nodes such that, for the particular application data object, all the nodes of the partition of that particular application object are configured to receive requests relating to the particular application object and to cause the requests to be routed to the primary node for that particular application data object.

15. The computer program product of claim 14, wherein:

causing the requests to be routed to the primary node for that particular data object is accomplished by a route class.

16. The computer program product of claim 14, wherein:

causing the requests to be routed to the primary node for that particular data object is accomplished by a route class configured to route requests for all data objects of the partition to which the particular data object belongs.

17. The computer program product of claim 16, wherein:

the route class is also configured to route requests, for data objects of a partition, to a designated node.

18. The computer program product of claim 12, wherein:

the at least one secondary node is a single one of the computing nodes.

19. The computer program product of claim 12, wherein:

the computer program instructions configure the computing nodes to change the designated node to which to route requests to one of the at least one secondary node.

20. The computer program product of claim 19, wherein the computer program instructions configure the computing nodes to change which node is the designated node based on the primary node being unavailable.

21. The computer program product of claim 20, wherein:

the computer program instructions configure the computing nodes to restore a state of the application data object from one of the at least one secondary nodes based on the primary node again becoming available.

22. The computer program product of claim 12, wherein:

the computer program instructions configure the computing nodes to use an optimized implicit commit transactional protocol, wherein operations including creates, updates, and deletes for an application data object are provided in a single request to the at least one secondary node along with a commit for that operation and no transaction locks are taken on the least one secondary node as a result of such operations.