Method, system and program products for managing processing groups of a distributed computing environment

• US 7,325,046 B1
• Filed: 05/31/2000
• Issued: 01/29/2008
• Est. Priority Date: 05/31/2000
• Status: Expired due to Fees

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: International Business Machines Corporation
• Inventors: Laib, Gregory D., Briskey, Kenneth C., Uceda-Sosa, Rosario A., Novaes, Marcos N.
• Primary Examiner(s): WON, MICHAEL YOUNG
• Application Number:
  US09/584,259
• Time in Patent Office: 2,799 Days
• Field of Search: 709/221, 709/201, 709/227, 709/228, 709/248, 709/224, 709/225, 709/226, 709/229, 709/220, 709/251, 718/1, 718/100, 718/106
• US Class Current: 709/220
• CPC Class Codes: G06F 2209/505 Clust
• CPC Class Codes: G06F 9/5061 Partitioning or combining of resources

Abstract

The management and use of replicated distributed transactions is facilitated. A distributed synchronous transaction system protocol is provided to manage the replication of distributed transactions for client application instances. The distributed synchronous transaction system allows transactions to be replicated without having the client application instances be aware of other instances to receive the transaction. Further, if a failure occurs during processing of a distributed replicated transaction, the distributed synchronous transaction system manages the recovery of the failure.

Claims

1. A method of managing processing groups of a shared nothing distributed computing environment, said method comprising:

requesting via a request by a prospective member to join a processing group of a shared nothing distributed computing environment, said request including a sequence number indicating a version of the processing group, wherein the shared nothing distributed computing environment is an environment with a particular system architecture wherein only one processing node is connected to a given disk;

determining whether the prospective member can join the processing group, said determining employing the sequence number, wherein the determining comprises comparing by said prospective member the sequence number in the request with a current group sequence number to determine if the join of the prospective member to the processing group should continue;

joining the processing group by the prospective member, in response at least in part to the determining indicating that the prospective member can join the processing group; and

wherein the joining comprises automatically reinitializing state of the prospective member responsive to the comparing indicating that the sequence number in the request is less than the current group sequence number, the reinitializing making a state of the prospective member consistent with a state of an existing member of the processing group, and thereafter, proceeding with the joining by the prospective member.

2. The method of claim 1, further comprising updating state associated with the processing group, in response to the request, said updating providing the current group sequence number.

3. The method of claim 2, further comprising quiescing activity that may affect the state prior to said updating.

4. The method of claim 1, wherein the determining specifies that the join should continue if the compare indicates that the sequence number in the request is less than the current group sequence number, otherwise the join should not continue.

5. The method of claim 1, further comprising determining an activity status of the processing group prior to the reinitializing, wherein the reinitializing is performed if the processing group is active.

6. The method of claim 1, wherein the joining further comprises updating the current group sequence number.

7. A method of managing processing groups of a shared nothing distributed computing environment, said method comprising:

joining a prospective member to an inactive processing group of a shared nothing distributed computing environment, wherein the shared nothing distributed computing environment is an environment with a particular system architecture wherein only one processing node is connected to a given disk;

comparing a sequence number of the processing group with a sequence number of the prospective member;

updating the sequence number of the processing group, in response to the comparing indicating a particular difference;

determining whether a quorum of members has joined the processing group;

setting the sequence number of the processing group, in response to the determining indicating a quorum of members has joined the processing group;

initiating activation of the processing group, in response to the setting; and

wherein the initiating activation comprises;

obtaining by a member of the processing group having a sequence number lower than the sequence number of the processing group a copy of group state associated with the sequence number of the processing group; and

reinitializing the member using the copy of group state.

8. The method of claim 7, wherein activation of the processing group comprises updating the sequence number of the processing group.

9. The method of claim 8, wherein the updating of the sequence number of the processing group comprises updating the sequence number, in response to there being a majority of members in the processing group.

10. The method of claim 7, wherein a member comprises a distributed synchronous transaction system.

11. A system of managing processing groups of a shared nothing distributed computing environment, said system comprising:

a request by a prospective member to join a processing group of a shared nothing distributed computing environment, said request including a sequence number indicating a version of the processing group, wherein the shared nothing distributed computing environment is an environment with a particular system architecture wherein only one processing node is connected to a given disk;

means for determining whether the prospective member can join the processing group, said means for determining employing the sequence number, wherein the means for determining comprises means for comparing by said prospective member the sequence number in the request with a current group sequence number to determine if the join of the prospective member to the processing group should continue;

means for joining the processing group by the prospective member, in response at least in part to the determining indicating that the prospective member can join the processing group; and

wherein the means for joining comprises means for automatically reinitializing state of the prospective member responsive to the means for comparing indicating that the sequence number in the request is less than the current group sequence number, the reinitializing making a state of the prospective member consistent with a state of an existing member of the processing group, and thereafter, proceeding with the joining by the prospective member.

12. The system of claim 11, further comprising means for updating state associated with the processing group, in response to the request, said updating providing the current group sequence number.

13. The system of claim 12, further comprising means for quiescing activity that may affect the state prior to said updating.

14. The system of claim 11, wherein the determining specifies that the join should continue if the compare indicates that the sequence number in the request is less than the current group sequence number, otherwise the join should not continue.

15. The system of claim 11, further comprising means for determining an activity status of the processing group prior to the reinitializing, wherein the reinitializing is performed if the processing group is active.

16. The system of claim 11, wherein the means for joining further comprises means for updating the current group sequence number.

17. A system of managing processing groups of a shared nothing distributed computing environment, said system comprising:

means for joining a prospective member to an inactive processing group of a shared nothing distributed computing environment, wherein the shared nothing distributed computing environment is an environment with a particular system architecture wherein only one processing node is connected to a given disk;

means for comparing a sequence number of the processing group with a sequence number of the prospective member;

means for updating the sequence number of the processing group, in response to the comparing indicating a particular difference;

means for determining whether a quorum of members has joined the processing group;

means for setting the sequence number of the processing group, in response to the determining indicating a quorum of members has joined the processing group;

means for initiating activation of the processing group, in response to the setting; and

wherein the means for initiating activation comprises;

means for obtaining by a member of the processing group having a sequence number lower than the sequence number of the processing group a copy of group state associated with the sequence number of the processing group; and

means for reinitializing the member using the copy of group state.

18. The system of claim 17, wherein activation of the processing group comprises means for updating the sequence number of the processing group.

19. The system of claim 18, wherein the means for updating of the sequence number of the processing group comprises means for updating the sequence number, in response to there being a majority of members in the processing group.

20. An article of manufacture comprising:

at least one computer usable storage medium having computer readable program code logic stored thereon to manage processing groups of a shared nothing distributed computer environment, the computer readable program code logic comprising;

a request by a prospective member to join a processing group of a shared nothing distributed computing environment, said request including a sequence number indicating a version of the processing group, wherein the shared nothing distributed computing environment is an environment with a particular system architecture wherein only one processing node is connected to a given disk;

determine logic to determine whether the prospective member can join the processing group, said determining employing the sequence number, wherein the determining comprises comparing by said prospective member the sequence number in the request with a current group sequence number to determine if the join of the prospective member to the processing group should continue;

join logic to join the processing group by the prospective member, in response at least in part to the determining indicating that the prospective member can join the processing group; and

wherein the join logic comprises automatically reinitialize logic to automatically reinitialize state of the prospective member responsive to the comparing indicating that the sequence number in the request is less than the current group sequence number, the automatic reinitialize logic making a state of the prospective member consistent with a state of an existing member of the processing group, and thereafter, proceeding with the joining by the prospective member.

21. The article of manufacture of claim 20, further comprising update logic to update state associated with the processing group, in response to the request, said updating providing the current group sequence number.

22. The article of manufacture of claim 21, further comprising quiesce logic to quiesce activity that may affect the state prior to said updating.

23. The article of manufacture of claim 20, wherein the determining specifies that the join should continue if the compare indicates that the sequence number in the request is less than the current group sequence number, otherwise the join should not continue.

24. The article of manufacture of claim 20, further comprising determine logic to determine an activity status of the processing group prior to the reinitializing, wherein the reinitializing is performed if the processing group is active.

25. The article of manufacture of claim 20, wherein the join logic further comprises update logic to update the current group sequence number.

26. An article of manufacture comprising:

at least one computer usable storage medium having computer readable program code logic stored thereon to manage processing groups of a shared nothing distributed computer environment, the computer readable program code logic comprising;

join logic to join a prospective member to an inactive processing group of a shared nothing distributed computing environment, wherein the shared nothing distributed computing environment is an environment with a particular system architecture wherein only one processing node is connected to a given disk;

compare logic to compare a sequence number of the processing group with a sequence number of the prospective member;

update logic to update the sequence number of the processing group, in response to the comparing indicating a particular difference;

determine logic to determine whether a quorum of members has joined the processing group;

set logic to set the sequence number of the processing group, in response to the determining indicating a quorum of members has joined the processing group;

initiate logic to initiate activation of the processing group, in response to the setting; and

wherein the initiate logic comprises;

obtain logic to obtain by a member of the processing group having a sequence number lower than the sequence number of the processing group a copy of group state associated with the sequence number of the processing group; and

reinitialize logic to reinitialize the member using the copy of group state.

27. The article of manufacture of claim 26, wherein activation of the processing group comprises update logic to update the sequence number of the processing group.

28. The article of manufacture of claim 27, wherein the update logic to update the sequence number of the processing group comprises update logic to update the sequence number, in response to there being a majority of members in the processing group.

29. The article of manufacture of claim 26, wherein a member comprises a distributed synchronous transaction system.