# Dynamic Load Balancing

In this article, we will learn an overview of discussing about the **algorithms of dynamic load balancing in brief**.

Submitted by Uma Dasgupta, on March 08, 2020

## Dynamic Load Balancing

The algorithm monitors changes on the system workload and redistributes the work accordingly.

This algorithm works on three strategies:

- Transfer strategy
- Location strategy
- Information strategy

**Transfer Strategy** decides on which task is eligible for transfer to other nodes for processing.

**Location Strategy** nominates a remote node to execute a transfer task.

**Information Strategy** is the information center for load balancing; it is responsible for providing location and transfer strategies to each node.

There are three **controlling forms** also, they are,

- Centralized
- Distributed
- Semi- Distributed

**Central queue algorithm**: This algorithm stores new activity and unfulfilled requests in a cycle or we can say in a FIFO queue. Each new activity is inserted in this queue then whenever a request for an activity is received, the first activity is removed from the queue if, there is buffered until the new activity is available. This is the centralized initiated algorithm and needs high inter-process communication.

**Local queue algorithm**: This algorithm supposes inter-process migration, this idea is static allocation of all new processes with process migration initiated by the host when its load falls under the predefined minimum number of ready processes, when the host gets under load it requests for the activities from the remote host. The remote host lookup its local list for ready activities and some of the activities are passed on to the requester host and get the acknowledgment from the host.

This is a distributive cooperative algorithm which requires inter-process communication but lesser as compared to the central queue algorithm.

**Least connection Algorithm**: This algorithm decides the load distribution based on connection, present on a node, the load balancer maintains the law of numbers the number increases when a new connection is established and decreases when connection finished or timed out. The nodes with least no. of connections are selected first.

**Conclusion:**

In this article, we have discussed the **various algorithms of dynamic load balancing in brief**. For further queries shoot your questions in the comment section.

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions

**Ad:**
Are you a blogger? Join our Blogging forum.