Managing multi-node multi-version systems

• US 7,996,359 B2
• Filed: 06/16/2008
• Issued: 08/09/2011
• Est. Priority Date: 06/16/2008
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Abdul, Anis M, Pietraniec, Nicholas Anthony, Jacobs, Brent William, Mahajan, Ajay Kumar
• Primary Examiner(s): Lee; Wilson
• Application Number:
  US12/139,537
• Publication Number:
  US 20090313257A1
• Time in Patent Office: 1,149 Days
• Field of Search: 707609-635
• US Class Current: 707/610
• 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

Abstract

A method, system, and computer usable program product for managing multi-node multi-version systems are provided in the illustrative embodiments. A process associates a version identifier with a first version of data available at a first node in the multi-node multi-version system. The version identifier corresponds to the first version of the data. The data includes an update. The process sends the data and the associated version identifier to a second node without learning a second version of data available at the second node. In one embodiment, the first version of data may be a subset of the second version of data. In another embodiment the second version of data may be a subset of the first version of data. The process repeats the sending for each update at the first node.

Claims

1. A computer implemented method for managing a multi-node multi-version system, the computer implemented method comprising:

associating a version identifier with a first version of data available at a first node in the multi-node multi-version system, the version identifier corresponding to the first version of the data, the data including an update;

sending the data and the associated version identifier to a second node without having at the first node information about a second version of data available at the second node such that when the first version is lower than the second version, the sending enabling the second node to downgrade the second node'"'"'s operation to the first version with respect to the first node, and when the first version is higher than the second version, the sending allowing the second node to continue operation at the second version using that part of the data which corresponds to the second version; and

repeating the sending for each update at the first node.

2. The computer implemented method of claim 1, wherein

the associating the version identifier includes associating a plurality of version identifiers with a plurality of versions of data available at the first node, and

the sending the data and the associated version identifier includes sending the data and the plurality of version identifiers.

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

receiving an acknowledgment from the second node, the acknowledgment indicating accepting the second version at the second node.

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

transmitting to the second node, a subset of the data that corresponds to the second version, forming a second version data.

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

determining whether one of (i) a predetermined period has elapsed, and (ii) an event has occurred in the multi-node multi-version system, forming a sending determination; and

sending, responsive to the sending determination being true, the data corresponding to the first version to the second node.

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

sending to a third node the data and the associated version identifier without having at the first node information about a third version of data available at the third node such that when the first version is lower than the third version, the sending enabling the third node to downgrade the third node'"'"'s operation to the first version with respect to the first node, and when the first version is higher than the third version, the sending allowing the third node to continue operation at the third version using that part of the data which corresponds to the third version; and

repeating the sending to the third node for each update at the first node.

7. The computer implemented method of claim 6, wherein one of (i) the first version of data is a subset of the third version of data, and (ii) the third version of data is a subset of the first version of data, and wherein one of (i) the second version of data is a subset of the third version of data, (ii) the third version of data is a subset of the second version of data, and (iii) the second version of data and the third version of data are distinct from each other.

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

communicating from the first node to the second node using data corresponding to the second version; and

communicating from the first node to the third node using data corresponding to the third version.

9. The computer implemented method of claim 8, further comprising:

communicating from the first node to a fourth node using data corresponding to the first version.

10. A computer usable program product comprising a non-transitory computer usable storage medium including computer usable code for managing a multi-node multi-version system, the computer usable code comprising:

computer usable code for associating a version identifier with a first version of data available at a first node in the multi-node multi-version system, the version identifier corresponding to the first version of the data, the data including an update;

computer usable code for sending the data and the associated version identifier to a second node without having at the first node information about a second version of data available at the second node such that when the first version is lower than the second version, the sending enabling the second node to downgrade the second node'"'"'s operation to the first version with respect to the first node, and when the first version is higher than the second version, the sending allowing the second node to continue operation at the second version using that part of the data which corresponds to the second version, and

computer usable code for repeating the sending for each update at the first node.

11. The computer usable program product of claim 10, wherein

the computer usable code for associating the version identifier includes computer usable code for associating a plurality of version identifiers with a plurality of versions of data available at the first node, and

the computer usable code for sending the data and the associated version identifier includes computer usable code for sending the data and the plurality of version identifiers.

12. The computer usable program product of claim 11, further comprising:

computer usable code for receiving an acknowledgment from the second node, the acknowledgment indicating accepting the second version at the second node;

computer usable code for transmitting to the second node, a subset of the data that corresponds to the second version, forming a second version data;

computer usable code for determining whether one of (i) a predetermined period has elapsed, and (ii) an event has occurred in the multi-node multi-version system, forming a sending determination; and

computer usable code for sending, responsive to the sending determination being true, the data corresponding to the first version to the second node.

13. The computer usable program product of claim 10, further comprising:

computer usable code for sending to a third node the data and the associated version identifier without having at the first node information about a third version of data available at the third node such that when the first version is lower than the third version, the sending enabling the third node to downgrade the third node'"'"'s operation to the first version with respect to the first node, and when the first version is higher than the third version, the sending allowing the third node to continue operation at the third version using that part of the data which corresponds to the third version, wherein one of (i) the first version of data is a subset of the third version of data, and (ii) the third version of data is a subset of the first version of data, and wherein one of (i) the second version of data is a subset of the third version of data, (ii) the third version of data is a subset of the second version of data, and (iii) the second version of data and the third version of data are distinct from each other; and

computer usable code for repeating the sending to the third node for each update at the first node.

14. The computer usable program product of claim 13, further comprising:

computer usable code for communicating from the first node to the second node using data corresponding to the second version; and

computer usable code for communicating from the first node to the third node using data corresponding to the third version.

15. The computer usable program product of claim 14, further comprising:

computer usable code for communicating from the first node to a fourth node using data corresponding to the first version.

16. A data processing system for managing a multi-node multi-version system, the data processing system comprising:

a storage device, wherein the storage device stores computer usable program code; and

a processor, wherein the processor executes the computer usable program code, and wherein the computer usable program code comprises;

computer usable code for associating a version identifier with a first version of data available at a first node in the multi-node multi-version system, the version identifier corresponding to the first version of the data, the data including an update;

computer usable code for sending the data and the associated version identifier to a second node without having at the first node information about a second version of data available at the second node such that when the first version is lower than the second version, the sending enabling the second node to downgrade the second node'"'"'s operation to the first version with respect to the first node, and when the first version is higher than the second version, the sending allowing the second node to continue operation at the second version using that part of the data which corresponds to the second version; and

computer usable code for repeating the sending for each update at the first node.

17. The data processing system of claim 16, wherein

the computer usable code for associating the version identifier includes computer usable code for associating a plurality of version identifiers with a plurality of versions of data available at the first node, and

the computer usable code for sending the data and the associated version identifier includes computer usable code for sending the data and the plurality of version identifiers.

18. The data processing system of claim 17, further comprising:

computer usable code for receiving an acknowledgment from the second node, the acknowledgment indicating accepting the second version at the second node;

computer usable code for transmitting to the second node, a subset of the data that corresponds to the second version, forming a second version data;

computer usable code for determining whether one of (i) a predetermined period has elapsed, and (ii) an event has occurred in the multi-node multi-version system, forming a sending determination; and

computer usable code for sending, responsive to the sending determination being true, the data corresponding to the first version to the second node.

19. The data processing system of claim 16, further comprising:

computer usable code for sending to a third node the data and the associated version identifier without having at the first node information about a third version of data available at the third node such that when the first version is lower than the third version, the sending enabling the third node to downgrade the third node'"'"'s operation to the first version with respect to the first node, and when the first version is higher than the third version, the sending allowing the third node to continue operation at the third version using that part of the data which corresponds to the third version, wherein one of (i) the first version of data is a subset of the third version of data, and (ii) the third version of data is a subset of the first version of data, and wherein one of (i) the second version of data is a subset of the third version of data, (ii) the third version of data is a subset of the second version of data, and (iii) the second version of data and the third version of data are distinct from each other; and

computer usable code for repeating the sending to the third node for each update at the first node.

20. The data processing system of claim 19, further comprising:

computer usable code for communicating from the first node to the second node using data corresponding to the second version;

computer usable code for communicating from the first node to the third node using data corresponding to the third version; and

computer usable code for communicating from the first node to a fourth node using data corresponding to the first version.