CAJ | 학술논문

资源共享是分布式计算的核心问题，平衡负载是实现资源共享的基本手段。现有的负载均衡算法多局限于同构网络，伴随计算终端多元化的发展趋势，面向异构网络的负载均衡需求也不断增加。该文基于经典的扩散算法，提出一种适用于异构网络环境的新的动态负载均衡算法，并通过严格的数学方法证明了算法中各结点可收敛于平衡点。实验结果表明，该算法的收敛性能优于Rotaru 等人(2004)提出的GDA算法，并且对于网状网络、星型网络和花环网络等经典结构都有良好的收敛性，即便在随机生成的网络结构中，仍然保持了较快的收敛速度。
자원공향시분포식계산적핵심문제，평형부재시실현자원공향적기본수단。현유적부재균형산법다국한우동구망락，반수계산종단다원화적발전추세，면향이구망락적부재균형수구야불단증가。해문기우경전적확산산법，제출일충괄용우이구망락배경적신적동태부재균형산법，병통과엄격적수학방법증명료산법중각결점가수렴우평형점。실험결과표명，해산법적수렴성능우우Rotaru 등인(2004)제출적GDA산법，병차대우망상망락、성형망락화화배망락등경전결구도유량호적수렴성，즉편재수궤생성적망락결구중，잉연보지료교쾌적수렴속도。
Resource sharing is one of the key issues of distributed computing, and load balancing is the fundamental approach to sharing scarce resource in a distributed computing system. However, the existing load balancing methods are mostly confined to the homogeneous networks. With the diversity of the computing terminals, there is increasing requirement for the study of load balancing toward the heterogeneous networks. In this paper, a diffusion-based dynamic load balancing algorithm is proposed for the heterogeneous networks and it is proved with mathematical strictness that all nodes will converge to the excepted balanced point. The numerical results show that the algorithm is better than the GDA algorithm proposed by Rotaru et al. (2004) and has ideal convergence property over many network topologies including Mesh, Star and Tours etc. And it converges rather fast even in a randomly generated network.