Efficient state tracking for clusters

Patent metadata

Field	Value
Publication number	US-10169157-B2
Application number	US-201715805481-A
Country	US
Kind code	B2
Filing date	Nov 7, 2017
Priority date	Jan 16, 2012
Publication date	Jan 1, 2019
Grant date	Jan 1, 2019

Abstract

Exemplary method, 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. A latency is bound for the client requests by a time necessitated for the asynchronous calculation of at least two of the deltas where a first state snapshot is atomically taken while simultaneously calculating the at least two of the deltas.

First claim

What is claimed is:

1. A method for efficient state tracking for clusters by a processor device in a distributed shared memory architecture, the method comprising:
performing an asynchronous calculation of deltas while concurrently receiving client requests and concurrently tracking client requests times;
responding to each of the client requests for data of the same concurrency during a certain period with currently executing client requests with updated views based upon results of the asynchronous calculation; concurrently executing each of the client requests occurring after the certain period on the updated views, wherein all deltas and views are updated; 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.

2. The method of claim 1 , further including, in conjunction with the performing, folding the deltas in response to receiving client requests.

3. The method of claim 1 , further including, performing the asynchronous calculation for the deltas by using 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.

4. The method of claim 1 , further including performing the asynchronous calculation on demand.

5. The method of claim 1 , further including performing the asynchronous calculation only upon receipt of the client requests for the deltas calculated since a specified client request.

6. A system for efficient state tracking for clusters in a distributed shared memory architecture, comprising:
a processor device executing instructions stored in the distributed shared memory architecture, wherein when executed, the instructions cause the processor device to:
perform an asynchronous calculation of deltas while concurrently receiving client requests and concurrently tracking client requests times;
respond to each of the client requests for data of the same concurrency during a certain period with currently executing client requests with updated views based upon results of the asynchronous calculation; concurrently execute each of the client requests occurring after the certain period on the updated views, wherein all deltas and views are updated; and
bound a latency for the client requests by a time necessitated for the a synchronous 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.

7. The system of claim 6 , wherein the processor device, in conjunction with the performing, folds the deltas in response to receiving client requests.

8. The system of claim 6 , wherein the processor device performs the asynchronous calculation for the deltas by using 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.

9. The system of claim 6 , wherein the processor device performs the asynchronous calculation on demand.

10. The system of claim 6 , wherein the processor device performs the asynchronous calculation only upon receipt of the client requests for the deltas calculated since a specified client request.

11. 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:
an executable portion that performs an asynchronous calculation of deltas while concurrently receiving client requests and concurrently tracking client requests times;
an executable portion that responds to each of the client requests for data of the same concurrency during a certain period with currently executing client requests with updated views based upon results of the asynchronous calculation;
an executable portion that concurrently executes each of the client requests occurring after the certain period on the updated views, wherein all deltas and views are updated; and
an executable portion that bounds 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.

12. The computer program product of claim 11 , further including an executable portion that, in conjunction with the performing, folds the deltas in response to receiving client requests.

13. The computer program product of claim 11 , further including an executable portion that performs the asynchronous calculation for the deltas by using 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.

14. The computer program product of claim 11 , further including an executable portion that performs the asynchronous calculation on demand.

15. The computer program product of claim 11 , further including an executable portion that performs the asynchronous calculation only upon receipt of the client requests for the deltas calculated since a specified client request.

Assignees

• 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