on the node looking for work executes a takeover algorithm to determine which node to take from in one embodiment the takeover algorithm is as follows 1 calculate the total points for each of other nodes for example given a service type 1 worker process on node 3 looking for work and considering the sample table provided above and for q 1000 r 100 and s 1 it would be found that node 1 has 1000 points and node 2 has 1100 points note that in this implementation total points are calculated in light of the type of worker who is seeking work hence if a service_type 2 worker were looking for work the point totals would be different e g node 1 has a worker of a service type 1 which would warrant award of r 100 points and no worker that is of service_type 2 so q points would not be awarded meanwhile node 2 has a worker of service_type 1 which would warrant award of r 100 points and a worker of service_type 2 which would warrant award q 1000 points 2 identify the node with the most points call this node_max continuing this example this is node 2 with 1100 points 3 calculate the total points of the worker 39 s own node call this self_points in this example assume that node 3 has 0 points 4 the algorithm determines whether to takeover as follows take over work from node_max if.