Fault tolerant listener registration in the presence of node crashes in a data grid

Patent metadata

Field	Value
Publication number	US-9965364-B2
Application number	US-201715589465-A
Country	US
Kind code	B2
Filing date	May 8, 2017
Priority date	Oct 31, 2014
Publication date	May 8, 2018
Grant date	May 8, 2018

Abstract

A processing device to receive, from a second node in the data grid system, a first filter. The processing device may detect a failure of a third node of the data grid system. The processing device may determine that the backup data stored at the first node matches the first filter. The processing device may send, to the second node, a duplicate data notification indicating that the backup data comprises, at least in part, first data duplicative to second data communicated to the second node from the third node.

First claim

What is claimed is:

1. A non-transitory computer readable storage medium having instructions that, when executed by a processing device of a first node in a data grid system, cause the processing device to:
receive, from a second node in the data grid system, a first filter;
detect a failure of a third node of the data grid system;
determine that backup data stored at the first node matches the first filter; and
send, to the second node, a duplicate data notification indicating that the backup data comprises, at least in part, first data duplicative to second data communicated to the second node from the third node.

2. The non-transitory computer readable storage medium of claim 1 , wherein the processing device is further to communicate, to the second node, a part of the first data that matches the first filter.

3. The non-transitory computer readable storage medium of claim 1 , wherein the processing device is to receive, detect, determine, and send during an iteration period of a search query defined by search criteria of the first filter.

4. The non-transitory computer readable storage medium of claim 1 , wherein the first node, the second node, and the third node are part of a node cluster in the data grid system.

5. The non-transitory computer readable storage medium of claim 1 , wherein in response to the failure of the third node, the processing device is further to remove a second filter received from the third node.

6. The non-transitory computer readable storage medium of claim 1 , wherein to detect the failure of the third node, the processing device is further to determine that a heartbeat message initiated by the third node has not been received at the first node within a threshold period of time.

7. The non-transitory computer readable storage medium of claim 1 , wherein to detect the failure of the third node, the processing device is further to:
determine that a heartbeat message initiated by the third node has not been received at the first node within a first threshold period of time;
in response to not receiving the heartbeat message within the first threshold period of time, send a check node request to a fourth node in the data grid system; and
receive a failure notification from the fourth node.

8. The non-transitory computer readable storage medium of claim 1 , the processing device further to:
rebuild a queue of one or more modifications to a second memory of the third node; and
communicate the queue to the first node.

9. The non-transitory computer readable storage medium of claim 8 , wherein the one or more modifications comprise at least one of: a cache write, a cache entry removal or deletion, or a cache modification.

10. A system comprising:
a first memory to store data; and
a processor coupled to the first memory, the processor to:
maintain a queue indicating one or more modifications to data in a cache of a first node in a data grid system, wherein the one or more modifications comprise at least one of a cache write, a cache entry removal or deletion, or a cache modification;
detect a failure of the first node in the data grid has crashed; and
send the queue to a second node.

11. The system of claim 10 , wherein the processor is further to order the queue to indicate modifications that occurred during an iteration period.

12. The system of claim 10 , the processor further to:
receive a filter from the first node;
determine the data stored at the first memory matches the filter; and
send at least a portion of the data that matches the filter to the second node.

13. The system of claim 10 , the processor further to:
rebuild the queue to obtain a rebuilt queue of the one or more modifications to the data in the cache when the first node has crashed, wherein the processor is further to rebuild the queue during an iteration period of a search query to define a filter; and
send the rebuilt queue to the second node.

14. The system of claim 13 , wherein the processor is further to record the one or more modifications during the iteration period.

15. A system comprising:
a first memory to store data; and
a processor coupled to the first memory, the processor to:
maintain a queue indicating one or more modifications to data in a second memory of a first node in a data grid system;
detect a failure of the first node in the data grid has crashed; and
send the queue to a second node, wherein to detect the failure of the first node, the processor is further to:
determine that a heartbeat message initiated by the first node has not been received from the first node within a threshold period of time;
communicate a check node request to a third node;
receive a failure notification from the third node; and
determine that the first node has crashed in view of the failure notification.

16. A method comprising:
sending, from a first node, a data filter to a second node;
receiving, at the first node, first data from a first memory of the second node that matches the data filter;
sending, from the first node, the data filter to a third node;
receiving, at the first node, backup data from a second memory of the third node that matches the data filter; and
adding at least a portion of the backup data to the first data, wherein the portion of the backup data that does not include second data that is duplicative of the first data.

17. The method of claim 16 , further comprising receiving, at the first node, a duplicate data notification from the third node indicating that the backup data comprises third data duplicative of the second data received from the second node.

18. The method of claim 16 , wherein the first node, the second node, and the third node are in a data grid system.

19. The method of claim 16 , wherein:
the backup data is third data of the second node stored at the third node; and
the backup data is sent by the third node to the first node when the second node has crashed.

20. The system of claim 10 , wherein to detect the failure of the first node, the processor is further to:
determine that a heartbeat message initiated by the first node has not been received from the first node within a threshold period of time;
communicate a check node request to a third node;
receive a failure notification from the third node; and
determine that the first node has crashed in view of the failure notification.

Assignees

• Red Hat Inc

Inventors

• Markus Mircea
• Burns William Rosenquist

Classifications

• G06F11/2043

  where the redundant components share a common memory address space · CPC title

• G06F11/2025

  using centralised failover control functionality · CPC title

• G06Q20/4016

  involving fraud or risk level assessment in transaction processing · CPC title

• G06F16/285

  Clustering or classification · CPC title

• G06Q20/102

  Bill distribution or payments · CPC title