检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王文博 叶庆卫[1] 周宇[1] 陆志华 WANG Wenbo;YE Qingwei;ZHOU Yu;LU Zhihua(School of Information Science and Engineering,Ningbo University,Ningbo 315211,China)
机构地区:[1]宁波大学信息科学与工程学院,浙江宁波315211
出 处:《电信科学》2018年第7期86-91,共6页Telecommunications Science
基 金:国家自然科学基金资助项目(No.51675286;No.61071198);浙江省重点科技创新团队资助项目(No.2013TD21)~~
摘 要:互联网通信、计算机集群和云环境均具有一定的复杂性和动态性,极易发生负载失衡,从而降低服务效率、增加能耗。因此,负载均衡技术成为重点研究课题。现有的负载均衡策略均是以CPU、内存、进程等参数的占用率来评估服务器当前的负载情况,但服务器负载情况的复杂性往往使其难以得到准确评估。针对该问题,提出了一种基于排队论综合指标评估的动态负载均衡算法,首先引入排队论模型评估各服务器的实时负载情况,然后根据各服务器的负载综合指标,将输入队列中的任务逐一分配给各服务器。实验结果表明,该方法可有效平衡各服务器的负载且减少任务请求的平均等待时间。Internet communication, computer cluster and cloud environment have complex and dynamic characteristics, which can cause load imbalance easily, reduce the service efficiency and increase the energy consumption. Therefore, the load balancing technology becomes the focus of research. The existing load balancing strategy uses the occupancy of CPU, memories, processes to estimate the current load of each server. But it is hard to guarantee its accuracy. Aiming at this problem, a dynamic load balancing algorithm based on queuing theory comprehensive index evaluation was proposed. Firstly, queuing theory model was introduced to estimate the real-time load of each server, and then the tasks of input queue was distributed to each server separately according to the load comprehensive index of each server. Experimental results show that this method can balance the load of each server effectively and reduce the average waiting time of the task requests, which is of great application value.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222