靜態負載均衡和動態負載均衡
動態負載平衡 (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.
中央隊列算法 ：該算法在一個周期中存儲新的活動和未完成的請求，或者我們可以說在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
靜態負載均衡和動態負載均衡
