静态负载均衡和动态负载均衡

动态负载平衡 (Dynamic Load Balancing)

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

该算法监视系统工作负载的变化并相应地重新分配工作。

This algorithm works on three strategies:

该算法适用于三种策略：

1. Transfer strategy

   转移策略

2. Location strategy

   区位策略

3. 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,

还有三种控制形式 ，它们是

1. Centralized

   集中

2. Distributed

   分散式

3. 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.

中央队列算法 ：该算法在一个周期中存储新的活动和未完成的请求，或者我们可以说在FIFO队列中。 每个新活动都插入到此队列中，然后每当收到对活动的请求时，如果有第一个活动被缓冲，直到新活动可用之前，都会将其从队列中删除。 这是集中启动的算法，需要较高的进程间通信。

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.

在本文中，我们简要讨论了动态负载平衡的各种算法 。 如有其他查询，请在评论部分中提出您的问题。

翻译自: https://www.includehelp.com/basics/dynamic-load-balancing.aspx

静态负载均衡和动态负载均衡