Binary Tree Dynamic Load Balancing Method
Zhao Lian · Jisuanji gongcheng · 2003
A binary tree dynamic load balancing method was presented in this paper. It used the binary tree dynamic load balancing system modeling,the underlying bottleneck problems,which exist in centralized load balancing system when the main node assigns the tasks,replies request and moves load,was solved. Request load balancing when the load of node is less than a given number to increase the efficiency of CPU. The results of analysis showed that the method can effectively improve the performance of the parallel computing,especially when there is a large number of the tasks.