检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:经成 谢军[1] JING Cheng;XIE Jun(School of Mathematics and Computer Sciences,Nanchang University,Nanchang 330031,China)
机构地区:[1]南昌大学数学与计算机学院,江西南昌330031
出 处:《南昌大学学报(理科版)》2022年第4期399-404,415,共7页Journal of Nanchang University(Natural Science)
基 金:江西省教育厅科学技术研究项目(赣教技字[GJJ13088]号)。
摘 要:针对传统负载均衡算法的局限性,设计了基于最低并发负载算法的动态权重负载均衡(DWLB)算法,算法根据服务器节点的性能计算得出系统节点的权重,当最低并发算法失效,算法升级为动态权重算法,权重大的节点被选中的概率也会更大。实验结果表明,本文提出的负载均衡算法具有高可行性。In view of the limitations of the traditional load balancing algorithm,this paper designed a dynamic weight load balancing(DWLB)algorithm based on the minimum concurrent load algorithm.The algorithm calculated the weight of the system node according to the performance of the server node.When the minimum concurrent algorithm failed,the algorithm was upgraded to a dynamic weight algorithm,and the node with significant weight had a greater probability of being selected.Experimental results showed that the proposed load balancing algorithm is highly feasible.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222