Efficient state tracking for clusters

Patent metadata

Field	Value
Publication number	US-9842025-B2
Application number	US-201213351132-A
Country	US
Kind code	B2
Filing date	Jan 16, 2012
Priority date	Jan 16, 2012
Publication date	Dec 12, 2017
Grant date	Dec 12, 2017

Abstract

Exemplary system and computer program product embodiments for efficient state tracking for clusters are provided. In one embodiment, by way of example only, in a distributed shared memory architecture, an asynchronous calculation of deltas and the views is performed while concurrently receiving client requests and concurrently tracking the client requests times. The results of the asynchronous calculation may be applied to each of the client requests that are competing for data of the same concurrency during a certain period with currently executing client requests. Additional system and computer program product embodiments are disclosed and provide related advantages.

First claim

What is claimed is:

1. A system for efficient state tracking for clusters in a distributed shared memory architecture, comprising:
a processor device operable in the distributed shared memory architecture; an asynchronous calculation module in communication with the processor device, wherein the asynchronous calculation module is adapted for:
performing an asynchronous calculation of deltas while concurrently receiving client requests and concurrently tracking client requests times,
responding to each of the client requests of the same concurrency during a certain period with currently executing client requests with updated views based upon results of the asynchronous calculation; and
bounding a latency for the client requests by a time necessitated for the asynchronous calculation of at least two of the deltas; wherein a first state snapshot is atomically taken while simultaneously calculating the at least two of the deltas, and each of the client requests received during the certain period are served with the updated views of the asynchronously calculated at least two of the deltas, and wherein upon the time necessitated for the asynchronous calculation of the at least two of the deltas expires, the first state snapshot is disregarded and a second state snapshot is atomically taken for the asynchronous calculation of the deltas for the updating of the views of subsequent client requests, and
a state tracking module in communication with the processor device and the asynchronous calculation module, wherein the state tracking module and the processor device are adapted for concurrently tracking the client requests times.

2. The system of claim 1 , wherein the processor device is further adapted for, in conjunction with the responding, executing each of the client requests occurring after the certain period on the updated views, wherein all deltas and views are updated.

3. The system of claim 1 , wherein the processor device is further adapted for, in conjunction with the performing, folding the deltas in response to receiving client requests.

4. The system of claim 1 , wherein the processor device and the asynchronous calculation module are further adapted for, performing the asynchronous calculation for the deltas by a direct comparison between one of a plurality of snapshot states and the views, wherein the plurality of snapshot states include at least one of a most recent snapshot and a previous snapshot.

5. The system of claim 1 , wherein the processor device and the asynchronous calculation module are further adapted for performing the asynchronous calculation on demand.

6. The system of claim 1 , wherein the processor device and the asynchronous calculation module are further adapted for performing the asynchronous calculation only upon receipt of the client requests for the deltas calculated since a specified client request.

7. A computer program product for efficient state tracking for clusters in a distributed shared memory architecture by a processor device, the computer program product comprising a non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:
a first executable portion for performing an asynchronous calculation of deltas while concurrently receiving client requests and concurrently tracking client requests times;
a second executable portion for responding to each of the client requests of the same concurrency during a certain period with currently executing client requests with updated views based upon results of the asynchronous calculation; and
a third executable portion for bounding a latency for the client requests by a time necessitated for the asynchronous calculation of at least two of the deltas; wherein a first state snapshot is atomically taken while simultaneously calculating the at least two of the deltas, and each of the client requests received during the certain period are served with the updated views of the asynchronously calculated at least two of the deltas, and wherein upon the time necessitated for the asynchronous calculation of the at least two of the deltas expires, the first state snapshot is disregarded and a second state snapshot is atomically taken for the asynchronous calculation of the deltas for the updating of the views of subsequent client requests.

8. The computer program product of claim 7 , further including a fourth executable portion for, in conjunction with the responding, executing each of the client requests occurring after the certain period on the updated views, wherein all deltas and views are updated.

9. The computer program product of claim 7 , further including a fourth executable portion for, in conjunction with the performing, folding the deltas in response to receiving client requests.

10. The computer program product of claim 7 , further including a fourth executable portion for performing the asynchronous calculation for the deltas by a direct comparison between one of a plurality of snapshot states and the views, wherein the plurality of snapshot states include at least one of a most recent snapshot and a previous snapshot.

11. The computer program product of claim 7 , further including a fourth executable portion for performing the asynchronous calculation on demand.

12. The computer program product of claim 7 , further including a fourth executable portion for, further including, performing the asynchronous calculation only upon receipt of the client requests for the deltas calculated since a specified client request.

Assignees

• Keller Michael
• IBM

Inventors

• Keller Michael

Classifications

• G06F2201/84

  Using snapshots, i.e. a logical point-in-time copy of the data · CPC title

• G06F11/1438 Primary

  Restarting or rejuvenating · CPC title