Load balancing and fault tolerant service in a distributed data system

Patent metadata

Field	Value
Publication number	US-10521276-B2
Application number	US-201715727713-A
Country	US
Kind code	B2
Filing date	Oct 9, 2017
Priority date	Feb 12, 2015
Publication date	Dec 31, 2019
Grant date	Dec 31, 2019

Abstract

Techniques for load balancing and fault tolerant service are described. An apparatus may comprise load balancing and fault tolerant component operative to execute a load balancing and fault tolerant service in a distributed data system. The load balancing and fault tolerant service distributes a load of a task to a first node in a cluster of nodes using a routing table. The load balancing and fault tolerant service stores information to indicate the first node from the cluster of nodes is assigned to perform the task. The load balancing and fault tolerant service detects a failure condition for the first node. The load balancing and fault tolerant service moves the task to a second node from the cluster of nodes to perform the task for the first node upon occurrence of the failure condition.

First claim

The invention claimed is:

1. A method, comprising:
creating relationships between a quorum of nodes in a cluster, wherein a node and a user space process for the node is added to the quorum of nodes; and
reassigning a relationship handled by the user space process based upon the user space process failing and a set of classes within a library of a service, comprising a replicated database service, returning a list of functioning nodes that excludes the node.

2. The method of claim 1 , comprising:
assigning each user space process of each node within the quorum of nodes to handle a virtual server disaster recovery relationship of the cluster.

3. The method of claim 1 , wherein a single user space process is assigned to each node.

4. The method of claim 1 , wherein the user space process comprises a virtual server disaster recovery process.

5. The method of claim 1 , comprising:
storing information indicative of tasks being assigned to nodes.

6. The method of claim 1 , comprising:
utilizing an RDB ring of a current user space process to detect that a current node has failed.

7. The method of claim 1 , comprising:
utilizing an RDB ring of a current user space process to detect that a current node has been activated.

8. The method of claim 6 , comprising:
executing a monitoring thread to check performance status of the RDB ring at predetermined intervals to determine if the current user space process has failed.

9. The method of claim 1 , comprising:
storing information indicative of tasks being assigned to nodes within a routing table accessible to nodes of the cluster.

10. The method of claim 9 , comprising:
storing an indication of a node joining the quorum of nodes within the routing table.

11. The method of claim 9 , comprising:
storing an indication of a node leaving the quorum of nodes within the routing table.

12. The method of claim 9 , comprising:
maintaining, in the routing table, an ownership list indicating which node in the cluster is a most recent owner responsible for a task.

13. The method of claim 1 , comprising:
reassigning a task from a first node to a second node of the quorum of nodes to perform the task based upon occurrence of a failure condition of the first node.

14. A computing device, comprising:
a memory comprising instructions for performing a method; and
a processor coupled with the memory, the processor configured to execute the instructions to cause the processor to:
create relationships between a quorum of nodes in a cluster, wherein a node and a user space process for the node is added to the quorum of nodes; and
reassign a relationship handled by the user space process based upon the user space process failing and a set of classes within a library of a service, comprising a replicated database service, returning a list of functioning nodes that excludes the node.

15. The computing device of claim 14 , the instructions to cause the processor to:
assign each user space process of each node within the quorum of nodes to handle a virtual server disaster recovery relationship of the cluster.

16. The computing device of claim 14 , wherein a single user space process is assigned to each node.

17. The computing device of claim 14 , wherein the user space process comprises a virtual server disaster recovery process.

18. The computing device of claim 14 , comprising:
storing information indicative of tasks being assigned to nodes within a routing table accessible to nodes of the cluster.

19. A non-transitory computer-readable storage medium comprising instructions that, when executed by a processor, cause the processor to:
create relationships between a quorum of nodes in a cluster, wherein a node and a user space process for the node is added to the quorum of nodes; and
reassign a relationship handled by the user space process based upon the user space process failing and a set of classes within a library of a service, comprising a replicated database service, returning a list of functioning nodes that excludes the node.

20. The computer-readable storage medium of claim 19 , wherein the instructions cause the processor to:
assign each user space process of each node within the quorum of nodes to handle a virtual server disaster recovery relationship of the cluster.

Assignees

• Netapp Inc

Inventors

• Karnawat Rakshit
• Ts Veena
• Marappa Ganesh

Classifications

• G06F11/3433

  for load management (allocation of a server based on load conditions G06F9/505; load rebalancing G06F9/5083; redistributing the load in a network by a load balancer H04L67/1029) · CPC title

• G06F11/2035

  without idle spare hardware · CPC title

• G06F2201/805

  Real-time · CPC title

• G06F11/1484

  involving virtual machines · CPC title

• G06F9/5088 Primary

  involving task migration · CPC title